Quadrature rule-based bounds for functions of adjacency matrices

DOI10.1016/j.laa.2010.03.035zbMath1191.65046OpenAlexW1990740326MaRDI QIDQ977482

Publication date: 22 June 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.03.035

zbMATH Keywords

resolvent numerical examples networks sparse matrices graphs Lanczos algorithm quadrature rules matrix exponential adjacency matrices communicability decay bounds estrada index subgraph centrality

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Miscellaneous inequalities involving matrices (15A45) Approximate quadratures (41A55) Matrix exponential and similar functions of matrices (15A16)

Related Items

Aitken's method for estimating bilinear forms arising in applications ⋮ Estimation of the bilinear form \(y^\ast f(A)x\) for Hermitian matrices ⋮ New block quadrature rules for the approximation of matrix functions ⋮ The many facets of the Estrada indices of graphs and networks ⋮ Updating and Downdating Techniques for Optimizing Network Communicability ⋮ Generalized averaged Gauss quadrature rules for the approximation of matrix functionals ⋮ The structure of matrices in rational Gauss quadrature ⋮ A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching ⋮ Predicting Triadic Closure in Networks Using Communicability Distance Functions ⋮ More on the Estrada indices of trees ⋮ Decreased coherence and functional connectivity of electroencephalograph in Alzheimer's disease ⋮ Matrix functions in network analysis ⋮ A literature survey of matrix methods for data science ⋮ Estimating the trace of matrix functions with application to complex networks ⋮ The increase in the resolvent energy of a graph due to the addition of a new edge ⋮ Fast estimates for the diagonal of the inverse of large scale matrices appearing in applications ⋮ Analysis of directed networks via the matrix exponential ⋮ Ranking hubs and authorities using matrix functions ⋮ An Edge Centrality Measure Based on the Kemeny Constant ⋮ Krylov Subspace Restarting for Matrix Laplace Transforms ⋮ Localization in Matrix Computations: Theory and Applications ⋮ Low-Rank Updates of Matrix Functions ⋮ Returnability as a criterion of disequilibrium in atmospheric reactions networks ⋮ On the decay of the inverse of matrices that are sum of Kronecker products ⋮ Risk-Dependent Centrality in Economic and Financial Networks ⋮ Estimating the error in matrix function approximations ⋮ Exploring the “Middle Earth” of network spectra via a Gaussian matrix function ⋮ Enhanced matrix function approximation ⋮ The e-MoM approach for approximating matrix functionals ⋮ Simplified anti-Gauss quadrature rules with applications in linear algebra ⋮ Analysis of directed networks via partial singular value decomposition and Gauss quadrature ⋮ On the Stability of Network Indices Defined by Means of Matrix Functions ⋮ A Monte Carlo method for computing the action of a matrix exponential on a vector ⋮ Community detection based on network communicability ⋮ Sublinear Column-wise Actions of the Matrix Exponential on Social Networks ⋮ Computing exponentials of essentially non-negative matrices entrywise to high relative accuracy ⋮ Generalized block anti-Gauss quadrature rules ⋮ On the Limiting Behavior of Parameter-Dependent Network Centrality Measures ⋮ Bounding matrix functionals via partial global block Lanczos decomposition

Uses Software

Cites Work