Abstract: We study the loop clusters induced by Poissonian ensembles of Markov loops on a finite or countable graph (Markov loops can be viewed as excursions of Markov chains with a random starting point, up to re-rooting). Poissonian ensembles are seen as a Poisson point process of loops indexed by 'time'. The evolution in time of the loop clusters defines a coalescent process on the vertices of the graph. After a description of some general properties of the coalescent process, we address several aspects of the loop clusters defined by a simple random walk killed at a constant rate on three different graphs: the integer number line , the integer lattice with and the complete graph. These examples show the relations between Poissonian ensembles of Markov loops and other models: renewal process, percolation and random graphs.
Recommendations
- Markovian loop clusters
- On Clusters in Markov Chains
- Random cluster model on regular graphs
- scientific article; zbMATH DE number 6450685
- Markov properties of cluster processes
- Cluster expansion for locally interacting Markov chains
- The distribution of clusters in random graphs
- Clustering in block Markov chains
- scientific article; zbMATH DE number 3907513
Cites work
- Conformal loop ensembles: the Markovian characterization and the loop-soup construction
- Markov paths, loops and fields. École d'Été de Probabilités de Saint-Flour XXXVIII -- 2008
- Markovian loop clusters
- Random walk loop soup
- Random walk: A modern introduction
- SLEs as boundaries of clusters of Brownian loops
Cited in
(17)- Markov loops, free field and Eulerian networks
- On Markovian random networks
- On discrete loop signatures and Markov loops topology
- Equality of critical parameters for percolation of Gaussian free field level sets
- Coexistence, enhancements and short loops in random walk loop soups
- Markovian loop clusters
- Loop cluster on discrete circles
- Markov loops in discrete spaces
- A convergence result on the lengths of Markovian loops
- Supercritical loop percolation on \(\mathbb{Z}^d\) for \(d \geq 3\)
- Percolation threshold for metric graph loop soup
- Percolation and isoperimetry on roughly transitive graphs
- scientific article; zbMATH DE number 5320278 (Why is no real title available?)
- From loop clusters and random interlacements to the free field
- Phase transition in loop percolation
- Decoupling inequalities and supercritical percolation for the vacant set of random walk loop soup
- Percolation of worms
This page was built for publication: Markovian loop clusters on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405405)
