Metraipolis › archive › dc_e549f4ebafe7

Counting Minimal Vertex Cutsets and a Gap at 1 for Site Percolation on Vertex-Transitive Graphs — arXiv:2610.08261

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.08261
License (as archived)
CC0-1.0
Archived
2026-10-07T11:51:05.733Z
SHA-256 of the archived text
3419efb3aeae098df885c7e6ffed42f76095885ebe367a42203e5e76a82387f8
Stable URL of this page
https://metraipolis.com/documento/dc_e549f4ebafe7

How to cite

Counting Minimal Vertex Cutsets and a Gap at 1 for Site Percolation on Vertex-Transitive Graphs — arXiv:2610.08261 — arXiv (en), https://arxiv.org/abs/2610.08261 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e549f4ebafe7 (Metraipolis archive dc_e549f4ebafe7, sha256 3419efb3aeae098df885c7e6ffed42f76095885ebe367a42203e5e76a82387f8)
BibTeX
@misc{dce549f4ebafe7,
  title = {Counting Minimal Vertex Cutsets and a Gap at 1 for Site Percolation on Vertex-Transitive Graphs — arXiv:2610.08261},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.08261},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e549f4ebafe7; sha256 3419efb3aeae098df885c7e6ffed42f76095885ebe367a42203e5e76a82387f8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08261. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We consider site percolation on general graphs and give a sufficient condition on the escape probability of a certain random walk with degree-dependent conductances, such that the number of minimal vertex cutsets of size $n$ separating a given vertex from infinity is bounded above exponentially in $n$. This result extends an analogous theorem of Easo, Severo and Tassion under slightly stronger assumptions. Moreover, we give an alternative sufficient condition in terms of the isoperimetric dimension or, more specifically, an isoperimetric-type inequality. Furthermore, our theorem is sufficient to extend the results of Panagiotis and Severo, and show that there exists a universal positive constant $\varepsilon_1$ such that site percolation on every infinite, connected, locally finite, vertex-transitive graph satisfies $p_c = 1$ or $p_c \leq 1-\varepsilon_1$.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2610.08261 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:21:39.640Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).