2000 character limit reached
Hitting time of connectedness in the random hypercube process
Published 14 Apr 2024 in math.PR and math.CO | (2404.09289v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.