New ancestry-chain conditioning technique proves indistinguishability for wired uniform spanning forests and unifies several coalescing models as CMT on unimodular random graphs.
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
-
Indistinguishability in One-or-Two-Ended Forests on Unimodular Random Graphs
New ancestry-chain conditioning technique proves indistinguishability for wired uniform spanning forests and unifies several coalescing models as CMT on unimodular random graphs.