Loop clusters on complete graphs

2025/04/23 by Yves Le Jan, Jan, Yves Le
Computer Science · #Advanced Algebra and Logic #Data Management and Algorithms #FOS: Mathematics #Probability (math.PR) #Rough Sets and Fuzzy Logic

paper · pdf · doi:10.48550/arxiv.2504.16976

openalex publication_date 2025/04/23 · openalex created_date 2025/10/18 · openalex updated_date 2026/07/28

Abstract

We investigate random partitions of complete graphs defined by Poissonian emsembles of Markov loops

Citations

• A convergence result on the lengths of Markovian loops

Related

• Markovian loop clusters on graphs
• Markovian loop clusters on the complete graph and coagulation equations
• Loop-erased partitioning of a network: monotonicities & analysis of cycle-free graphs
• Markov loops topology
• Cluster explorations of the loop soup on a metric graph related to the Gaussian free field