# Item

ITEM ACTIONSEXPORT

Released

Conference Paper

#### Getting lost in space: Large sample analysis of the resistance distance

##### MPS-Authors

##### Locator

There are no locators available

##### Fulltext (public)

There are no public fulltexts available

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

von Luxburg, U., Radl, A., & Hein, M. (2011). Getting lost in space: Large sample
analysis of the resistance distance. In J. Lafferty (*24th
Annual Conference on Neural Information Processing Systems (NIPS 2010)* (pp. 2622-2630). Red Hook, NY: Curran.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-4CD3-D

##### Abstract

The commute distance between two vertices in a graph is the expected time it takes a random walk to travel from the first to the second vertex and back. We study the
behavior of the commute distance as the size of the underlying graph increases. We prove that the commute distance converges to an expression that does not take
into account the structure of the graph at all and that is completely meaningless as a distance function on the graph. Consequently, the use of the raw commute distance for machine learning purposes is strongly discouraged for large graphs and in high dimensions. As an alternative we introduce the amplified commute distance that corrects for the undesired large sample effects.