A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
From MaRDI portal
Publication:628311
DOI10.1016/j.dam.2010.11.017zbMath1209.05068arXiv0810.2717MaRDI QIDQ628311
Publication date: 10 March 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0810.2717
resistance distance; shortest path distance; transitional measure; forest distance; graph bottleneck identity; matrix forest theorem; regularized Laplacian kernel; spanning rooted forest
Related Items
Simple expressions for the long walk distance, Hyperspherical embedding of graphs and networks in communicability spaces, The communicability distance in graphs, The walk distances in graphs, An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification, The graph bottleneck identity, The Smith normal form of product distance matrices, A recursion formula for resistance distances and its applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The graph bottleneck identity
- Resistance distance and the normalized Laplacian spectrum
- Distances and volumina for graphs
- Random walks on graphs
- The matrix-forest theorem and measuring relations in small social groups
- Forest matrices around the Laplacian matrix
- On proximity measures for graph vertices
- On the properties of von Neumann kernels for link analysis
- Spanning forests and the golden ratio
- An Electrical Lemma
- On the distance matrix of a directed graph
- Learning Theory and Kernel Machines
- Metric and ultrametric spaces of resistances
- Metric and ultrametric spaces of resistances
- Encyclopedia of Distances
- Geometry of cuts and metrics
