Quadrature rule-based bounds for functions of adjacency matrices
DOI10.1016/J.LAA.2010.03.035zbMATH Open1191.65046OpenAlexW1990740326MaRDI QIDQ977482FDOQ977482
Authors: Michele Benzi, Paola Boito 
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
Recommendations
graphssparse matricesnetworksnumerical examplesresolventmatrix exponentialquadrature rulesadjacency matricesLanczos algorithmcommunicabilitydecay boundsestrada indexsubgraph centrality
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximate quadratures (41A55) Matrix exponential and similar functions of matrices (15A16) Miscellaneous inequalities involving matrices (15A45)
Cites Work
- The scaling and squaring method for the matrix exponential revisited
- Functions of Matrices
- Title not available (Why is that?)
- Collective dynamics of `small-world' networks
- Title not available (Why is that?)
- Estimating the Estrada index
- Title not available (Why is that?)
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
- Returnability in complex directed networks (digraphs)
- Communicability graph and community structures in complex networks
- Bounds for the entries of matrix functions with applications to preconditioning
- Title not available (Why is that?)
- Estimates of the trace of the inverse of a symmetric matrix using the modified Chebyshev algorithm
Cited In (43)
- The e-MoM approach for approximating matrix functionals
- More on the Estrada indices of trees
- Predicting Triadic Closure in Networks Using Communicability Distance Functions
- Simplified anti-Gauss quadrature rules with applications in linear algebra
- A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
- Localization in matrix computations: theory and applications
- Matrix functions in network analysis
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature
- Fast estimates for the diagonal of the inverse of large scale matrices appearing in applications
- Updating and downdating techniques for optimizing network communicability
- On the limiting behavior of parameter-dependent network centrality measures
- Gaussianization of the spectra of graphs and networks. Theory and applications
- On the stability of network indices defined by means of matrix functions
- Estimation of the bilinear form \(y^\ast f(A)x\) for Hermitian matrices
- New block quadrature rules for the approximation of matrix functions
- Enhanced matrix function approximation
- Krylov Subspace Restarting for Matrix Laplace Transforms
- Network analysis via partial spectral factorization and Gauss quadrature
- On the decay of the inverse of matrices that are sum of Kronecker products
- Lower and upper bounds on graph communicabilities
- Analysis of directed networks via the matrix exponential
- The structure of matrices in rational Gauss quadrature
- Returnability as a criterion of disequilibrium in atmospheric reactions networks
- Aitken's method for estimating bilinear forms arising in applications
- A literature survey of matrix methods for data science
- Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
- Generalized block anti-Gauss quadrature rules
- Ranking hubs and authorities using matrix functions
- Estimating the trace of matrix functions with application to complex networks
- Low-rank updates of matrix functions
- Sublinear column-wise actions of the matrix exponential on social networks
- An Edge Centrality Measure Based on the Kemeny Constant
- Bounding matrix functionals via partial global block Lanczos decomposition
- A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
- Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
- Community detection based on network communicability
- Computing exponentials of essentially non-negative matrices entrywise to high relative accuracy
- A Monte Carlo method for computing the action of a matrix exponential on a vector
- Decreased coherence and functional connectivity of electroencephalograph in Alzheimer's disease
- The increase in the resolvent energy of a graph due to the addition of a new edge
- Risk-dependent centrality in economic and financial networks
- Estimating the error in matrix function approximations
- The many facets of the Estrada indices of graphs and networks
Uses Software
This page was built for publication: Quadrature rule-based bounds for functions of adjacency matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q977482)
