Approximations of the generalized inverse of the graph Laplacian matrix

DOI10.1080/15427951.2012.715115zbMATH Open1258.05068OpenAlexW2035456338MaRDI QIDQ4905097FDOQ4905097

Authors: Enrico Bozzo, Massimo Franceschet 

Publication date: 15 February 2013

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.im/1354809993

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

zbMATH Keywords

matrix inversion problem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Theory of matrix inversion and generalized inverses (15A09)

Cited In (10)

• 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
• The Group Inverse of the Laplacian Matrix of a Graph
• 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
• Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
• Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems.
• A Fast Hierarchically Preconditioned Eigensolver Based on Multiresolution Matrix Decomposition

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)