Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.03257 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908863318458368 |
|---|---|
| author | Diskin, Sahar Easo, Philip Radhakrishnan, Ritvik Ramanan Sudakov, Benny Tassion, Vincent |
| author_facet | Diskin, Sahar Easo, Philip Radhakrishnan, Ritvik Ramanan Sudakov, Benny Tassion, Vincent |
| contents | We prove that for supercritical percolation on every infinite transitive graph, the probability that the origin belongs to a finite cluster of size at least $n$ decays exponentially in $Φ(n)$, where $Φ$ is the isoperimetric function of the graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_03257 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Supercritical sharpness of percolation Diskin, Sahar Easo, Philip Radhakrishnan, Ritvik Ramanan Sudakov, Benny Tassion, Vincent Probability We prove that for supercritical percolation on every infinite transitive graph, the probability that the origin belongs to a finite cluster of size at least $n$ decays exponentially in $Φ(n)$, where $Φ$ is the isoperimetric function of the graph. |
| title | Supercritical sharpness of percolation |
| topic | Probability |
| url | https://arxiv.org/abs/2603.03257 |