Communicability graph and community structures in complex networks
From MaRDI portal
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.
Recommendations
Cites work
- A survey of kernel and spectral methods for clustering
- Algorithm 457: finding all cliques of an undirected graph
- An Efficient Heuristic Procedure for Partitioning Graphs
- Communities in Networks
- Community structure in social and biological networks
- Data Clustering: Theory, Algorithms, and Applications
- Eigenspaces of graphs
- Enumerating all connected maximal common subgraphs in two graphs
- scientific article; zbMATH DE number 1384868 (Why is no real title available?)
- Parallel concepts in graph theory
- The maximum clique problem
- The Structure and Function of Complex Networks
- The worst-case time complexity for generating all maximal cliques and computational experiments
Cited in
(25)- The information transmission in community networks
- Modeling systemic risk with Markov switching graphical SUR models
- A divide-and-link algorithm for hierarchical clustering in networks
- Redundancy as a graph-based index of frequency specific MEG functional connectivity
- Dissecting graph measure performance for node clustering in LFR parameter space
- A spectral method to detect community structure based on the communicability modularity
- Edge modification criteria for enhancing the communicability of digraphs
- Community detection based on network communicability
- Estimating the largest elements of a matrix
- Communicability angle and the spatial efficiency of networks
- Computing exponentials of essentially non-negative matrices entrywise to high relative accuracy
- Predicting triadic closure in networks using communicability distance functions
- Localization in matrix computations: theory and applications
- Risk-dependent centrality in economic and financial networks
- Updating and downdating techniques for optimizing network communicability
- Where to cut to delay a pandemic with minimum disruption? Mathematical analysis based on the SIS model
- Minimising entropy changes in dynamic network evolution
- scientific article; zbMATH DE number 7310081 (Why is no real title available?)
- Eigenvector-based centrality measures for temporal networks
- Matrix functions in network analysis
- Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
- A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks
- A UNIFIED COMMUNITY DETECTION ALGORITHM IN LARGE-SCALE COMPLEX NETWORKS
- Gendered networks and communicability in medieval historical narratives
- Quadrature rule-based bounds for functions of adjacency matrices
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)
