🔮
🔮
The Ethereal
The covertime of a biased random walk on $G_{n,p}$
August 16, 2017 · The Ethereal · 🏛 Workshop on Analytic Algorithmics and Combinatorics
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Colin Cooper, Alan Frieze, Samantha Petti
arXiv ID
1708.04908
Category
math.CO: Combinatorics
Cross-listed
cs.DS,
math.PR
Citations
2
Venue
Workshop on Analytic Algorithmics and Combinatorics
Last Checked
3 months ago
Abstract
We analyze the covertime of a biased random walk on the random graph $G_{n,p}$. The walk is biased towards visiting vertices of low degree and this makes the covertime less than in the unbiased case
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Combinatorics
🔮
🔮
The Ethereal
On cap sets and the group-theoretic approach to matrix multiplication
🔮
🔮
The Ethereal
Generalized Twisted Gabidulin Codes
🔮
🔮
The Ethereal
Tables of subspace codes
🔮
🔮
The Ethereal
Classification of weighted networks through mesoscale homological features
🔮
🔮
The Ethereal