A generalized inverse for graphs with absorption
From MaRDI portal
Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Theory of matrix inversion and generalized inverses (15A09) Signed and weighted graphs (05C22) Random walks on graphs (05C81) General biology and biomathematics (92B05)
Abstract: We consider weighted, directed graphs with a notion of absorption on the vertices, related to absorbing random walks on graphs. We define a generalized inverse of the graph Laplacian, called the absorption inverse, that reflects both the graph structure as well as the absorption rates on the vertices. Properties of this generalized inverse are presented, including a matrix forest theorem relating this generalized inverse to spanning forests of a related graph, as well as relationships between the absorption inverse and the fundamental matrix of the absorbing random walk. Applications of the absorption inverse for describing the structure of graphs with absorption are presented, including a directed distance metric, spectral partitioning algorithm, and centrality measure.
Recommendations
- Generalized inverses in graph theory
- Inverse Problems and Zero Forcing for Graphs
- On an extremal inverse problem in graph theory
- On some graphs which possess inverses
- Inverse problems of graph theory: generalized quadrangles
- On graphs with signed inverses
- A note on inverses of labeled graphs
- Approximations of the generalized inverse of the graph Laplacian matrix
- Graphs with absorption: numerical methods for the absorption inverse and the computation of centrality measures
- Inverse problems in graph theory: nets
Cites work
- scientific article; zbMATH DE number 3145626 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 1786116 (Why is no real title available?)
- scientific article; zbMATH DE number 2230269 (Why is no real title available?)
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- A Note on Finite Homogeneous Continuous-Time Markov Chains
- A Survey of Eigenvector Methods for Web Information Retrieval
- Communities in Networks
- Commute times for a directed graph using an asymmetric Laplacian
- Directed metrics and directed graph partitioning problems
- Disease invasion on community networks with environmental pathogen movement
- Distances in Weighted Trees and Group Inverse of Laplacian Matrices
- Forest matrices around the Laplacian matrix
- Generalized Inverses in Discrete Time Markov Decision Processes
- Generalized inverses. Theory and applications.
- Introduction to stochastic processes with R
- Laplacians and the Cheeger inequality for directed graphs
- Matrix Analysis
- Networks. An introduction.
- On Matrices of Index Zero or One
- On tight spans for directed distances
- Proximity in group inverses of M-matrices and inverses of diagonally dominant M-matrices
- Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph
- The Laurent expansion for a nearly singular matrix
- The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
- The fundamental matrix of singularly perturbed Markov chains
- \texttt{PageRank} and random walks on graphs
Cited in
(14)- Performance and stability of direct methods for computing generalized inverses of the graph Laplacian
- Analysis of Relaxation Time in Random Walk with Jumps
- Moore-Penrose inverse of the incidence matrix of a distance regular graph
- Minimal ∞-norm of generalized inverses of the incidence matrix of a tree
- Inverse Problems and Zero Forcing for Graphs
- The Moore-Penrose inverse of the incidence matrix of complete multipartite and bi-block graphs
- Classical and Quantum Random-Walk Centrality Measures in Multilayer Networks
- Generalized inverses in graph theory
- Adapting infomap to absorbing random walks using absorption-scaled graphs
- Approximations of the generalized inverse of the graph Laplacian matrix
- Graphs with absorption: numerical methods for the absorption inverse and the computation of centrality measures
- Dissecting graph measure performance for node clustering in LFR parameter space
- Relating Eulerian and Lagrangian spatial models for vector-host disease dynamics through a fundamental matrix
- Similarities on graphs: kernels versus proximity measures
This page was built for publication: A generalized inverse for graphs with absorption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675661)
