A methodology to support reuse in the specification of Performability models
| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] Humboldt Univ, Dept Phys, Berlin - Germany
[2] Bernstein Ctr Computat Neurosci, Berlin - Germany
[3] Potsdam Inst Climate Impact Res, Potsdam - Germany
[4] Ecole Normale Super, Geosci Dept, Paris - France
[5] Ecole Normale Super, Lab Meteorol Dynam, Paris - France
[6] Nizhnii Novgorod State Univ, Dept Control Theory, Nizhnii Novgorod 603950 - Russia
Total Affiliations: 6
|
| Document type: | Journal article |
| Source: | Chaos; v. 26, n. 6 JUN 2016. |
| Web of Science Citations: | 3 |
| Abstract | |
Network theory has proven to be a powerful tool in describing and analyzing systems by modelling the relations between their constituent objects. Particularly in recent years, a great progress has been made by augmenting ``traditional{''} network theory in order to account for the multiplex nature of many networks, multiple types of connections between objects, the time-evolution of networks, networks of networks and other intricacies. However, existing network representations still lack crucial features in order to serve as a general data analysis tool. These include, most importantly, an explicit association of information with possibly heterogeneous types of objects and relations, and a conclusive representation of the properties of groups of nodes as well as the interactions between such groups on different scales. In this paper, we introduce a collection of definitions resulting in a framework that, on the one hand, entails and unifies existing network representations (e.g., network of networks and multilayer networks), and on the other hand, generalizes and extends them by incorporating the above features. To implement these features, we first specify the nodes and edges of a finite graph as sets of properties (which are permitted to be arbitrary mathematical objects). Second, the mathematical concept of partition lattices is transferred to the network theory in order to demonstrate how partitioning the node and edge set of a graph into supernodes and superedges allows us to aggregate, compute, and allocate information on and between arbitrary groups of nodes. The derived partition lattice of a graph, which we denote by deep graph, constitutes a concise, yet comprehensive representation that enables the expression and analysis of heterogeneous properties, relations, and interactions on all scales of a complex system in a self-contained manner. Furthermore, to be able to utilize existing network-based methods and models, we derive different representations of multilayer networks from our framework and demonstrate the advantages of our representation. On the basis of the formal framework described here, we provide a rich, fully scalable (and self-explanatory) software package that integrates into the PyData ecosystem and offers interfaces to popular network packages, making it a powerful, general-purpose data analysis toolkit. We exemplify an application of deep graphs using a real world data-set, comprising 16 years of satellite-derived global precipitation measurements. We deduce a deep graph representation of these measurements in order to track and investigate local formations of spatio-temporal clusters of extreme precipitation events. Published by AIP Publishing. (AU) | |
| FAPESP's process: | 11/50151-0 - Dynamical phenomena in complex networks: fundamentals and applications |
| Grantee: | Elbert Einstein Nehrer Macau |
| Support type: | Research Projects - Thematic Grants |