Markovian loop clusters on graphs
From MaRDI portal
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.
In the paper, the loop clusters induced by Markov loop ensembles on graphs are studied. Some general properties of the clusters are stated and some formulae useful to study the semigroup of the coalescent process are established. Properties of the loop clusters induced by a simple random walk killed at a constant rate on different graphs are studied.
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
(19)- Percolation and isoperimetry on roughly transitive graphs
- On discrete loop signatures and Markov loops topology
- Percolation of worms
- Decoupling inequalities and supercritical percolation for the vacant set of random walk loop soup
- On Markovian random networks
- Supercritical loop percolation on \(\mathbb{Z}^d\) for \(d \geq 3\)
- Loop cluster on discrete circles
- Phase transition in loop percolation
- scientific article; zbMATH DE number 5320278 (Why is no real title available?)
- Markovian loop clusters
- Markov loops in discrete spaces
- Equality of critical parameters for percolation of Gaussian free field level sets
- Coexistence, enhancements and short loops in random walk loop soups
- Percolation threshold for metric graph loop soup
- Crossing exponent in the Brownian loop soup
- 1+o(1) asymptotics for loop percolation in five and higher dimensions
- From loop clusters and random interlacements to the free field
- A convergence result on the lengths of Markovian loops
- Markov loops, free field and Eulerian networks
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)
