Quadrature rule-based bounds for functions of adjacency matrices
From MaRDI portal
(Redirected from Publication:977482)
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 554737 (Why is no real title available?)
- scientific article; zbMATH DE number 1083101 (Why is no real title available?)
- scientific article; zbMATH DE number 194668 (Why is no real title available?)
- Bounds for the entries of matrix functions with applications to preconditioning
- Collective dynamics of `small-world' networks
- Communicability graph and community structures in complex networks
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- Estimates of the trace of the inverse of a symmetric matrix using the modified Chebyshev algorithm
- Estimating the Estrada index
- Functions of Matrices
- Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
- Returnability in complex directed networks (digraphs)
- The scaling and squaring method for the matrix exponential revisited
Cited in
(43)- The e-MoM approach for approximating matrix functionals
- Simplified anti-Gauss quadrature rules with applications in linear algebra
- More on the Estrada indices of trees
- 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
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature
- Matrix functions in network analysis
- Fast estimates for the diagonal of the inverse of large scale matrices appearing in applications
- Updating and downdating techniques for optimizing network communicability
- Gaussianization of the spectra of graphs and networks. Theory and applications
- On the limiting behavior of parameter-dependent network centrality measures
- Estimation of the bilinear form y^ f(A)x for Hermitian matrices
- New block quadrature rules for the approximation of matrix functions
- On the stability of network indices defined by means of matrix functions
- Enhanced matrix function approximation
- Network analysis via partial spectral factorization and Gauss quadrature
- Krylov Subspace Restarting for Matrix Laplace Transforms
- On the decay of the inverse of matrices that are sum of Kronecker products
- Analysis of directed networks via the matrix exponential
- Lower and upper bounds on graph communicabilities
- Returnability as a criterion of disequilibrium in atmospheric reactions networks
- The structure of matrices in rational Gauss quadrature
- Aitken's method for estimating bilinear forms arising in applications
- Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
- A literature survey of matrix methods for data science
- 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
- Community detection based on network communicability
- Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
- Computing exponentials of essentially non-negative matrices entrywise to high relative accuracy
- Predicting triadic closure in networks using communicability distance functions
- A Monte Carlo method for computing the action of a matrix exponential on a vector
- The increase in the resolvent energy of a graph due to the addition of a new edge
- Decreased coherence and functional connectivity of electroencephalograph in Alzheimer's disease
- 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
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)
