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.
Inverting Ray-Knight identity
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We provide a short proof of the Ray-Knight second generalized Theorem, using a martingale which can be seen (on the positive quadrant) as the Radon-Nikodym derivative of the reversed vertex-reinforced jump process measure with respect to the Markov jump process with the same conductances. Next we show that a variant of this process provides an inversion of that Ray-Knight identity. We give a similar result for the Ray-Knight first generalized Theorem.
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.