Metraipolis › archive › dc_a3608bd658d1

On efficient graph covers and steered random walks — arXiv:2607.25016

Source
arXiv (en)
Original
https://arxiv.org/abs/2607.25016
License (as archived)
CC0-1.0
Archived
2026-10-19T04:47:28.441Z
SHA-256 of the archived text
d9449090b022a731c18ff418296e2f5d093cdd9d1acdac2f894d22c230568f8d
Stable URL of this page
https://metraipolis.com/documento/dc_a3608bd658d1

How to cite

On efficient graph covers and steered random walks — arXiv:2607.25016 — arXiv (en), https://arxiv.org/abs/2607.25016 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a3608bd658d1 (Metraipolis archive dc_a3608bd658d1, sha256 d9449090b022a731c18ff418296e2f5d093cdd9d1acdac2f894d22c230568f8d)
BibTeX
@misc{dca3608bd658d1,
  title = {On efficient graph covers and steered random walks — arXiv:2607.25016},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2607.25016},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a3608bd658d1; sha256 d9449090b022a731c18ff418296e2f5d093cdd9d1acdac2f894d22c230568f8d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2607.25016. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove that the vertices of any $n$-vertex graph can be partitioned into pieces of radius $r = O(\log n)$ such that the sum of the sizes of their closed neighborhoods is at most $4n$. This answers a recent question of Bukh and Dubroff and directly yields an improvement to their upper bound on the optimal cover time of the $\epsilon$-steered random walk. We also demonstrate that our bound on $r$ is best possible up to a constant factor for graphs with strong vertex expansion.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-14 in math.PR).
Categorie arXiv: Combinatorics (math.CO) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2607.25016 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T04:27:45.061Z dalla pagina https://arxiv.org/catchup/math.PR/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).