SearcharxivSearch

arXiv · 1410.6132

Simple CLE in Doubly Connected Domains

Abstract

We study Conformal Loop Ensemble (CLE$_{\kappa}$) in doubly connected domains: annuli, the punctured disc, and the punctured plane. We restrict attention to CLE$_{\kappa}$ for which the loops are simple, i.e. $\kappa\in (8/3,4]$. In the paper "Conformal Loop Ensemble" by Sheffield and Werner, simple CLE in the unit disc is introduced and constructed as the collection of outer boundaries of outermost clusters of the Brownian loop soup. For simple CLE in the unit disc, any fixed interior point is almost surely surrounded by some loop of CLE. The gasket of the collection of loops in CLE, i.e. the set of points that are not surrounded by any loop, almost surely has Lebesgue measure zero. In the current paper, simple CLE in an annulus is constructed similarly: it is the collection of outer boundaries of outermost clusters of the Brownian loop soup conditioned on the event that there is no cluster disconnecting the two components of the boundary of the annulus. Simple CLE in the punctured disc can be viewed as simple CLE in the unit disc conditioned on the event that the origin is in the gasket. Simple CLE in the punctured plane can be viewed as simple CLE in the whole plane conditioned on the event that both the origin and infinity are in the gasket. We construct and study these three kinds of CLEs, along with the corresponding exploration processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Scott Sheffield, Samuel S. Watson, Hao Wu. 2014-10-22. Simple CLE in Doubly Connected Domains. https://arxiv.org/abs/1410.6132

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR