REVIEW 2 cited by
Markov loops, complex free field and Eulerian circuits
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
We study the complex free field associated with a symmetric Markov chain. Applications are given to loop ensembles, second Ray Knight theorem and random Eulerian circuits.
Forward citations
Cited by 2 Pith papers
-
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.
-
On discrete loop signatures and Markov loops topology
For Markov loop ensembles on finite graphs, the paper obtains the joint distribution of the second homology of loops, expressed through a limit of determinants via nilpotent holonomy.
Discussion (0). Continue with ORCID to comment.