Incremental Computation of Pseudo-Inverse of Laplacian

DOI10.1007/978-3-319-12691-3_54zbMath1433.15008arXiv1304.2300OpenAlexW2119658593MaRDI QIDQ2942445

Gyan Ranjan, Daniel L. Boley, Zhi-Li Zhang

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.2300

zbMATH Keywords

combinatorial Laplacian matrixMoore-Penrose pseudo-inversesimple undirected graphdivide-and-conquer based approach

Mathematics Subject Classification ID

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

Related Items (9)

Efficient Point-to-Point Resistance Distance Queries in Large Graphs ⋮ Pseudo-inverses of difference matrices and their application to sparse signal approximation ⋮ Quadratically Regularized Optimal Transport on Graphs ⋮ Geometry of complex networks and topological centrality ⋮ Incremental Computation of Pseudo-Inverse of Laplacian ⋮ A note on Moore–Penrose inverse of Laplacian matrix of graphs ⋮ Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis ⋮ Optimization of Stochastic Lossy Transport Networks and Applications to Power Grids ⋮ Numerically efficient \(H_\infty\) analysis of cooperative multi-agent systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random walks and the effective resistance of networks
• The matrix-forest theorem and measuring relations in small social groups
• The electrical resistance of a graph captures its commute and cover times
• Geometry of complex networks and topological centrality
• Generalized inverses. Theory and applications.
• The matrix of maximum out forests of a digraph and its applications
• On proximity measures for graph vertices
• Commute times for a directed graph using an asymmetric Laplacian
• Incremental Computation of Pseudo-Inverse of Laplacian
• Emergence of Scaling in Random Networks
• Distances in Weighted Trees and Group Inverse of Laplacian Matrices
• Collective dynamics of ‘small-world’ networks
• Generalized Inversion of Modified Matrices

This page was built for publication: Incremental Computation of Pseudo-Inverse of Laplacian