The walk distances in graphs
From MaRDI portal
Publication:427888
DOI10.1016/j.dam.2012.02.015zbMath1243.05070arXiv1103.2059MaRDI QIDQ427888
Publication date: 18 June 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.2059
network; resistance distance; graph distances; walk distances; logarithmic forest distances; transitional measure
05C12: Distance in graphs
Related Items
Simple expressions for the long walk distance, Hyperspherical embedding of graphs and networks in communicability spaces, The communicability distance in graphs, Measuring centrality by a generalization of degree, Developments in the theory of randomized shortest paths with a comparison of graph node distances, Sparse randomized shortest paths routing with Tsallis divergence regularization, Randomized shortest paths with net flows and capacity constraints, A bag-of-paths framework for network data analysis, Similarities on graphs: kernels versus proximity measures, A graph interpretation of the least squares ranking method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- The spectral approach to determining the number of walks in a graph
- Centrality measure in graphs
- A matrix-based measure of inter-node walk relatedness in a network
- On certain linear mappings between inner-product and squared-distance matrices
- Distances and volumina for graphs
- Resolvent expansions of matrices and applications
- Random walks on graphs
- The matrix-forest theorem and measuring relations in small social groups
- Parallel concepts in graph theory
- Forest matrices around the Laplacian matrix
- The forest metrics of a graph and their properties
- On proximity measures for graph vertices
- The tau constant and the discrete Laplacian matrix of a metrized graph
- A new status index derived from sociometric analysis
- Network Properties Revealed through Matrix Functions
- Self-Avoiding Paths and the Adjacency Matrix of a Graph
- Limits and the Index of a Square Matrix
- Metric and ultrametric spaces of resistances
- Metric and ultrametric spaces of resistances
- Encyclopedia of Distances
- Geometry of cuts and metrics
- Inequalities and equalities associated with the Campbell-Youla generalized inverse of the indefinite admittance matrix of resistive networks
