Simple expressions for the long walk distance
From MaRDI portal
Publication:389550
DOI10.1016/j.laa.2012.07.033zbMath1282.05038arXiv1112.0088OpenAlexW2012946051MaRDI QIDQ389550
Ravindra B. Bapat, Ramamurthy Balaji, Pavel Yu. Chebotarev
Publication date: 21 January 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.0088
resistance distanceg-inversegraph distancesgraph-geodetic distancelong walk distancepara-Laplacian matrixsingular M-matrixwalk distances
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The walk distances in graphs
- Identities for minors of the Laplacian, resistance and distance matrices
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- The graph bottleneck identity
- A new status index derived from sociometric analysis
- Limits and the Index of a Square Matrix
- Inequalities and equalities associated with the Campbell-Youla generalized inverse of the indefinite admittance matrix of resistive networks
This page was built for publication: Simple expressions for the long walk distance