Structure of complex networks: Quantifying edge-to-edge relations by failure-induced flow redistribution

Abstract

The analysis of complex networks has so far revolved mainly around the role of nodes and communities of nodes. However, the dynamics of interconnected systems is commonly focalised on edge processes, and a dual edge-centric perspective can often prove more natural. Here we present graph-theoretical measures to quantify edge-to-edge relations inspired by the notion of flow redistribution induced by edge failures. Our measures, which are related to the pseudo-inverse of the Laplacian of the network, are global and reveal the dynamical interplay between the edges of a network, including potentially non-local interactions. Our framework also allows us to define the embeddedness of an edge, a measure of how strongly an edge features in the weighted cuts of the network. We showcase the general applicability of our edge-centric framework through analyses of the Iberian Power grid, traffic flow in road networks, and the C. elegans neuronal network.

24 pages, 6 figures

References in corpus (8)

• Synchronization in complex networks
• Line Graphs, Link Partitions and Overlapping Communities
• Suppressing cascades of load in interdependent networks
• Robustness of the European power grids under intentional attack
• Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit
• Encoding dynamics for multiscale community detection: Markov time sweeping for the Map equation
• The stability of a graph partition: A dynamics-based framework for community detection
• Protein multi-scale organization through graph partitioning and robustness analysis: Application to the myosin-myosin light chain interaction

Cited by in corpus (18)

• Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplacian
• Representing higher-order dependencies in networks
• Prediction of allosteric sites and mediating interactions through bond-to-bond propensities
• Critical links and nonlocal rerouting in complex supply networks
• Flow-based network analysis of the Caenorhabditis elegans connectome
• Flow Smoothing and Denoising: Graph Signal Processing in the Edge-Space
• Emergent failures and cascades in power grids: a statistical physics perspective
• Simplicial Convolutional Filters
• Sensitivity and spectral control of network lasers
• Allostery and cooperativity in multimeric proteins: bond-to-bond propensities in ATCase
• Scale-dependent measure of network centrality from diffusion dynamics
• Effective Resistance for Pandemics: Mobility Network Sparsification for High-Fidelity Epidemic Simulation
• Optimal design-for-control of self-cleaning water distribution networks using a convex multi-start algorithm
• Dual communities in spatial networks
• Current Redistribution in Resistor Networks: Fat-Tail Statistics in Regular and Small-World Networks
• Disentangling the Spectral Properties of the Hodge Laplacian: Not All Small Eigenvalues Are Equal
• An edge-based formulation of elastic network models
• Contagion-Preserving Network Sparsifiers: Exploring Epidemic Edge Importance Utilizing Effective Resistance