eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2018-06-18
16:1
16:12
10.4230/LIPIcs.AofA.2018.16
article
The Cover Time of a Biased Random Walk on a Random Cubic Graph
Cooper, Colin
1
Frieze, Alan
2
Johansson, Tony
3
Department of Informatics, King’s College, University of London, London WC2R 2LS, UK
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA 15213, USA
Department of Mathematics, Uppsala University, 751 05 Uppsala, Sweden
We study a random walk that prefers to use unvisited edges in the context of random cubic graphs, i.e., graphs chosen uniformly at random from the set of 3-regular graphs. We establish asymptotically correct estimates for the vertex and edge cover times, these being n log n and 3/2 n log n respectively.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol110-aofa2018/LIPIcs.AofA.2018.16/LIPIcs.AofA.2018.16.pdf
Random walk
random regular graph
cover time