Deep Graphs - a general framework to represent and analyze heterogeneous complex systems across scales

  title={Deep Graphs - a general framework to represent and analyze heterogeneous complex systems across scales},
  author={Dominik Traxl and Niklas Boers and J{\"u}rgen Kurths},
  volume={26 6},
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… 

Figures and Tables from this paper

mully: An R Package to Create, Modify and Visualize Multilayered Graphs

The aim is to provide a generic modelling framework to integrate multiple pathway types and further knowledge sources influencing these networks, defined by a multi-layered model allowing automatic network transformations and documentation.

Implementing a multilayer framework for pathway data integration, analysis and visualization

The submitted poster will give an overview of the various models of multilayered networks, then it will describe the model it is building, and the workflow of implementing it into R as well as the future plan.

pyGSL: A Graph Structure Learning Toolkit

We introduce pyGSL, a Python library that provides efficient implementations of state-of-the-art graph structure learning models along with diverse datasets to evaluate them on. The implementations

Multilayer networks: aspects, implementations, and application in biomedicine

This paper reviews the different aspects and terminologies of multilayered networks, and gives an overview of various existing applications of the multilayer model in network biology.

Interlayer impacts to deep-coupling dynamical networks: A snapshot of equilibrium stability.

This paper defines deep-coupling networks with two categories of interlayer structures and investigates the equilibrium stability, when every node in the network is governed by a differential

Uncovering Cross-Cohort Molecular Features with Multi-Omics Integration Analysis

A pronounced effect of blood cell counts on protein abundance is revealed, strongly suggesting blood cell composition adjustment in protein-based association studies may be necessary, and a variation of the Gram-Schmidt algorithm is incorporated with SMCCA to improve orthogonality among CVs.

Potential Uses in Breadth

This chapter overviews a dozen knowledge representation (KR) possibilities in breadth and shows the benefits of organizing the authors' knowledge structures using Peirce’s universal categories and typologies.

The size distribution of spatiotemporal extreme rainfall clusters around the globe

The scaling behavior of rainfall has been extensively studied both in terms of event magnitudes and in terms of spatial extents of the events. Different heavy‐tailed distributions have been proposed

Spatio-temporal patterns of extreme fires in Amazonian forests

Fires are a fundamental part of the Earth System. In the last decades, they have been altering ecosystem structure, biogeochemical cycles and atmospheric composition with unprecedented rapidity. In

Python Packages for Networks

  • V. Batagelj
  • Business
    Encyclopedia of Social Network Analysis and Mining. 2nd Ed.
  • 2018



Mathematical Formulation of Multilayer Networks

This paper introduces a tensorial framework to study multilayer networks, and discusses the generalization of several important network descriptors and dynamical processes—including degree centrality, clustering coefficients, eigenvectorcentrality, modularity, von Neumann entropy, and diffusion—for this framework.

Foundations of Multidimensional Network Analysis

This paper develops a solid repertoire of basic concepts and analytical measures, which takes into account the general structure of multidimensional networks, and tests the validity and the meaningfulness of the measures introduced, that are able to extract important, nonrandom information about complex phenomena.

Node-weighted interacting network measures improve the representation of real-world complex systems

Using a prototypical spatial network model, it is shown that the newly introduced node-weighted interacting network measures provide an improved representation of the underlying system's properties as compared to their unweighted analogues.

Hierarchical block structures and high-resolution model selection in large networks

A nested generative model is constructed that, through a complete description of the entire network hierarchy at multiple scales, enables the detection of modular structure at levels far beyond those possible with current approaches, and is based on the principle of parsimony.

A benchmark model to assess community structure in evolving networks

A model for generating simple dynamic benchmark graphs, based on stochastic block models, which consists of a periodic oscillation of the system's structure between configurations with built-in community structure and the extension of quality comparison indices to the dynamic scenario.

Networks: An Introduction

This book brings together for the first time the most important breakthroughs in each of these fields and presents them in a coherent fashion, highlighting the strong interconnections between work in different areas.

Finding and evaluating community structure in networks.

  • M. NewmanM. Girvan
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.

Duality between Time Series and Networks

The results suggest that network analysis can be used to distinguish different dynamic regimes in time series and time series analysis can provide a powerful set of tools that augment the traditional network analysis toolkit to quantify networks in new and useful ways.

Robustness of a Network of Networks

A general analytical framework for studying percolation of n interdependent networks is developed and it is shown that for any tree of n fully dependent Erdős-Rényi networks, each of average degree k, the giant component is P∞ = p[1-exp(-kP∞)](n) where 1-p is the initial fraction of removed nodes.