Hitting time of connectedness in the random hypercube process
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911839225380864 |
|---|---|
| author | Diskin, Sahar Krivelevich, Michael |
| author_facet | Diskin, Sahar Krivelevich, Michael |
| contents | We present a short and self-contained proof of a classical result due to Bollobás (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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_09289 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Hitting time of connectedness in the random hypercube process Diskin, Sahar Krivelevich, Michael Probability Combinatorics We present a short and self-contained proof of a classical result due to Bollobás (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. |
| title | Hitting time of connectedness in the random hypercube process |
| topic | Probability Combinatorics |
| url | https://arxiv.org/abs/2404.09289 |