REVIEW 1 cited by
Markov loops topology
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 1 Pith paper
-
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.
Discussion (0). Continue with ORCID to comment.