Updating and Downdating Techniques for Optimizing Network Communicability

DOI10.1137/140991923zbMath1328.05174arXiv1410.5303OpenAlexW2964046693MaRDI QIDQ3460271

Francesca Arrigo, Michele Benzi

Publication date: 7 January 2016

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.5303

zbMATH Keywords

free energynetwork analysiseigenvector centralityedge centralitysubgraph centralitynatural connectivitytotal communicability

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40) Matrix exponential and similar functions of matrices (15A16) Numerical computation of matrix exponential and similar matrix functions (65F60)

Related Items (12)

Gaussianization of the spectra of graphs and networks. Theory and applications ⋮ Matrix functions in network analysis ⋮ Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds ⋮ Enhancing multiplex global efficiency ⋮ Node and Layer Eigenvector Centralities for Multiplex Networks ⋮ Low-Rank Updates of Matrix Functions ⋮ Exploring the “Middle Earth” of network spectra via a Gaussian matrix function ⋮ Vector estimates for \(f(A)\mathbf b\) via extrapolation ⋮ Accounting for the role of long walks on networks via a new matrix function ⋮ The e-MoM approach for approximating matrix functionals ⋮ Edge importance in a network via line graphs and the matrix exponential ⋮ Edge Modification Criteria for Enhancing the Communicability of Digraphs

Uses Software

• SparseMatrix
• CONTEST
• testmatrix
• mftoolbox
• MMQ Toolbox
• sgcen

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expansion of random graphs: new proofs, new results
• Communicability graph and community structures in complex networks
• Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
• Quadrature rule-based bounds for functions of adjacency matrices
• Bounds for the entries of matrix functions with applications to preconditioning
• Network analysis. Methodological foundations.
• A new status index derived from sociometric analysis
• Network Analysis via Partial Spectral Factorization and Gauss Quadrature
• Robustness of random graphs based on graph spectra
• The university of Florida sparse matrix collection
• Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
• Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
• Emergence of Scaling in Random Networks
• Expander graphs and their applications
• On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
• Collective dynamics of ‘small-world’ networks
• Functions of Matrices
• Networks

This page was built for publication: Updating and Downdating Techniques for Optimizing Network Communicability