MultiAspect Graphs: Algebraic representation and algorithms

We present the algebraic representation and basic algorithms for MultiAspect Graphs (MAGs). A MAG is a structure capable of representing multilayer and time-varying networks, as well as higher-order networks, while also having the property of being isomorphic to a directed graph. In particular, we show that, as a consequence of the properties associated with the MAG structure, a MAG can be represented in matrix form. Moreover, we also show that any possible MAG function (algorithm) can be obtained from this matrix-based representation. This is an important theoretical result since it paves the way for adapting well-known graph algorithms for application in MAGs. We present a set of basic MAG algorithms, constructed from well-known graph algorithms, such as degree computing, Breadth First Search (BFS), and Depth First Search (DFS). These algorithms adapted to the MAG context can be used as primitives for building other more sophisticated MAG algorithms. Therefore, such examples can be seen as guidelines on how to properly derive MAG algorithms from basic algorithms on directed graphs. We also make available Python implementations of all the algorithms presented in this paper.

[1]  Jari Saramäki,et al.  Temporal Networks , 2011, Encyclopedia of Social Network Analysis and Mining.

[2]  Vincent D. Blondel,et al.  A survey of results on mobile phone datasets analysis , 2015, EPJ Data Science.

[3]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[4]  Phillip Bonacich,et al.  Some unique properties of eigenvector centrality , 2007, Soc. Networks.

[5]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[6]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[7]  Lek-Heng Lim,et al.  Singular values and eigenvalues of tensors: a variational approach , 2005, 1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005..

[8]  Vassilis Kostakos.  Temporal Graphs , 2014, Encyclopedia of Social Network Analysis and Mining.

[9]  Albert Solé-Ribalta,et al.  Navigability of interconnected networks under random failures , 2013, Proceedings of the National Academy of Sciences.

[10]  Eric Fleury,et al.  A unifying model for representing time-varying graphs , 2014, 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA).

[11]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[12]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.

[13]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[14]  G. Walter,et al.  Graphs and Matrices , 1999 .

[15]  José Ignacio Alvarez-Hamelin,et al.  Social Events in a Time-Varying Mobile Phone Graph , 2017, ArXiv.

[16]  Michael William Newman,et al.  The Laplacian spectrum of graphs , 2001 .

[17]  Amit Kumar,et al.  Connectivity and inference problems for temporal networks , 2000, STOC '00.

[18]  Jure Leskovec,et al.  Higher-order organization of complex networks , 2016, Science.

[19]  Alex Borges Vieira,et al.  Fast centrality-driven diffusion in dynamic networks , 2013, WWW.

[20]  W. Y. Szeto,et al.  Review on Urban Transportation Network Design Problems , 2013 .

[21]  Ingo Scholtes,et al.  Higher-order aggregate networks in the analysis of temporal networks: path structures and centralities , 2015, The European Physical Journal B.

[22]  Michael Szell,et al.  Multirelational organization of large-scale social networks in an online world , 2010, Proceedings of the National Academy of Sciences.

[23]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[24]  Artur Ziviani,et al.  Distributed assessment of the closeness centrality ranking in complex networks , 2012, SIMPLEX '12.

[25]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[26]  Lucas Maia Silveira,et al.  Analyzing the workload dynamics of a mobile phone network in large scale events , 2012, UrbaNe '12.

[27]  Artur Ziviani,et al.  DACCER: Distributed Assessment of the Closeness CEntrality Ranking in complex networks , 2013, Comput. Networks.

[28]  Alex Arenas,et al.  Mapping Multiplex Hubs in Human Functional Brain Networks , 2016, Front. Neurosci..

[29]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[30]  Eric Fleury,et al.  On MultiAspect graphs , 2014, Theor. Comput. Sci..

[31]  O. Sporns,et al.  Complex brain networks: graph theoretical analysis of structural and functional systems , 2009, Nature Reviews Neuroscience.

[32]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[33]  B. Bollobás.  The evolution of random graphs , 1984 .

[34]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[35]  Mason A. Porter,et al.  Author Correction: The physics of spreading processes in multilayer networks , 2016, 1604.02021.

[36]  Guy Karlebach,et al.  Modelling and analysis of gene regulatory networks , 2008, Nature Reviews Molecular Cell Biology.

[37]  Guillaume Chelius,et al.  Electronic Sensors for Assessing Interactions between Healthcare Workers and Patients under Airborne Precautions , 2012, PloS one.

[38]  Mason A. Porter,et al.  Multilayer networks , 2013, J. Complex Networks.

[39]  Frank Harary,et al.  Graph Theory , 2016 .

[40]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[41]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[42]  Noah E. Friedkin,et al.  Theoretical Foundations for Centrality Measures , 1991, American Journal of Sociology.

[43]  Sergio Gómez,et al.  Spectral properties of the Laplacian of multiplex networks , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[44]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[45]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[46]  T. Kolda.  Multilinear operators for higher-order decompositions , 2006 .

[47]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[48]  Walter A. Kosters,et al.  Computing the Eccentricity Distribution of Large Graphs , 2013, Algorithms.

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

[50]  A. Arenas,et al.  Mathematical Formulation of Multilayer Networks , 2013, 1307.4977.

[51]  P. Bonacich.  Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[52]  Alex Borges Vieira,et al.  Time Centrality in Dynamic Complex Networks , 2015, Adv. Complex Syst..

[53]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

[54]  B. Mohar.  THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[55]  Sergio Gómez,et al.  Random Walks on Multiplex Networks , 2013, ArXiv.

[56]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[57]  Ross J. Anderson,et al.  Temporal node centrality in complex networks. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[58]  Hai Yang,et al.  Modeling the capacity and level of service of urban transportation networks , 2000 .

[59]  Martin Romauch,et al.  A mathematical program to refine gene regulatory networks , 2009, Discret. Appl. Math..

[60]  P. Gács,et al.  Algorithms , 1992 .

[61]  Artur Ziviani,et al.  Distributed location of the critical nodes to network robustness based on spectral analysis , 2011, 2011 7th Latin American Network Operations and Management Symposium.

[62]  Afonso Ferreira,et al.  On models and algorithms for dynamic communication networks : the case for evolving graphs † , 2007 .

[63]  Sergio Gómez,et al.  Ranking in interconnected multilayer networks reveals versatile nodes , 2013, Nature Communications.

[65]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[66]  Tinkara Toš,et al.  Graph Algorithms in the Language of Linear Algebra , 2012, Software, environments, tools.

[67]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[68]  Fan R. K. Chung,et al.  Lectures on Spectral Graph Theory , 2001 .

[69]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[70]  V Latora,et al.  Small-world behavior in time-varying graphs. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[71]  Z. Wang,et al.  The structure and dynamics of multilayer networks , 2014, Physics Reports.

[72]  Patrick Thiran,et al.  Layered complex networks. , 2006, Physical review letters.