The walk distances in graphs

Discrete Applied Mathematics

Volumn 160, Issue 10-11, 2012, Pages 1484-1500

  Chebotarev, Pavel ^a  

^a TRAPEZNIKOV INSTITUTE OF CONTROL SCIENCES   (Russian Federation)

Author keywords

Graph distances; Logarithmic forest distances; Network; Resistance distance; Transitional measure; Walk distances

Indexed keywords

GRAPH DISTANCES; LOGARITHMIC FOREST DISTANCES; RESISTANCE DISTANCE; TRANSITIONAL MEASURE; WALK DISTANCES;

FORESTRY; NETWORKS (CIRCUITS);

LINEAR TRANSFORMATIONS;

ELECTRIC CIRCUITS; FORESTRY; RESISTANCE; STATISTICAL ANALYSIS;

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

References (54)

1. R.B. Bapat Resistance distance in graphs Math. Student 68 1999 87 98
2. R.B. Bapat, and S. Sivasubramanian Identities for minors of the Laplacian, resistance and distance matrices Linear Algebra Appl. 435 2011 1479 1489
3. F. Buckley, and F. Harary Distance in Graphs 1990 Addison-Wesley Redwood City, CA
4. P. Chebotarev A class of graph-geodetic distances generalizing the shortest-path and the resistance distances Discrete Appl. Math. 159 2011 295 302
5. P. Chebotarev The graph bottleneck identity Adv. Appl. Math. 47 2011 403 413
6. P. Chebotarev, and R. Agaev Forest matrices around the Laplacian matrix Linear Algebra Appl. 356 2002 253 274
7. P. Chebotarev, R.B. Bapat, R. Balaji, Simple expressions for the long walk distance, arXiv Peprint math.CO/1112.0088, 2011. http://arxiv.org/abs/1112. 0088.
8. P. Chebotarev, M. Deza, A topological interpretation of the walk distances, arXiv Peprint math.CO/1111.0284 (submitted for publication in Springer collection "Distance Geometry", 2012). http://arxiv.org/abs/ 1111.0284.
9. 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 (Pubitemid 127374609)
10. P.Yu. Chebotarev, and E.V. Shamis On proximity measures for graph vertices Autom. Remote Control 59 1998 1443 1459 (Pubitemid 128382488)
11. P.Yu. Chebotarev, and E.V. Shamis The forest metrics of a graph and their properties Autom. Remote Control 61 2000 1364 1373
12. V.M. Chelnokov, and V.L. Zefirova A matrix-based measure of inter-node walk relatedness in a network Math. Notes 85 2009 109 119
13. Z. Cinkir The tau constant and the discrete Laplacian matrix of a metrized graph European J. Combin. 32 2011 639 655
14. F. Critchley On certain linear mappings between inner-product and squared-distance matrices Linear Algebra Appl. 105 1988 91 107
15. M. Deza, and E. Deza Encyclopedia of Distances 2009 Springer Berlin, Heidelberg
16. M. Deza, and M. Laurent Geometry of Cuts and Metrics 1997 Springer Berlin
17. E. Estrada The Structure of Complex Networks: Theory and Applications 2011 Oxford Univ. Press Oxford
18. E. Estrada, and D.J. Higham Network properties revealed through matrix functions SIAM Rev. 52 2010 696 714
19. F.R. Gantmacher Applications of the Theory of Matrices 1959 Interscience New York
20. F. Gbel, and A.A. Jagers Random walks on graphs Stochastic Process. Appl. 2 1974 311 336
21. V. Gurvich Metric and ultrametric spaces of resistances Discrete Appl. Math. 158 2010 1496 1505
22. A.D. Gvishiani, and V.A. Gurvich Metric and ultrametric spaces of resistances Russian Math. Surveys 42 1987 235 236
23. F. Harary Graph Theory 1969 Addison-Wesley Reading, MA
24. F. Harary, and A.J. Schwenk The spectral approach to determining the number of walks in a graph Pacific J. Math. 80 1979 443 449
25. P.W. Kasteleyn Graph theory and crystal physics F. Harary, Graph Theory and Theoretical Physics 1967 Academic Press London 43 110
26. L. Katz A new status index derived from sociometric analysis Psychometrika 18 1953 39 43
27. D.J. Klein Centrality measure in graphs J. Math. Chem. 47 2010 1209 1223
28. D.J. Klein, J.L. Palacios, M. Randi, and N. Trinajsti Random walks and chemical graph theory J. Chem. Inf. Comput. Sci. 44 2004 1521 1525
29. D.J. Klein, and M. Randi Resistance distance J. Math. Chem. 12 1993 81 95
30. D.J. Klein, and H.-Y. Zhu Distances and volumina for graphs J. Math. Chem. 23 1998 179 195 (Pubitemid 128367558)
31. C.D. Meyer Jr. Limits and the index of a square matrix SIAM J. Appl. Math. 26 1974 469 478
32. Em Proceedings of the Eleventh Midwest Symposium on Circuit Theory 1968 Univ. of Notre Dame Notre Dame, Indiana 184 192
33. M. Nei Genetic distance between populations Am. Nat. 106 949 1972 283 292
34. J. Ponstein Self-avoiding paths and the adjacency matrix of a graph SIAM J. Appl. Math. 14 1966 600 609
35. C.R. Rao, and S.K. Mitra Generalized Inverse of Matrices and its Applications 1971 Wiley New York
36. U.G. Rothblum Computation of the eigenprojection of a nonnegative matrix at its spectral radius R.J.-B. Wets, Stochastic Systems: Modeling, Identification and Optimization, II Mathematical Programming Study vol. 6 1976 North-Holland Amsterdam 188 201
37. U.G. Rothblum Resolvent expansions of matrices and applications Linear Algebra Appl. 38 1981 33 49
38. S. Seshu, and M.B. Reed Linear Graphs and Electrical Networks 1961 Addison-Wesley Reading, MA
39. G.E. Sharpe, Solution of the (m + 1) -terminal resistive network problem by means of metric geometry, in: Proceedings of the First Asilomar Conference on Circuits and Systems, Pacific Grove, CA, November 1967, pp. 319-328.
40. G.E. Sharpe Theorem on resistive networks Electron. Lett. 3 1967 444 445
41. G.E. Sharpe Violation of the 2-triple property by resistive networks Electron. Lett. 3 1967 543 544
42. G.E. Sharpe, and B. Spain On the solution of networks by means of the equicofactor matrix IRE Trans. Circuit Theory 7 1960 230 239
43. G.E. Sharpe, and G.P.H. Styan A note on the general network inverse IEEE Trans. Circuit Theory 12 1965 632 633
44. G.E. Sharpe, and G.P.H. Styan Circuit duality and the general network inverse IEEE Trans. Circuit Theory 12 1965 22 27
45. G.E. Sharpe, and G.P.H. Styan A note on equicofactor matrices Proc. IEEE 55 1967 1226 1227
46. G.P.H. Styan, and G.E. Subak-Sharpe Inequalities and equalities associated with the Campbell-Youla generalized inverse of the indefinite admittance matrix of resistive networks Linear Algebra Appl. 250 1997 349 370
47. G.E. Subak-Sharpe, On the structural constraints of electrical networks, in: Proceedings of 1989 IEEE International Conference on Circuits and Systems, Nanjing, China, July 6-8, 1989, pp. 369-374.
48. G.E. Subak-Sharpe, On the characterization of positive resistance networks by means of distance geometry, in: Proceedings of the 1990 IEEE International Symposium on Circuits and Systems, vol. 3, 1990, pp. 1764-1768.
49. M. Tang, Graph metrics and dimension reduction, Ph.D. Thesis, School of Informatics and Computing, Indiana University, Bloomington, IN, 2010.
50. M. Taylor Graph-theoretic approaches to the theory of social choice Public Choice 4 1968 35 47
51. G.L. Thompson Lectures on Game Theory, Markov Chains and Related Topics, Sandia Corporation Monograph SCR-11, Albuquerque, New Mexico 1958
52. U. von Luxburg, A. Radl, and M. Hein Getting lost in space: large sample analysis of the resistance distance NIPS 2010, Twenty-Fourth Annual Conference on Neural Information Processing Systems 2011 Curran Red Hook, New York 2622 2630
53. 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 International Conference on Knowledge Discovery and Data Mining, 2008, pp. 785-793.
54. D. Youla, Some new formulas in the theory of n-terminal networks, Rome Air Development Center Report, Colgate Univ., Hamilton, New York, 1959, 20 pp (unpublished).