Comparison of Mean Hitting Times for a Degree-Biased Random Walk

Abstract : Consider the random walk on graphs such that, at each step, the next visited vertex is a neighbor of the current vertex, chosen with probability proportional to the inverse of the square root of its degree. On one hand, for every graph with n vertices, the maximal mean hitting time for this degree-biased random walk is asymptotically dominated by n 2. On the other hand, the maximal mean hitting time for the simple random walk is asymptotically dominated by n 3. Yet, in this article, we exhibit for each positive integer n: • A graph of size n with maximal mean hitting time strictly smaller for the simple random walk than for the degree-biased one. • A graph of size n with mean hitting time of a so called root vertex strictly smaller for the simple random walk than for the degree-biased one.
Document type :
Journal articles
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01759847
Contributor : Pascal Lafourcade <>
Submitted on : Thursday, April 5, 2018 - 5:37:51 PM
Last modification on : Friday, March 15, 2019 - 1:14:49 AM

File

deg_biased.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Antoine Gerbaud, Karine Altisen, Stéphane Devismes, Pascal Lafourcade. Comparison of Mean Hitting Times for a Degree-Biased Random Walk. Discrete Applied Mathematics, Elsevier, 2014, 170, pp.104 - 109. ⟨10.1016/j.dam.2014.01.021⟩. ⟨hal-01759847⟩

Share

Metrics

Record views

135

Files downloads

88