A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances

@inproceedings{Yen2008AFO,
title={A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances},
author={Luh Yen and Marco Saerens and Amin Mantrach and Masashi Shimbo},
booktitle={KDD},
year={2008}
}

This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimilarity, depends on a parameter θ and has the interesting property of reducing, on one end, to the standard shortest-path distance when θ is large and, on the other end, to the commute-time (or resistance) distance when θ is small (near zero). Intuitively, it corresponds to the expected cost incurred by a random walker… CONTINUE READING