MultiAspect Graphs: Algebraic representation and algorithms
arXiv:1504.07893
Abstract
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 graph. We also make available Python implementations of all the algorithms presented in this paper.
arXiv comment59 pages, 6 figures
References in corpus (14)
- Emergence of scaling in random networks
- Epidemic spreading in scale-free networks
- Catastrophic cascade of failures in interdependent networks
- Higher-order organization of complex networks
- Multirelational Organization of Large-scale Social Networks in an Online World
- The physics of spreading processes in multilayer networks
- Random Walks on Multiplex Networks
- Layered Complex Networks
- Spectral properties of the Laplacian of multiplex networks
- Small-world behavior in time-varying graphs
- Mapping multiplex hubs in human functional brain network
- Time Centrality in Dynamic Complex Networks
- On MultiAspect Graphs
- Social Events in a Time-Varying Mobile Phone Graph