A class of graph-geodetic distances generalizing the shortest-path and the resistance distances

Discrete Applied Mathematics

Volumn 159, Issue 5, 2011, Pages 295-302

  Chebotarev, Pavel ^a  

^a TRAPEZNIKOV INSTITUTE OF CONTROL SCIENCES   (Russian Federation)

Author keywords

Forest distance; Graph bottleneck identity; Matrix forest theorem; Regularized Laplacian kernel; Resistance distance; Shortest path distance; Spanning rooted forest; Transitional measure

Indexed keywords

FOREST DISTANCE; GRAPH BOTTLENECK IDENTITY; LAPLACIANS; MATRIX; RESISTANCE DISTANCE; SHORTEST PATH; SPANNING ROOTED FOREST; TRANSITIONAL MEASURE;

GEODESY; LAPLACE TRANSFORMS;

GRAPH THEORY;

EID: 78751646102     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2010.11.017     Document Type: Article

References (26)

1. F. Buckley, and F. Harary Distance in Graphs 1990 Addison-Wesley Redwood City, CA
2. A.K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari The electrical resistance of a graph captures its commute and cover times Proc. 21st Annual ACM Symp. on Theory of Computing 1989 ACM Press Seattle 574 586
3. P. Chebotarev, The graph bottleneck identity, Adv. Appl. Math. URL: http://dx.doi.org/10.1016/j.aam.2010.11.001 (in press).
4. P. Chebotarev Spanning forests and the golden ratio Discrete Appl. Math. 156 2008 813 821
5. P. Chebotarev, and R. Agaev Forest matrices around the Laplacian matrix Linear Algebr Appl. 356 2002 253 274
6. P. Chebotarev, and E. Shamis The forest metrics for graph vertices Electron. Notes Discrete Math. 11 2002 98 107
7. P.Yu. Chebotarev, and E.V. Shamis The matrix-forest theorem and measuring relations in small social groups Autom. Remote Control 58 1997 1505 1514
8. P.Yu. Chebotarev, E. Shamis, On the proximity measure for graph vertices provided by the inverse Laplacian characteristic matrix, in: Abstracts of the Conference "Linear Algebra and its Applications", 1012 July, 1995, University of Manchester, Manchester, UK, 1995, pp. 67. URL: http://www.ma.man.ac.uk/~higham/laa95/abstracts.ps.
9. P.Yu. Chebotarev, and E.V. Shamis On proximity measures for graph vertices Autom. Remote Control 59 1998 1443 1459
10. H. Chen, and F. Zhang Resistance distance and the normalized Laplacian spectrum Discrete Appl. Math. 155 2007 654 661
11. F. Chung, W. Zhao, PageRank and random walks on graphs, in: Proceedings of "Fete of Combinatorics and Computer Science" Conference in honor of Laci Lovsz, Keszthely, Hungary, August 1115, 2008 (in press).
12. M.M. Deza, and E. Deza Encyclopedia of Distances 2009 Springer Berlin, Heidelberg
13. M.M. Deza, and M. Laurent Geometry of Cuts and Metrics 1997 Springer Berlin
14. F. Gbel, and A.A. Jagers Random walks on graphs Stochastic Process. Appl. 2 1974 311 336
15. R.L. Graham, A.J. Hoffman, and H. Hosoya On the distance matrix of a directed graph J. Graph Theory 1 1977 85 88
16. V. Gurvich Metric and ultrametric spaces of resistances Discrete Appl. Math. 158 2010 1496 1505
17. A.D. Gvishiani, and V.A. Gurvich Metric and ultrametric spaces of resistances Russian Math. Surveys 42 1987 235 236
18. D.J. Klein, and M. Randi Resistance distance J. Math. Chem. 12 1993 81 95
19. D.J. Klein, and H.Y. Zhu Distances and volumina for graphs J. Math. Chem. 23 1998 179 195
20. A. Mantrach, L. Yen, J. Callut, K. Franoisse, M. Shimbo, and M. Saerens The Sum-over-paths covariance kernel: a novel covariance measure between nodes of a directed graph IEEE Trans. Pattern Anal. Mach. Intell. 32 2010 1112 1126
21. C.St.J.A. Nash-Williams Random walk and electric currents in networks Math. Proc. Cambridge Philos. Soc. 55 1959 181 194
22. S. Seshu, and M.B. Reed Linear Graphs and Electrical Networks 1961 Addison-Wesley Reading, MA
23. L.W. Shapiro An electrical lemma Math. Mag. 60 1987 36 38
24. M. Shimbo, T. Ito, D. Mochihashi, and Yu. Matsumoto On the properties of von Neumann kernels for link analysis Mach. Learn. 75 2009 37 67
25. A.J. Smola, R.I. Kondor, Kernels and regularization of graphs, in: Proc. 16th Annual Conf. on Learning Theory, 2003, pp. 144158.
26. L. Yen, M. Saerens, A. Mantrach, M. Shimbo, A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances, in: 14th ACM SIGKDD Intern. Conf. on Knowledge Discovery and Data Mining, 2008, pp. 785793.