Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
From MaRDI portal
Publication:6094748
DOI10.1137/23m1556708zbMath1521.05192arXiv2303.01339MaRDI QIDQ6094748
Publication date: 14 September 2023
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.01339
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Communication theory (94A05) Matrix exponential and similar functions of matrices (15A16) Numerical computation of matrix exponential and similar matrix functions (65F60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Centrality measures for node-weighted networks via line graphs and the matrix exponential
- Communicability graph and community structures in complex networks
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- Convergence of a subgradient method for computing the bound norm of matrices
- On the computation of incomplete gamma functions in the complex domain
- The power method for l\(^p\) norms
- Ranking hubs and authorities using matrix functions
- Non-Toeplitz decay bounds for inverses of Hermitian positive definite tridiagonal matrices
- Functions of rational Krylov space matrices and their decay properties
- Communication in complex networks
- Refined decay bounds on the entries of spectral projectors associated with sparse Hermitian matrices
- Decay bounds for Bernstein functions of Hermitian matrices with applications to the fractional graph Laplacian
- Decay properties for functions of matrices over \(C^\ast\)-algebras
- Complex networks: structure and dynamics
- Analysis of directed networks via the matrix exponential
- A new status index derived from sociometric analysis
- Edge Modification Criteria for Enhancing the Communicability of Digraphs
- Estimating the Largest Elements of a Matrix
- Decay Bounds for Functions of Hermitian Matrices with Banded or Kronecker Structure
- Navigability of interconnected networks under random failures
- Localization in Matrix Computations: Theory and Applications
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- Network Properties Revealed through Matrix Functions
- A Krylov Subspace Method for the Approximation of Bivariate Matrix Functions
- Updating and Downdating Techniques for Optimizing Network Communicability
- Decay Rates for Inverses of Band Matrices
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Networks
- Bounds for the decay of the entries in inverses and Cauchy–Stieltjes functions of certain sparse, normal matrices
- On the Stability of Network Indices Defined by Means of Matrix Functions
- Low-Rank Updates of Matrix Functions II: Rational Krylov Methods
- Mittag--Leffler Functions and their Applications in Network Science
- Computing low‐rank approximations of the Fréchet derivative of a matrix function using Krylov subspace methods
- On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
- A Block Krylov Method to Compute the Action of the Fréchet Derivative of a Matrix Function on a Vector with Applications to Condition Number Estimation
- Low-Rank Updates of Matrix Functions
- Functions of Matrices
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
