Markovian loop clusters on graphs

zbMATH Open1311.60015arXiv1211.0300MaRDI QIDQ405405FDOQ405405

Authors: Yves Le Jan, Sophie Lemaire 

Publication date: 5 September 2014

Published in: Illinois Journal of Mathematics (Search for Journal in Brave)

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 $mathbbZ$, the integer lattice $mathbb{Z}^d$ with $dgeq2$ and the complete graph. These examples show the relations between Poissonian ensembles of Markov loops and other models: renewal process, percolation and random graphs.

Full work available at URL: https://arxiv.org/abs/1211.0300

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

zbMATH Keywords

graphclusterloopMarkovian loopPoissonian ensembles

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Connectivity (05C40)

Cites Work

• Conformal loop ensembles: the Markovian characterization and the loop-soup construction
• Random walk: A modern introduction
• Markov paths, loops and fields. École d'Été de Probabilités de Saint-Flour XXXVIII -- 2008
• Random walk loop soup
• Markovian loop clusters
• SLEs as boundaries of clusters of Brownian loops

Cited In (16)

• Phase transition in loop percolation
• Decoupling inequalities and supercritical percolation for the vacant set of random walk loop soup
• Markovian loop clusters
• Percolation and isoperimetry on roughly transitive graphs
• Coexistence, enhancements and short loops in random walk loop soups
• Percolation threshold for metric graph loop soup
• Equality of critical parameters for percolation of Gaussian free field level sets
• Markov loops in discrete spaces
• Title not available (Why is that?)
• On Markovian random networks
• A convergence result on the lengths of Markovian loops
• From loop clusters and random interlacements to the free field
• Markov loops, free field and Eulerian networks
• Percolation of worms
• Supercritical loop percolation on \(\mathbb{Z}^d\) for \(d \geq 3\)
• Loop cluster on discrete circles

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)