Approximations of the generalized inverse of the graph Laplacian matrix
From MaRDI portal
Publication:4905097
Recommendations
- Performance and stability of direct methods for computing generalized inverses of the graph Laplacian
- Generalized inverses in graph theory
- Generalized inverse of the Laplacian matrix and some applications
- A generalized inverse for graphs with absorption
- Incremental computation of pseudo-inverse of Laplacian
Cited in
(14)- Performance and stability of direct methods for computing generalized inverses of the graph Laplacian
- Generalized Block Tuned Preconditioners for SPD Eigensolvers
- Computing the smallest eigenpairs of the graph Laplacian
- A variant of the current flow betweenness centrality and its application in urban networks
- A fast hierarchically preconditioned eigensolver based on multiresolution matrix decomposition
- The Group Inverse of the Laplacian Matrix of a Graph
- Incremental computation of pseudo-inverse of Laplacian
- Gene set priorization guided by regulatory networks with p-values through kernel mixed model
- A generalized inverse for graphs with absorption
- Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems
- Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems.
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
- Graphs with absorption: numerical methods for the absorption inverse and the computation of centrality measures
- Estimating current-flow closeness centrality with a multigrid Laplacian solver
This page was built for publication: Approximations of the generalized inverse of the graph Laplacian matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4905097)
