Communicability in complex networks

Abstract

Many topological and dynamical properties of complex networks are defined by assuming that most of the transport on the network flows along the shortest paths. However, there are different scenarios in which non-shortest paths are used to reach the network destination. Thus the consideration of the shortest paths only does not account for the global communicability of a complex network. Here we propose a new measure of the communicability of a complex network, which is a broad generalization of the concept of the shortest path. According to the new measure, most of real-world networks display the largest communicability between the most connected (popular) nodes of the network (assortative communicability). There are also several networks with the disassortative communicability, where the most "popular" nodes communicate very poorly to each other. Using this information we classify a diverse set of real-world complex systems into a small number of universality classes based on their structure-dynamic correlation. In addition, the new communicability measure is able to distinguish finer structures of networks, such as communities into which a network is divided. A community is unambiguously defined here as a set of nodes displaying larger communicability among them than to the rest of nodes in the network.

20 pages, 5 figures

References in corpus (20)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Community structure in social and biological networks
• Modularity and community structure in networks
• Uncovering the overlapping community structure of complex networks in nature and society
• Assortative mixing in networks
• Finding community structure in networks using the eigenvectors of matrices
• Functional cartography of complex metabolic networks
• Resolution limit in community detection
• Characterization of complex networks: A survey of measurements
• Defining and identifying communities in networks
• Subgraph Centrality in Complex Networks
• Detecting rich-club ordering in complex networks
• Classes of complex networks defined by role-to-role connectivity profiles
• The topological relationship between the large-scale attributes and local interaction patterns of complex networks
• Spectral Measures of Bipartivity in Complex Networks
• Spectral Scaling in Complex Networks
• Effect of congestion costs on shortest paths through complex networks
• Information Horizons in Networks

Cited by in corpus (111)

• Community detection in graphs
• Multilayer Networks
• The structure and dynamics of multilayer networks
• The Kuramoto model in complex networks
• Understanding brain networks and brain organization
• The Physics of Communicability in Complex Networks
• Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
• Optimally controlling the human connectome: the role of network topology
• Fundamentals of spreading processes in single and multilayer complex networks
• Navigation of brain networks
• Sparse graphs using exchangeable random measures
• Spectral entropies as information-theoretic tools for complex network comparison
• The impact of epilepsy surgery on the structural connectome and its relation to outcome
• A spectrum of routing strategies for brain networks
• Communicability Betweenness in Complex Networks
• The Influence of Network Topology on Sound Propagation in Granular Materials
• A Survey on Centrality Metrics and Their Implications in Network Resilience
• Functional complexity emerging from anatomical constraints in the brain: the significance of network modularity and rich-clubs
• Communicability reveals a transition to coordinated behavior in multiplex networks
• Discovery of Important Crossroads in Road Network using Massive Taxi Trajectories
• Models of communication and control for brain networks: distinctions, convergence, and future outlook
• Communicability Graph and Community Structures in Complex Networks
• How structure sculpts function: unveiling the contribution of anatomical connectivity to the brain's spontaneous correlation structure
• Beware of the Small-World neuroscientist!
• Exploiting symmetry in network analysis
• Analyzing complex networks through correlations in centrality measurements
• Solving the accuracy-diversity dilemma via directed random walks
• A Vibrational Approach to Node Centrality and Vulnerability in Complex Networks
• The diminishing role of hubs in dynamical processes on complex networks
• A bag-of-paths framework for network data analysis
• International Trade Network: Country centrality and COVID-19 pandemic
• Discrete-time quantum walk on complex networks for community detection
• Continuous-Time Quantum Search on Balanced Trees
• Lagrangian betweenness as a measure of bottlenecks in dynamical systems with oceanographic examples
• The Indirect Effects of FDI on Trade: A Network Perspective
• Communicability and multipartite structures in complex networks at negative absolute temperatures
• Ranking influential nodes in networks from partial information
• Maximal entropy random walk in community finding
• Explicit and implicit network connectivity: Analytical formulation and application to transport processes
• Polarization and multiscale structural balance in signed networks
• Similarities on Graphs: Kernels versus Proximity Measures
• Walk modularity and community structure in networks
• Fast computation of matrix function-based centrality measures for layer-coupled multiplex networks
• Community structure in the World Trade Network based on communicability distances
• The Green's Function for the Hückel (Tight Binding) Model
• Generalized network density matrices for analysis of multiscale functional diversity
• The multilayer architecture of the global input-output network and its properties
• A novel framework to analyze complex network dynamics
• Communicability Angles Reveal Critical Edges for Network Consensus Dynamics
• Fractional-order susceptible-infected model: definition and applications to the study of COVID-19 main protease
• Ensembling complex network 'perspectives' for mild cognitive impairment detection with artificial neural networks
• Relative, local and global dimension in complex networks
• An integrative dynamical perspective for graph theory and the study of complex networks
• Goal-directed graph construction using reinforcement learning
• The specificity and robustness of long-distance connections in weighted, interareal connectomes
• On structural and dynamical factors determining the integrated basin instability of power-grid nodes
• Maximal-entropy random walk unifies centrality measures
• Randomized Shortest Paths with Net Flows and Capacity Constraints
• 2-norm error bounds and estimates for Lanczos approximations to linear systems and rational matrix functions
• Absorbing Random Walks Interpolating Between Centrality Measures on Complex Networks
• Quantitative mapping of the brain's structural connectivity using diffusion MRI tractography: a review
• Smart random walkers: the cost of knowing the path
• Thermodynamics of network model fitting with spectral entropies
• Analytic relationship of relative synchronizability to network structure and motifs
• Exploring the "Middle Earth" of Network Spectra via a Gaussian Matrix Function
• Random-Graph Models and Characterization of Granular Networks
• Fortran code for generating random probability vectors, unitaries, and quantum states
• Geometric unfolding of synchronization dynamics on networks
• Structural Attacks on Local Routing in Payment Channel Networks
• Where to cut to delay a pandemic with minimum disruption? Mathematical analysis based on the SIS model
• "Clumpiness" Mixing in Complex Networks
• Centralities in Simplicial Complexes
• Covariance and Correlation Kernels on a Graph in the Generalized Bag-of-Paths Formalism
• Finding the right scale of a network: Efficient identification of causal emergence through spectral clustering
• Discriminating Power of Centrality Measures
• Indirect Influences on Directed Manifolds
• Null-eigenvalue localization of quantum walks on real-world complex networks
• Criterions for locally dense subgraphs
• Sparse Randomized Shortest Paths Routing with Tsallis Divergence Regularization
• Heterogeneous attachment strategies optimize the topology of dynamic wireless networks
• Optimal Sketching for Trace Estimation
• Decoding asymptomatic COVID-19 infection and transmission
• Tight-binding 'dihedral orbitals' approach to electronic communicability in macromolecular chains
• Gendered Networks and Communicability in Medieval Historical Narratives
• Dissecting graph measure performance for node clustering in LFR parameter space
• Higher-order shortest paths in hypergraphs
• Machine Learning Analysis of Complex Networks in Hyperspherical Space
• A 2D Levy-flight model for the complex dynamics of real-life financial markets
• Adjustable reach in a network centrality based on current flows
• On the stability of the PWP method
• Exact rank-reduction of network models
• The effect of the pandemic on complex socio-economic systems: community detection induced by communicability
• Separating temporal and topological effects in walk-based network centrality
• Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations
• Review of COVID-19 Antibody Therapies
• Communication on structure of biological networks
• A decaying factor accounts for contained activity in neuronal networks with no need of hierarchical or modular organization
• Brain functions emerge as thermal equilibrium states of the connectome
• Hybrid evolving clique-networks and their communicability
• Communicability Angle and the Spatial Efficiency of Networks
• Communicability and Communities in Complex Socio-Economic Networks
• Indirect Influences, Links Ranking, and Deconstruction of Networks
• Communicability in complex brain networks
• Latent geometry emerging from network-driven processes
• Spectral signatures of structural change in financial networks
• Neural networks adapting to datasets: learning network size and topology
• A class of randomized Subset Selection Methods for large complex networks
• Approximating Sparse Matrices and their Functions using Matrix-vector products
• Discussion on "Sparse graphs using exchangeable random measures" by F. Caron and E. B. Fox
• Accounting for the Role of Long Walks on Networks via a New Matrix Function
• Generalized Erdos Numbers for network analysis