Communicability graph and community structures in complex networks
From MaRDI portal
Publication:833142
DOI10.1016/J.AMC.2009.04.024zbMATH Open1284.05253arXiv1412.7388OpenAlexW2024529797MaRDI QIDQ833142FDOQ833142
Authors: Ernesto Estrada, Naomichi Hatano 
Publication date: 12 August 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Abstract: We introduce the concept of communicability angle between a pair of nodes in a graph. We provide strong analytical and empirical evidence that the average communicability angle for a given network accounts for its spatial efficiency on the basis of the communications among the nodes in a network. We determine characteristics of the spatial efficiency of more than a hundred real-world complex networks that represent complex systems arising in a diverse set of scenarios. In particular, we find that the communicability angle correlates very well with the experimentally measured value of the relative packing efficiency of proteins that are represented as residue networks. We finally show how we can modulate the spatial efficiency of a network by tuning the weights of the edges of the networks. This allows us to predict effects of external stresses on the spatial efficiency of a network as well as to design strategies to improve important parameters in real-world complex systems.
Full work available at URL: https://arxiv.org/abs/1412.7388
Recommendations
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10)
Cites Work
- Algorithm 457: finding all cliques of an undirected graph
- An Efficient Heuristic Procedure for Partitioning Graphs
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- The maximum clique problem
- Eigenspaces of graphs
- Title not available (Why is that?)
- A survey of kernel and spectral methods for clustering
- Parallel concepts in graph theory
- Data Clustering: Theory, Algorithms, and Applications
- Communities in Networks
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Enumerating all connected maximal common subgraphs in two graphs
Cited In (25)
- Predicting Triadic Closure in Networks Using Communicability Distance Functions
- Localization in matrix computations: theory and applications
- Matrix functions in network analysis
- Updating and downdating techniques for optimizing network communicability
- Modeling systemic risk with Markov switching graphical SUR models
- The information transmission in community networks
- Minimising entropy changes in dynamic network evolution
- Quadrature rule-based bounds for functions of adjacency matrices
- Title not available (Why is that?)
- A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks
- A divide-and-link algorithm for hierarchical clustering in networks
- Edge modification criteria for enhancing the communicability of digraphs
- Redundancy as a graph-based index of frequency specific MEG functional connectivity
- A spectral method to detect community structure based on the communicability modularity
- A UNIFIED COMMUNITY DETECTION ALGORITHM IN LARGE-SCALE COMPLEX NETWORKS
- Communicability angle and the spatial efficiency of networks
- Eigenvector-based centrality measures for temporal networks
- Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
- Gendered networks and communicability in medieval historical narratives
- Estimating the largest elements of a matrix
- Community detection based on network communicability
- Computing exponentials of essentially non-negative matrices entrywise to high relative accuracy
- Dissecting graph measure performance for node clustering in LFR parameter space
- Risk-dependent centrality in economic and financial networks
- Where to cut to delay a pandemic with minimum disruption? Mathematical analysis based on the SIS model
Uses Software
This page was built for publication: Communicability graph and community structures in complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833142)
