Saved in:
Bibliographic Details
Main Authors: Diskin, Sahar, Easo, Philip, Radhakrishnan, Ritvik Ramanan, Sudakov, Benny, Tassion, Vincent
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!
Table of 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.