For any subcritical random connection model with integrable connection function, the cluster size distribution has an exponential tail.
Exponential decay of the volume for Bernoulli percolation: a proof via stochastic comparison
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Let us consider subcritical Bernoulli percolation on a connected, transitive, infinite and locally finite graph. In this paper, we propose a new (and short) proof of the exponential decay property for the volume of clusters. We do not rely on differential inequalities and rather use stochastic comparison techniques, which are inspired by several works including the paper "An approximate zero-one law" written by Russo in the early eighties.
citation-role summary
method 1
citation-polarity summary
fields
math.PR 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Exponential decay for the random connection model using asymptotic transitivity
For any subcritical random connection model with integrable connection function, the cluster size distribution has an exponential tail.