Related papers: Scaling limit for line ensembles of random walks w…

We study the line ensembles of non-crossing Brownian bridges above a hard wall, each tilted by the area of the region below it with geometrically growing pre-factors. This model, which mimics the level lines of the $(2+1)$D SOS model above…

This paper analyzes a random walk model for the level lines appearing in the entropic repulsion phenomena of three-dimensional discrete random interfaces above a hard wall; we are particularly motivated by the low-temperature (2+1)D…

We investigate a class of line ensembles whose local structure is described by independent geometric random walk bridges, which have been conditioned to interlace with each other. The latter arise naturally in the context Schur processes,…

We prove tightness and limiting Brownian-Gibbs description for line ensembles of non-colliding Brownian bridges above a hard wall, which are subject to geometrically growing self-potentials of tilted area type. Statistical properties of the…

We define a new ensemble for self-avoiding walks in the upper half-plane, the fixed irredicible bridge ensemble, by considering self-avoiding walks in the upper half-plane up to their $n$-th bridge height, $Y_n$, and scaling the walk by…

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…

This paper concerns a scaling limit of a one-dimensional random walk $S^x_n$ started from $x$ on the integer lattice conditioned to avoid a non-empty finite set $A$, the random walk being assumed to be irreducible and have zero mean.…

In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the…

Under the assumption that sequences of graphs equipped with resistances, associated measures, walks and local times converge in a suitable Gromov-Hausdorff topology, we establish asymptotic bounds on the distribution of the…

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…

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

For the perimeter length and the area of the convex hull of the first $n$ steps of a planar random walk, we study $n \to \infty$ mean and variance asymptotics and establish non-Gaussian distributional limits. Our results apply to random…

We establish the scaling limit of a class of boundary random walks to the full spectrum of Brownian-type processes on the half-line. By solving the associated martingale problem and employing weak convergence techniques, we prove that under…

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…

We consider a 2-dimensional model of random walk in random environment known as line model. The environment is described by two independent families of i.i.d. random variables dictating rates of jumps in vertical, respectively horizontal…

We prove a scaling limit theorem for the simple random walk on critical lattice trees in $\mathbb{Z}^d$, for $d\geq 8$. The scaling limit is the Brownian motion on the Integrated Super-Brownian Excursion (BISE) which is the same one that we…

Consider N Brownian bridges B_i:[-N,N] -> R, B_i(-N) = B_i(N) = 0, 1 <= i <= N, conditioned not to intersect. The edge-scaling limit of this system is obtained by taking a limit as N -> infinity of these curves scaled around (0,2^{1/2} N)…

This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…

We give alternate constructions of (i) the scaling limit of the uniform connected graphs with given fixed surplus, and (ii) the continuum random unicellular map (CRUM) of a given genus that start with a suitably tilted Brownian continuum…

We consider a one-dimensional Brownian motion of fixed duration $T$. Using a path-integral technique, we compute exactly the probability distribution of the difference $\tau=t_{\min}-t_{\max}$ between the time $t_{\min}$ of the global…