The electrical resistance of a graph captures its commute and cover times
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Note: Resistance distance and the normalized Laplacian spectrum
Discrete Applied Mathematics
Spanning forests and the golden ratio
Discrete Applied Mathematics
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
On the properties of von Neumann kernels for link analysis
Machine Learning
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph
IEEE Transactions on Pattern Analysis and Machine Intelligence
Geometry of Cuts and Metrics
Metric and ultrametric spaces of resistances
Discrete Applied Mathematics
Discrete Applied Mathematics
Interpolating between random walks and shortest paths: a path functional approach
SocInfo'12 Proceedings of the 4th international conference on Social Informatics
A recursion formula for resistance distances and its applications
Discrete Applied Mathematics
| Hi-index | 0.04 |
A new class of distances for graph vertices is proposed. This class contains parametric families of distances which reduce to the shortest-path, weighted shortest-path, and the resistance distances at the limiting values of the family parameters. The main property of the class is that all distances it comprises are graph-geodetic: d(i,j)+d(j,k)=d(i,k) if and only if every path from i to k passes through j. The construction of the class is based on the matrix forest theorem and the transition inequality.