The cover time of a biased random walk on a random cubic graph
classification
🧮 math.CO
cs.DS
keywords
randomapproxcovercubicwalkasymptoticallybiasedcontext
read the original abstract
We study a random walk that prefers tou se unvisited edges in the context of random cubic graphs. We establish asymptotically correct estimates for the vertex and edge cover times, these being $\approx n\log n$ and $\approx \frac32n\log n$ respectively.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.