On the Stability of Network Indices Defined by Means of Matrix Functions
From MaRDI portal
Publication:4689241
DOI10.1137/17M1133920zbMath1401.65050arXiv1709.05132OpenAlexW2754022655MaRDI QIDQ4689241
Stefano Pozza, Francesco Tudisco
Publication date: 15 October 2018
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.05132
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Matrix exponential and similar functions of matrices (15A16) Numerical computation of matrix exponential and similar matrix functions (65F60)
Related Items
Matrix functions in network analysis, Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds, Low-Rank Updates of Matrix Functions, Inexact Arnoldi residual estimates and decay properties for functions of non-Hermitian matrices, Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions, Nonlocal pagerank, Mittag--Leffler Functions and their Applications in Network Science, Divide-and-Conquer Methods for Functions of Matrices with Banded or Hierarchical Low-Rank Structure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized modularity matrices
- Core-satellite graphs: clustering, assortativity and spectral properties
- Numerical range, GMRES and Faber polynomials.
- Spectral clustering and the high-dimensional stochastic blockmodel
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- Quadrature rule-based bounds for functions of adjacency matrices
- Perron-Frobenius type results on the numerical range
- The numerical range of a nonnegative matrix
- Ranking hubs and authorities using matrix functions
- Decay properties for functions of matrices over \(C^\ast\)-algebras
- Network analysis. Methodological foundations.
- Complex networks: structure and dynamics
- Rational Matrix Functions and Rank-1 Updates
- Matrix Inverse Trigonometric and Inverse Hyperbolic Functions: Theory and Algorithms
- An Algebraic Analysis of the Graph Modularity
- Navigability of interconnected networks under random failures
- The university of Florida sparse matrix collection
- Network Properties Revealed through Matrix Functions
- Emergence of Scaling in Random Networks
- Comparing Top k Lists
- Gauss quadrature for quasi-definite linear functionals
- Collective dynamics of ‘small-world’ networks
- A dynamical systems view of network centrality
- Low-Rank Updates of Matrix Functions
- Block Gauss and Anti-Gauss Quadrature with Application to Networks
- Quasi‐random graphs with given degree sequences
- Functions of Matrices
