2000 character limit reached
The cover time of a biased random walk on a random cubic graph
Published 2 Jan 2018 in math.CO and cs.DS | (1801.00760v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
