Related papers: Random walk loop soups and conformal loop ensemble…
The critical two-dimensional Brownian loop-soup is an infinite collection of non-interacting Brownian loops in a planar domain that possesses some combinatorial features related to the notion of indistinguishability of bosons. The properly…
We establish a connection between exclusion statistics with arbitrary integer exclusion parameter $g$ and a class of random walks on planar lattices. This connection maps the generating function for the number of closed walks of given…
We study a particular class of complex-valued random variables and their associated random walks: the complex obtuse random variables. They are the generalization to the complex case of the real-valued obtuse random variables which were…
We propose a novel combinatorial algorithm for efficient generation of Hamiltonian walks and cycles on a cubic lattice, modeling the conformations of lattice toy proteins. Through extensive tests on small lattices (allowing complete…
In this paper, we make a few random explorations that relate directly to the items mentioned in the title. We define transient chains and recurrent chains with "killing", the Green's function, the Laplacian operator, and harmonic functions.…
We give a construction of an infinite stable looptree, which we denote by $\mathcal{L}_{\alpha}^{\infty}$, and prove that it arises both as a local limit of the compact stable looptrees of Curien and Kortchemski (2015), and as a scaling…
Cubical complexes are metric spaces constructed by gluing together unit cubes in an analogous way to the construction of simplicial complexes. We construct Brownian motion on such spaces, define random walks, and prove that the transition…
We obtain the Brownian net of Sun and Swart (2008) as the scaling limit of the paths traced out by a system of continuous (one-dimensional) space and time branching and coalescing random walks. This demonstrates a certain universality of…
It was shown by Le Jan that the occupation field of a Poisson ensemble of Markov loops ("loop soup") of parameter one-half associated to a transient symmetric Markov jump process on a network is half the square of the Gaussian free field on…
In this paper we introduce a new model of random spanning trees that we call choice spanning trees, constructed from so-called choice random walks. These are random walks for which each step is chosen from a subset of random options,…
In this paper, we study the scaling limit of a class of random walks which behave like simple random walks outside of a bounded region around the origin and which are subject to a partial reflection near the origin. If the probability of…
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
Sheffield (2011) introduced an inventory accumulation model which encodes a random planar map decorated by a collection of loops sampled from the critical Fortuin-Kasteleyn (FK) model. He showed that a certain two-dimensional random walk…
Loop-erased random walk, abbreviated LERW, is one of the most well-studied critical lattice models. It is the self-avoiding random walk one gets after erasing the loops from a simple random walk in order or alternatively by considering the…
This paper is concerned with the limit theory of the extreme order statistics derived from random walks. We establish the joint convergence of the order statistics near the minimum of a random walk in terms of the Feller chains. Detailed…
We consider a general random walk loop soup which includes, or is related to, several models of interest, such as the Spin O(N) model, the double dimer model and the Bose gas. The analysis of this model is challenging because of the…
We consider the diffusion scaling limit of the vicious walkers and derive the time-dependent spatial-distribution function of walkers. The dependence on initial configurations of walkers is generally described by using the symmetric…
We study the asymptotic behavior of a nonlattice random walk in a general cone of $R^d$ . Following the approach initiated by D. Denisov and V. Wachtel in [8], we use a strong approximation of random walks by the Brownian motion and prove…
We consider the loop soup at intensity ${1\over 2}$ conditioned on having local time $0$ on a set of vertices with positive occupation field in their vicinities. We give a relation between this loop soup and the usual loop soup conditioned…
Let x and y be chosen uniformly in a graph G. We find the limiting distribution of the length of a loop-erased random walk from x to y on a large class of graphs that include the discrete torus in dimensions 5 and above. Moreover, on this…