Random Walks with the Minimum Degree Local Rule Have O(N2) Cover Time

DOI10.1137/1.9781611974782.120zbMath1410.05183arXiv1604.08326OpenAlexW2343988980MaRDI QIDQ4575866

Roee David

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.08326

Mathematics Subject Classification ID

Random walks on graphs (05C81)

Related Items (2)

Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time ⋮ The cover time of deterministic random walks for general transition probabilities

This page was built for publication: Random Walks with the Minimum Degree Local Rule Have O(N²) Cover Time