Abstract
As an image of the many-to-one map of loop-erasing operation L of random walks, a self-avoiding walk (SAW) is obtained. The loop-erased random walk (LERW) model is the statistical ensemble of SAWs such that the weight of each SAW ζ is given by the total weight of all random walks π that are inverse images of ζ, {π:L(π)=ζ}. We regard the Brownian paths as the continuum limits of random walks and consider the statistical ensemble of loop-erased Brownian paths (LEBPs) as the continuum limits of the LERW model. Following the theory of Fomin on nonintersecting LERWs, we introduce a nonintersecting system of N-tuples of LEBPs in a domain D in the complex plane, where the total weight of nonintersecting LEBPs is given by Fomin's determinant of an N×N matrix whose entries are boundary Poisson kernels in D. We set a sequence of chambers in a planar domain and observe the first passage points at which N Brownian paths (γ_{1},…,γ_{N}) first enter each chamber, under the condition that the loop-erased parts [L(γ(1)),…,L(γ(N))] make a system of nonintersecting LEBPs in the domain in the sense of Fomin. We prove that the correlation functions of first passage points of the Brownian paths of the present system are generally given by determinants specified by a continuous function called the correlation kernel. The correlation kernel is of Eynard-Mehta type, which has appeared in two-matrix models and time-dependent matrix models studied in random matrix theory. Conformal covariance of correlation functions is demonstrated.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.