On fast computation of directed graph Laplacian pseudo-inverse

DOI10.1016/j.laa.2020.10.018OpenAlexW3093047463MaRDI QIDQ2029845

Daniel L. Boley

Publication date: 4 June 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

iterative methodspseudo-inversedirected graphsgraph Laplacian

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical analysis or methods applied to Markov chains (65C40) Iterative numerical methods for linear systems (65F10)

Related Items (1)

Geometric and spectral analysis on weighted digraphs

Cites Work

• Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices
• Markov fundamental tensor and its applications to network analysis
• Laplacians and the Cheeger inequality for directed graphs
• Commute times for a directed graph using an asymmetric Laplacian
• On the group-inverse of a linear transformation
• Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
• Random Walks on Digraphs, the Generalized Digraph Laplacian and the Degree of Asymmetry
• Statistical mechanics of complex networks
• Geometric aspects of the theory of Krylov subspace methods
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
• Markov Chains
• On the convergence behavior of the restarted GMRES algorithm for solving nonsymmetric linear systems
• Generalized Inversion of Modified Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On fast computation of directed graph Laplacian pseudo-inverse