Counting minimal cutsets and $p_c<1$
We prove two results concerning percolation on general graphs. • We establish the converse of the classical Peierls argument: if the critical parameter for (uniform) percolation satisfies $p_c<1$ , then the number of minimal cutsets of size n separating a given vertex from infinity is bounded...
Shranjeno v:
| Principais autores: | , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Cambridge University Press
2025-01-01
|
| Serija: | Forum of Mathematics, Pi |
| Teme: | |
| Online dostop: | https://www.cambridge.org/core/product/identifier/S2050508625100115/type/journal_article |
| Oznake: |
Brez oznak, prvi označite!
|