Hitting time of connectedness in the random hypercube process
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.