In the branching interlacement model, k points are connected almost surely by at most ceil(d(k-1)/4) - (k-2) trajectories, and this bound is tight.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multipoint connectivity in the branching interlacement process
In the branching interlacement model, k points are connected almost surely by at most ceil(d(k-1)/4) - (k-2) trajectories, and this bound is tight.