Abstract: Different graph generalizations have been recently used in an ad-hoc manner to represent multilayer networks, i.e. systems formed by distinct layers where each layer can be seen as a network. Similar constructions have also been used to represent time-varying networks. We introduce the concept of MultiAspect Graph (MAG) as a graph generalization that we prove to be isomorphic to a directed graph, and also capable of representing all previous generalizations. In our proposal, the set of vertices, layers, time instants, or any other independent features are considered as an aspect of the MAG. For instance, a MAG is able to represent multilayer or time-varying networks, while both concepts can also be combined to represent a multilayer time-varying network and even other higher-order networks. Since the MAG structure admits an arbitrary (finite) number of aspects, it hence introduces a powerful modelling abstraction for networked complex systems. This paper formalizes the concept of MAG and derives theoretical results useful in the analysis of complex networked systems modelled using the proposed MAG abstraction. We also present an overview of the MAG applicability.
Recommendations
- Multiaspect graphs: algebraic representation and algorithms
- Deep graphs -- a general framework to represent and analyze heterogeneous complex systems across scales
- Line graphs for a multiplex network
- Multiplexity analysis of networks using multigraph representations
- Multilayer networks: metrics and spectral properties
Cites work
- scientific article; zbMATH DE number 5776838 (Why is no real title available?)
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Hypergraphs and Ramseyian Theorems
- Multiaspect graphs: algebraic representation and algorithms
- On extremal problems of graphs and generalized graphs
- On generalized graphs
- On the exploration of time-varying networks
Cited in
(8)- On sequential structures in incompressible multidimensional networks
- Mapping higher-order network flows in memory and multilayer networks with Infomap
- On seed graphs with more than two components
- Weighted, bipartite, or directed stream graphs for the modeling of temporal networks
- On the plurality of graphs
- Algorithmic networks: central time to trigger expected emergent open-endedness
- Deep graphs -- a general framework to represent and analyze heterogeneous complex systems across scales
- Multiaspect graphs: algebraic representation and algorithms
This page was built for publication: On multiaspect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517022)
