Developments in the theory of randomized shortest paths with a comparison of graph node distances

Physica A: Statistical Mechanics and its Applications

Volumn 393, Issue , 2014, Pages 600-616

  Kivimäki, Ilkka ^a   Shimbo, Masashi ^b   Saerens, Marco ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Clustering; Commute time and resistance distance; Free energy; Graph node distances; Randomized shortest paths; Shortest path distance

Indexed keywords

COMPUTATION THEORY; FREE ENERGY; GRAPH ALGORITHMS; GRAPH STRUCTURES; STATISTICAL PHYSICS;

CLUSTERING; DISTANCE MEASURE; GENERALIZED DISTANCES; GLOBAL STRUCTURE; GRAPH NODE DISTANCES; NODE CLUSTERING; RESISTANCE DISTANCE; SHORTEST PATH;

GRAPH THEORY;

EID: 84886595579     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2013.09.016     Document Type: Article

References (52)

1. S. Wasserman, and K. Faust Social Network Analysis: Methods and Applications 1994 Cambridge University Press
2. M. Thelwall Link Analysis: An Information Science Approach 2004 Elsevier
3. F. Chung, and L. Lu Complex Graphs and Networks 2006 American Mathematical Society
4. D. Liben-Nowell, and J. Kleinberg The link-prediction problem for social networks Journal of the American Society for Information Science and Technology 58 7 2007 1019 1031
5. E.D. Kolaczyk Statistical Analysis of Network Data 2009 Springer
6. T.G. Lewis Network Science: Theory and Applications 2009 Wiley
7. M.E. Newman Networks: An Introduction 2010 Oxford University Press
8. L. Lü, and T. Zhou Link prediction in complex networks: a survey Physica A. Statistical Mechanics and its Applications 390 6 2011 1150 1170
9. E. Estrada The Structure of Complex Networks: Theory and Applications 2012 Oxford University Press
10. F. Gobel, and A.A. Jagers Random walks on graphs Stochastic Processes and their Applications 2 1974 311 336
11. D.J. Klein, and M. Randic Resistance distance Journal of Mathematical Chemistry 12 1 1993 81 95
12. P.G. Doyle, and J.L. Snell Random Walks and Electric Networks 1984 The Mathematical Association of America
13. A.K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, P. Tiwari, The electrical resistance of a graph captures its commute and cover times, in: Annual ACM Symposium on Theory of Computing, 1989, pp. 574-586.
14. L. Yen, A. Mantrach, M. Shimbo, M. Saerens, A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances, in: Proceedings of the 14th SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2008, 2008, pp. 785-793.
15. M. Saerens, Y. Achbany, F. Fouss, and L. Yen Randomized shortest-path problems: two related models Neural Computation 21 8 2009 2363 2404
16. K. Françoisse, I. Kivimäki, A. Mantrach, F. Rossi, M. Saerens, A bag-of-paths framework for network data analysis. ArXiv Preprint arXiv:1302.6766.
17. P. Chebotarev A class of graph-geodetic distances generalizing the shortest-path and the resistance distances Discrete Applied Mathematics 159 5 2011 295 302
18. J.B. Tenenbaum, V.d. Silva, and J.C. Langford A global geometric framework for nonlinear dimensionality reduction Science 290 5500 2000 2319 2323
19. H.M. Taylor, and S. Karlin An Introduction to Stochastic Modeling third ed. 1998 Academic Press
20. M. Brand, A random walks perspective on maximizing satisfaction and profit, in: Proceedings of the 2005 SIAM International Conference on Data Mining.
21. A. Radl, U. von Luxburg, M. Hein, The resistance distance is meaningless for large random geometric graphs, in: Proc. Workshop on Analyzing Networks and Learning with Graphs, 2009.
22. U. von Luxburg, A. Radl, M. Hein, Getting lost in space: large sample analysis of the commute distance, in: Proceedings of the 23th Neural Information Processing Systems conference, NIPS 2010, 2010, pp. 2622-2630.
23. T. Akamatsu Cyclic flows, Markov process and stochastic traffic assignment Transportation Research Part B 30 5 1996 369 386
24. S. Garcia-Diez, E. Vandenbussche, M. Saerens, A continuous-state version of discrete randomized shortest-paths, with application to path planning, in: 2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC, 2011, pp. 6570-6577.
25. C. Elkan Using the triangle inequality to accelerate k-means T. Fawcett, N. Mishra, Machine Learning, Proceedings of the Twentieth International Conference ICML 2003 2003 AAAI Press Washington, DC, USA 147 153
26. L. Peliti Statistical Mechanics in a Nutshell, in a Nutshell 2011 Princeton University Press
27. F. Fouss, K. Françoisse, L. Yen, A. Pirotte, and M. Saerens An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification Neural Networks 31 2012 53 72
28. F. Bavaud, and G. Guex Interpolating between random walks and shortest paths: a path functional approach K. Aberer, SocInfo 2012 Lecture Notes in Computer Science vol. 7710 2012 Springer 68 81
29. J.-C. Delvenne, and A.-S. Libert Centrality measures and thermodynamic formalism for complex networks Physical Review E 83 2011 046117
30. L. Page, S. Brin, R. Motwani, and T. Winograd The pagerank citation ranking: Bringing order to the web, Technical Report 1999-0120, Computer Science Department 1999 Stanford University
31. D. Klein, and H.-Y. Zhu Distances and volumina for graphs Journal of Mathematical Chemistry 23 1 1998 179 195
32. P. Chebotarev, and E. Shamis The matrix-forest theorem and measuring relations in small social groups Automation and Remote Control 58 9 1997 1505 1514
33. P. Chebotarev, and E. Shamis The forest metrics for graph vertices Electronic Notes in Discrete Mathematics 11 2002 98 107
34. P. Chebotarev The walk distances in graphs Discrete Applied Mathematics 160 10-11 2012 1484 1500
35. M. Alamgir, U. von Luxburg, Phase transition in the familiy of p-resistances, in: Neural Information Processing Systems, NIPS, 2011.
36. I. Borg, and P. Groenen Modern Multidimensional Scaling: Theory and Applications 1997 Springer
37. M. Herbster, A triangle inequality for p-resistance, in: NIPS Workshop 2010: Networks Across Disciplines: Theory and Applications, 2010.
38. Y. Li, Z.-L. Zhang, and D. Boley The routing continuum from shortest-path to all-path: a unifying theory Proceedings of the 2011 31st International Conference on Distributed Computing Systems ICDCS'11 2011 IEEE Computer Society Washington, DC, USA 847 856
39. E. Estrada The communicability distance in graphs Linear Algebra and its Applications 436 11 2012 4317 4328
40. E. Estrada Complex networks in the euclidean space of communicability distances Physical Review E 85 6 2012 066122
41. F. Bavaud Euclidean distances, soft and spectral clustering on weighted graphs Machine Learning and Knowledge Discovery in Databases 2010 Springer 103 118
42. A. Lancichinetti, and S. Fortunato Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities Physical Review E 80 2009 016118
43. L. Yen, F. Fouss, C. Decaestecker, P. Francq, and M. Saerens Graph nodes clustering with the sigmoid commute-time kernel: a comparative study Data and Knowledge Engineering 68 3 2009 338 361
44. J. Shawe-Taylor, and N. Cristianini Kernel Methods for Pattern Analysis 2004 Cambridge University Press
45. I.J. Schoenberg Metric spaces and positive definite functions Transactions of the American Mathematical Society 44 3 1938 522 536
46. J.C. Gower, and P. Legendre Metric and euclidean properties of dissimilarity coefficients Journal of Classification 3 1 1986 5 48
47. M. Saerens, F. Fouss, L. Yen, and P. Dupont The principal components analysis of a graph, and its relationships to spectral clustering Proceedings of the 15th European Conference on Machine Learning ECML 2004 Lecture Notes in Artificial Intelligence vol. 3201 2004 Springer-Verlag Berlin 371 383
48. A. Strehl, J. Ghosh, and C. Cardie Cluster ensembles - a knowledge reuse framework for combining multiple partitions Journal of Machine Learning Research 3 2002 583 617
49. X. Zhu, and A. Goldberg Introduction to Semi-Supervised Learning Synthesis Lectures on Artificial Intelligence and Machine Learning Series 2009 Morgan & Claypool
50. S.A. Macskassy, and F. Provost Classification in networked data: a toolkit and a univariate case study Journal of Machine Learning Research 8 2007 935 983
51. D.G. Saari Explaining all three-alternative voting outcomes Journal of Economic Theory 87 2 1999 313 355
52. F. Fouss, A. Pirotte, J.-M. Renders, and M. Saerens Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation The IEEE Transactions on Knowledge and Data Engineering 19 3 2007 355 369