Type I behavior holds exactly when the graph has the shrink property; otherwise Type F versus Type M is algorithmically decidable via finite enumeration of admissible confined configurations.
Uniqueness and non-uniqueness in percolation theory
1 Pith paper cite this work, alongside 76 external citations. Polarity classification is still indexing.
1
Pith paper citing it
76
external citations · OpenAlex
fields
math.PR 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Zero-temperature stochastic Ising model on one-dimensional quasi-transitive graphs
Type I behavior holds exactly when the graph has the shrink property; otherwise Type F versus Type M is algorithmically decidable via finite enumeration of admissible confined configurations.