On Joint Diagonalisation for Dynamic Network Analysis

Joint diagonalisation (JD) is a technique used to estimate an average eigenspace of a set of matrices. Whilst it has been used successfully in many areas to track the evolution of systems via their eigenvectors; its application in network analysis is novel. The key focus in this paper is the use of JD on matrices of spanning trees of a network. This is especially useful in the case of real-world contact networks in which a single underlying static graph does not exist. The average eigenspace may be used to construct a graph which represents the `average spanning tree' of the network or a representation of the most common propagation paths. We then examine the distribution of deviations from the average and find that this distribution in real-world contact networks is multi-modal; thus indicating several \emph{modes} in the underlying network. These modes are identified and are found to correspond to particular times. Thus JD may be used to decompose the behaviour, in time, of contact networks and produce average static graphs for each time. This may be viewed as a mixture between a dynamic and static graph approach to contact network analysis.

[1]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

[2]  John Skvoretz,et al.  Node centrality in weighted networks: Generalizing degree and shortest paths , 2010, Soc. Networks.

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[4]  A. Bunse-Gerstner,et al.  Numerical Methods for Simultaneous Diagonalization , 1993, SIAM J. Matrix Anal. Appl..

[5]  Giuseppe Thadeu Freitas de Abreu,et al.  Gershgorin Analysis of Random Gramian Matrices With Application to MDS Tracking , 2011, IEEE Transactions on Signal Processing.

[6]  Injong Rhee,et al.  On the levy-walk nature of human mobility , 2011, TNET.

[7]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[8]  Camille Roth,et al.  Generalized Preferential Attachment : Towards Realistic Socio-Semantic Network Models , 2005 .

[9]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[10]  P. Deb.  Finite Mixture Models , 2008 .

[11]  Cecilia Mascolo,et al.  On Nonstationarity of Human Contact Networks , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems Workshops.

[12]  Antoine Souloumiac,et al.  Jacobi Angles for Simultaneous Diagonalization , 1996, SIAM J. Matrix Anal. Appl..

[13]  J. Cardoso,et al.  Blind beamforming for non-gaussian signals , 1993 .

[14]  Geoffrey J. McLachlan,et al.  Finite Mixture Models , 2019, Annual Review of Statistics and Its Application.

[15]  Eiko Yoneki,et al.  Visualizing communities and centralities from encounter traces , 2008, CHANTS '08.

[16]  Jon Crowcroft,et al.  Rhythm and Randomness in Human Contact , 2010, 2010 International Conference on Advances in Social Networks Analysis and Mining.

[17]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[18]  Tristan Henderson,et al.  CRAWDAD: a community resource for archiving wireless data at Dartmouth , 2005, CCRV.

[19]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations , 2010 .

[20]  S. Chick,et al.  Methods and measures for the description of epidemiologic contact networks , 2001, Journal of urban health.

[21]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations (Lecture Notes in Computer Science) , 2005 .

[22]  Jimeng Sun,et al.  Beyond streams and graphs: dynamic tensor analysis , 2006, KDD '06.

[23]  Stratis Ioannidis,et al.  Distributing content updates over a mobile social network , 2009, MOCO.

[24]  Saeid Sanei,et al.  Penalty function-based joint diagonalization approach for convolutive blind separation of nonstationary sources , 2005, IEEE Transactions on Signal Processing.

[25]  M. Wax,et al.  A least-squares approach to joint diagonalization , 1997, IEEE Signal Processing Letters.