Getting lost in space: Large sample analysis of the commute distance

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Von Luxburg, Ulrike ^a   Radl, Agnes ^a   Hein, Matthias ^b  

^a MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

DISTANCE FUNCTIONS; EXPECTED TIME; HIGHER DIMENSIONS; LARGE GRAPHS; LARGE SAMPLE ANALYSIS; MACHINE-LEARNING; RANDOM WALK; UNDERLYING GRAPHS;

LEARNING SYSTEMS;

EID: 85162047451     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. R. Aleliunas, R. Karp, R. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In FOCS, 1979.
2. C. Avin and G. Ercal. On the cover time and mixing time of random geometric graphs. Theor. Comput. Sci, 380(1-2):2-22, 2007.
3. B. Bollobás. Modern Graph Theory. Springer, 1998.
4. M. Brand. A random walks perspective on maximizing satisfaction and profit. In SDM, 2005.
5. N. Cesa-Bianchi, C. Gentile, and F. Vitale. Fast and optimal prediction on a labeled tree. In COLT, 2009.
6. A. Chandra, P. Raghavan, W. Ruzzo, R. Smolensky, and P. Tiwari. The electrical resistance of a graph captures its commute and cover times. In STOC, 1989.
7. C. Cooper and A. Frieze. The cover time of random geometric graphs. In SODA, 2009.
8. P. G. Doyle and J. L. Snell. Random walks and electric networks. Mathematical Association of America, Washington, DC, 1984.
9. F. Fouss, A. Pirotte, J.-M. Renders, and M. Saerens. A novel way of computing dissimilarities between nodes of a graph, with application to collaborative filtering and subspace projection of the graph nodes. Technical Report IAG WP 06/08, Université catholique de Louvain, 2006.
10. S. Guattery. Graph embeddings, symmetric real matrices, and generalized inverses. Technical report, Institute for Computer Applications in Science and Engineering, NASA Research Center, 1998.
11. J. Ham, D. D. Lee, S. Mika, and B. Schölkopf. A kernel view of the dimensionality reduction of manifolds. In ICML, 2004.
12. M. Herbster and M. Pontil. Prediction on a graph with a perceptron. In NIPS, 2006.
13. D. Klein and M. Randic. Resistance distance. Journal of Mathematical Chemistry, 12:81-95, 1993.
14. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM, 2003.
15. R. Lyons and Y. Peres. Probability on trees and networks. Book in preparation, available online on the webpage of Yuval Peres, 2010.
16. B. Nadler, N. Srebro, and X. Zhou. Statistical analysis of semi-supervised learning: The limit of infinite unlabelled data. In NIPS, 2009.
17. M. Penrose. A strong law for the longest edge of the minimal spanning tree. Ann. of Prob., 27(1): 246-260, 1999.
18. H. Qiu and E. R. Hancock. Image segmentation using commute times. In BMVC, 2005.
19. H. Qiu and E. R. Hancock. Graph embedding using commute time. S+SSPR 2006, pages 441-449, 2006.
20. M. Saerens, F. Fouss, L. Yen, and P. Dupont. The principal components analysis of a graph, and its relationships to spectral clustering. In ECML, 2004.
21. P. Sarkar and A. Moore. A tractable approach to finding closest truncated-commute-time neighbors in large graphs. In UAI, 2007.
22. P. Sarkar, A. Moore, and A. Prakash. Fast incremental proximity search in large graphs. In ICML, 2008.
23. D. Spielman and N. Srivastava. Graph sparsification by effective resistances. In STOC, 2008.
24. U. von Luxburg, A. Radl, and M. Hein. Hitting times, commute distances and the spectral gap in large random geometric graphs. Preprint available at Arxiv, March 2010.
25. D. M. Wittmann, D. Schmidl, F. Blöchl, and F. J. Theis. Reconstruction of graphs based on random walks. Theoretical Computer Science, 2009.
26. W. Xiao and I. Gutman. Resistance distance and Laplacian spectrum. Theoretical Chemistry Accounts, 110:284-298, 2003.
27. L. Yen, D. Vanvyve, F.Wouters, F. Fouss, M. Verleysen, and M. Saerens. Clustering using a random walk based distance measure. In ESANN, 2005.
28. L. Yen, F. Fouss, C. Decaestecker, P. Francq, and M. Saerens. Graph nodes clustering based on the commute-time kernel. Advances in Knowledge Discovery and Data Mining, pages 1037-1045, 2009.
29. D. Zhou and B. Schölkopf. Learning from Labeled and Unlabeled Data Using Random Walks. In DAGM, 2004.