On MultiAspect graphs

Klaus Wehmuth 1 Artur Ziviani 1 Eric Fleury 2, 3
3 DANTE - Dynamic Networks : Temporal and Structural Capture Approach
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme, IXXI - Institut Rhône-Alpin des systèmes complexes
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 modeling abstraction for networked complex systems. This paper formalizes the concept of MAG and derives theoretical results useful in the analysis of complex networked systems modeled using the proposed MAG abstraction. We also present an overview of the MAG applicability.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2016, 651, pp.50-61. 〈10.1016/j.tcs.2016.08.017〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01424657
Contributeur : Eric Fleury <>
Soumis le : lundi 2 janvier 2017 - 16:11:38
Dernière modification le : jeudi 12 juillet 2018 - 01:11:56

Lien texte intégral

Identifiants

Citation

Klaus Wehmuth, Artur Ziviani, Eric Fleury. On MultiAspect graphs. Theoretical Computer Science, Elsevier, 2016, 651, pp.50-61. 〈10.1016/j.tcs.2016.08.017〉. 〈hal-01424657〉

Partager

Métriques

Consultations de la notice

312