2000 character limit reached
Loop percolation on discrete half-plane
Published 5 Aug 2014 in math.PR | (1408.1045v3)
Abstract: We consider the random walk loop soup on the discrete half-plane and study the percolation problem, i.e. the existence of an infinite cluster of loops. We show that the critical value of the intensity is equal to 1/2. The absence of percolation at intensity 1/2 was shown in a previous work. We also show that in the supercritical regime, one can keep only the loops up to some large enough upper bound on the diameter and still have percolation.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.