SearcharxivSearch

arXiv · 1610.09343

Conditioning a Brownian loop-soup cluster on a portion of its boundary

Abstract

We show that if one conditions a cluster in a Brownian loop-soup $L$ (of any intensity) in a two-dimensional domain by a portion $l$ of its outer boundary, then in the remaining domain, the union of all the loops of $L$ that touch $l$ satisfies the conformal restriction property while the other loops in $L$ form an independent loop-soup. This result holds when one discovers $l$ in a natural Markovian way, such as in the exploration procedures that have been defined in order to actually construct the Conformal Loop Ensembles as outer boundaries of loop-soup clusters. This result implies among other things that a phase transition occurs at c = 14/15 for the connectedness of the loops that touch $l$. Our results can be viewed as an extension of some of the results in our earlier paper in the following two directions: There, a loop-soup cluster was conditioned on its entire outer boundary while we discover here only part of this boundary. And, while it was explained there that the strong decomposition using a Poisson point process of excursions that we derived there should be specific to the case of the critical loop-soup, we show here that in the subcritical cases, a weaker property involving the conformal restriction property nevertheless holds.

Explore related subjects

Keep this discovery

BibTeXRIS

Wei Qian. 2016-10-28. Conditioning a Brownian loop-soup cluster on a portion of its boundary. https://arxiv.org/abs/1610.09343

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