Updating and downdating techniques for optimizing network communicability
From MaRDI portal
Abstract: The total communicability of a network (or graph) is defined as the sum of the entries in the exponential of the adjacency matrix of the network, possibly normalized by the number of nodes. This quantity offers a good measure of how easily information spreads across the network, and can be useful in the design of networks having certain desirable properties. The total communicability can be computed quickly even for large networks using techniques based on the Lanczos algorithm. In this work we introduce some heuristics that can be used to add, delete, or rewire a limited number of edges in a given sparse network so that the modified network has a large total communicability. To this end, we introduce new edge centrality measures which can be used to guide in the selection of edges to be added or removed. Moreover, we show experimentally that the total communicability provides an effective and easily computable measure of how "well-connected" a sparse network is.
Recommendations
- Communication in complex networks
- Edge modification criteria for enhancing the communicability of digraphs
- Some bounds for total communicability of graphs
- Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
- Network properties revealed through matrix functions
Cites work
- A new status index derived from sociometric analysis
- Bounds for the entries of matrix functions with applications to preconditioning
- Collective dynamics of `small-world' networks
- Communicability graph and community structures in complex networks
- Complex networks. Structure, robustness and function.
- Emergence of Scaling in Random Networks
- Expander graphs and their applications
- Expansion of random graphs: new proofs, new results
- Functions of Matrices
- scientific article; zbMATH DE number 5977361 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
- Matrices, moments and quadrature with applications
- Network analysis via partial spectral factorization and Gauss quadrature
- Network analysis. Methodological foundations.
- Networks. An introduction.
- On the limiting behavior of parameter-dependent network centrality measures
- Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
- Quadrature rule-based bounds for functions of adjacency matrices
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
- Robustness of random graphs based on graph spectra
- The University of Florida sparse matrix collection
Cited in
(23)- A new method optimizing the subgraph centrality of large networks
- Gaussianization of the spectra of graphs and networks. Theory and applications
- Vector estimates for \(f(A)\mathbf b\) via extrapolation
- The e-MoM approach for approximating matrix functionals
- Communication in complex networks
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic
- Edge importance in a network via line graphs and the matrix exponential
- Some bounds for total communicability of graphs
- Edge modification criteria for enhancing the communicability of digraphs
- Communicability angle and the spatial efficiency of networks
- Network properties revealed through matrix functions
- scientific article; zbMATH DE number 1203392 (Why is no real title available?)
- Node and Layer Eigenvector Centralities for Multiplex Networks
- Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
- On the radius of centrality in evolving communication networks
- Accounting for the role of long walks on networks via a new matrix function
- Low-rank updates of matrix functions
- Matrix functions in network analysis
- Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
- Enhancing multiplex global efficiency
- Lower and upper bounds on graph communicabilities
- Updating Katz centrality by counting walks
- Enforcing Katz and PageRank centrality measures in complex networks
This page was built for publication: Updating and downdating techniques for optimizing network communicability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460271)
