Edge anisotropy and the geometric perspective on flow networks.

@article{Molkenthin2017EdgeAA,
  title={Edge anisotropy and the geometric perspective on flow networks.},
  author={Nora Molkenthin and Hannes Kutza and Liubov Tupikina and Norbert Marwan and Jonathan F. Donges and Ulrike Feudel and J{\"u}rgen Kurths and Reik V. Donner},
  journal={Chaos},
  year={2017},
  volume={27 3},
  pages={
          035802
        }
}
Spatial networks have recently attracted great interest in various fields of research. While the traditional network-theoretic viewpoint is commonly restricted to their topological characteristics (often disregarding the existing spatial constraints), this work takes a geometric perspective, which considers vertices and edges as objects in a metric space and quantifies the corresponding spatial distribution and alignment. For this purpose, we introduce the concept of edge anisotropy and define… 

Figures and Tables from this paper

Edge directionality properties in complex spherical networks.
TLDR
This work investigates the applicability of mean edge direction, anisotropy, and local mean angle as geometric characteristics in complex spherical networks, and demonstrates the existence of a systematic bias in spatial networks where individual nodes represent different shares on a spherical surface.
Characterizing Flows by Complex Network Methods
TLDR
This chapter summarizes recent developments in correlation-based functional network approaches and Lagrangian flow networks, and provides some illustrative examples highlighting the application of both concepts to selected paradigmatic low-dimensional model systems.
Clustering coefficient and periodic orbits in flow networks.
We show that the clustering coefficient, a standard measure in network theory, when applied to flow networks, i.e., graph representations of fluid flows in which links between nodes represent fluid
Introduction to Focus Issue: Complex network perspectives on flow systems.
TLDR
This Focus Issue presents a collection of contributions addressing the description of flows and associated transport processes from the network point of view and its relationship to other approaches which deal with fluid transport and mixing and/or use complex network techniques.
Spatio-temporal organization of dynamics in a two-dimensional periodically driven vortex flow: A Lagrangian flow network perspective.
TLDR
A directed network is constructed that describes the exchange of mass between distinct regions of the flow domain using a discrete approximation of the system's transfer operator and is able to delimit co-existing flow regimes with different dynamics.
Dynamics on networks. Case of Heterogeneous Opinion Status Model
TLDR
It is shown that not only clear topological network properties, such as node degree, but also, the nodes' status distribution (the factor of network heterogeneity) play an important role in so-called opinion spreading and information diffusion on a network.
Dynamics on networks
TLDR
A new conceptual, stochastic Heterogeneous Opinion-Status model (HOpS model), presented in details in Section 2.0, which admits to identify the main attributes of dynamics on networks and to study analytically the relation between topological network properties and processes taking place on a network.
A causal flow approach for the evaluation of global climate models
TLDR
An Evaluation of Models by Causal Flows (EMCaF) is proposed, which aims to assess the weaknesses and strengths of GCMs to represent climate mechanisms and processes that couple different components of the climate system.
Generative dynamic link prediction.
TLDR
Experimental results validate that GDLP significantly outperforms several existing baseline methods on many types of dynamic networks, which improves the effectiveness of dynamic link prediction.

References

SHOWING 1-10 OF 53 REFERENCES
Urban road networks — spatial networks with universal geometric features?
TLDR
This work finds that the small-scale geometry of all examined road networks is extremely similar, and demonstrates the fundamental importance of cost-efficiency constraints for the time evolution of urban road networks.
Spatial network surrogates for disentangling complex system structure from spatial embedding of nodes
TLDR
A hierarchy of null models to generate random surrogates from a given spatially embedded network that can preserve certain global and local statistics associated with the nodes' embedding in a metric space is proposed.
Spatial Networks
Networks from Flows - From Dynamics to Topology
TLDR
Analysing complex networks of prototypical flows and from time series data of the equatorial Pacific, it is found that the analytical model reproduces the most salient features of these networks and thus provides a general foundation of climate networks.
Node-weighted measures for complex networks with spatially embedded, sampled, or differently sized nodes
TLDR
This work proposes an axiomatic scheme based on the idea of node splitting invariance to derive consistently weighted variants of various commonly used statistical network measures that are of fundamental importance in the study of spatially embedded functional networks derived from time series.
Investigating the topology of interacting networks
TLDR
A novel graph-theoretical framework for studying the interaction structure between subnetworks embedded within a complex network of networks is introduced and the new measure “cross-betweenness” identifies regions which are particularly important for mediating vertical wind field interactions.
Entropy and order in urban street networks
TLDR
Entropy measures for quantifying the complexity of street orientations and length variations within planar networks are applied to the street networks of 41 British cities and show that the old central parts of the cities have lower orientation/length entropies.
Clustering in complex directed networks.
  • G. Fagiolo
  • Computer Science, Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2007
TLDR
The CC is extended to the case of (binary and weighted) directed networks and its expected value for random graphs is computed and is distinguished between CCs that count all directed triangles in the graph (independently of the direction of their edges) andCCs that only consider particular types of directed triangles (e.g., cycles).
Correlation Networks from Flows. The Case of Forced and Time-Dependent Advection-Diffusion Dynamics
TLDR
This work proposes a theoretical approach for verifying relations between the correlation matrix and the climate network measures and reveals that correlation networks are not sensitive to steady sources and sinks and the profound impact of the signal decay rate on the network topology.
The spatial structure of networks
TLDR
There are strong signatures in these networks of topography and use patterns, giving the networks shapes that are quite distinct from one another and from non-geographic networks.
...
...