Phase transition in loop percolation

DOI10.1007/S00440-015-0624-XMaRDI QIDQ267029zbMATH OpenOpenAlexFDO

Authors Yinshan Chang, Artem Sapozhnikov

Publication date 7 April 2016

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

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

zbMATH Keywords

phase transitioninteger latticeloop percolation

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: We are interested in the clusters formed by a Poisson ensemble of Markovian loops on infinite graphs. This model was introduced and studied in [LeJ12] and [LL12]. It is a model with long range correlations with two parameters $alpha$ and $kappa$. The non-negative parameter $alpha$ measures the amount of loops, and $kappa$ plays the role of killing on vertices penalizing ($kappa>0$) or favoring ($kappa<0$) appearance of large loops. It was shown in [LL12] that for any fixed $kappa$ and large enough $alpha$, there exists an infinite cluster in the loop percolation on $mathbb{Z}^d$. In the present article, we show a non-trivial phase transition on the integer lattice $mathbb{Z}^d$ ($dgeq3$) for $kappa=0$. More precisely, we show that there is no loop percolation for $kappa=0$ and $alpha$ small enough. Interestingly, we observe a critical like behavior on the whole sub-critical domain of $alpha$, namely, for $kappa=0$ and any sub-critical value of $alpha$, the probability of one-arm event decays at most polynomially. For $dgeq5$, we prove that there exists a non-trivial threshold for the finiteness of the expected cluster size. For $alpha$ below this threshold, we calculate, up to a constant factor, the decay of the probability of one-arm event, two point function, and the tail distribution of the cluster size. These rates are comparable with the ones obtained from a single large loop and only depend on the dimension. For $d=3$ or $4$, we give better lower bounds on the decay of the probability of one-arm event, which show importance of small loops for long connections. In addition, we show that the one-arm exponent in dimension $3$ depends on the intensity $alpha$. [LeJ12] Y. Le Jan, Amas de lacets markoviens, C. R. Math. Acad. Sci. Paris 350 (2012), no.13-14, 643-646. [LL12] Y. Le Jan and S. Lemaire, Markovian loop clusters on graphs, arXiv.org:1211.0300

Recommendations

• Critical parameters for loop and Bernoulli percolation
• scientific article; zbMATH DE number 7678027
• Markovian loop clusters
• Markovian loop clusters on graphs
• From loop clusters and random interlacements to the free field

Cites work

• scientific article; zbMATH DE number 4149302 (Why is no real title available?)
• scientific article; zbMATH DE number 3716498 (Why is no real title available?)
• scientific article; zbMATH DE number 43570 (Why is no real title available?)
• scientific article; zbMATH DE number 3560403 (Why is no real title available?)
• A large-deviation result for the range of random walk and for the Wiener sausage
• An introduction to heavy-tailed and subexponential distributions
• Conformal loop ensembles: the Markovian characterization and the loop-soup construction
• Decoupling inequalities and interlacement percolation on G Z
• Intersections of random walks
• Markov loops and renormalization
• Markovian loop clusters
• Markovian loop clusters on graphs
• On decoupling inequalities and percolation of excursion sets of the Gaussian free field
• On the transience of random interlacements
• Percolation
• Percolation in strongly correlated systems: The massless Gaussian field
• Phase transition and level-set percolation for the Gaussian free field
• Random walk loop soup
• Random walk: A modern introduction
• Soft local times and decoupling of random interlacements
• The Brownian loop soup
• The lace expansion and its application. École d'Été de Probabilités de Saint-Flour XXXIV -- 2004.
• The probability of intersection of independent random walks in four dimensions
• Topics in occupation times and Gaussian free fields
• Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses
• Vacant set of random interlacements and percolation

Cited in

(18)

• Space-time random walk loop measures
• Decoupling inequalities and supercritical percolation for the vacant set of random walk loop soup
• Markovian loop clusters
• Percolation and isoperimetry on roughly transitive graphs
• scientific article; zbMATH DE number 7678027 (Why is no real title available?)
• 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
• Capacity of the range of random walk on \(\mathbb{Z}^{4}\)
• Cylinders' percolation: decoupling and applications
• 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\)
• Conditional decoupling of random interlacements
• Critical parameters for loop and Bernoulli percolation
• Phase transition for level-set percolation of the membrane model in dimensions \(d \geq 5\)
• Chemical distances for percolation of planar Gaussian free fields and critical random walk loop soups

This page was built for publication: Phase transition in loop percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q267029)