Comparison of mean hitting times for a degree-biased random walk

DOI10.1016/J.DAM.2014.01.021MaRDI QIDQ2449093zbMATH OpenOpenAlexFDO

Authors Antoine Gerbaud, Karine Altisen, Stéphane Devismes, Pascal Lafourcade

Publication date 6 May 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2014.01.021

zbMATH Keywords

biased random walksMarkov chainsrandom walks on graphs

Mathematics Subject Classification ID

Random walks on graphs (05C81) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• Slowdown for the geodesic-biased random walk
• The cover time of a biased random walk on \(G_{n,p}\)
• The hitting and cover times of random walks on finite graphs using local degree information
• Hitting times for random walks on vertex-transitive graphs
• Maximum hitting time for random walks on graphs

Cites work

• scientific article; zbMATH DE number 3493681 (Why is no real title available?)
• scientific article; zbMATH DE number 3514781 (Why is no real title available?)
• Stochastic inequalities on partially ordered spaces
• The hitting and cover times of random walks on finite graphs using local degree information

Cited in

(5)

• Hubs-biased resistance distances on graphs and networks
• Slowdown for the geodesic-biased random walk
• `Hubs-repelling' Laplacian and related diffusion on graphs/networks
• Hubs-attracting Laplacian and related synchronization on networks
• Dynamics on accelerated growth tree networks: random walks and consensus problem

This page was built for publication: Comparison of mean hitting times for a degree-biased random walk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449093)