In the loop soup on the complete graph K_n, the number of clusters of size d converges to a mixed Poisson law with mixing variable exp(-dZ/κ), and clusters larger than n^{1-ε} appear almost surely.
Markov loops topology
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Since the work of Lawler and Werner on "loop soups", these ensembles have also been the object of many investigations. Their properties can be studied in the context of rather general Markov processes, in particular Markov chains on graphs. The purpose of the present work is to explore their topological properties.
fields
math.PR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Loop clusters on complete graphs
In the loop soup on the complete graph K_n, the number of clusters of size d converges to a mixed Poisson law with mixing variable exp(-dZ/κ), and clusters larger than n^{1-ε} appear almost surely.