Hitting time of connectedness in the random hypercube process
Probability
2024-04-16 v1 Combinatorics
Abstract
We present a short and self-contained proof of a classical result due to Bollob\'as (1990): in the random hypercube process, with high probability the hitting time of connectedness equals the hitting time of having minimum degree at least one.
Cite
@article{arxiv.2404.09289,
title = {Hitting time of connectedness in the random hypercube process},
author = {Sahar Diskin and Michael Krivelevich},
journal= {arXiv preprint arXiv:2404.09289},
year = {2024}
}
Comments
4 pages