Related papers: Distance statistics in quadrangulations with a bou…
We consider maps which are constructed from plane trees by assigning marks to the corners of each vertex and then connecting each pair of consecutive marks on their contour by a single edge. A measure is defined on the set of such maps by…
The potential applications of boundary functionals of random processes, such as the extreme values of these processes, the moment of first reaching a fixed level, the value of the process at the moment of reaching the level, the moment of…
We consider the scaling behavior of the range and $p$-multiple range, that is the number of points visited and the number of points visited exactly $p\geq 1$ times, of simple random walk on ${\mathbb Z}^d$, for dimensions $d\geq 2$, up to…
It is natural to expect that there are only three possible types of scaling limits for the collection of all percolation interfaces in the plane: (1) a trivial one, consisting of no curves at all, (2) a critical one, in which all points of…
We compute the generating function of random planar quadrangulations with three marked vertices at prescribed pairwise distances. In the scaling limit of large quadrangulations, this discrete three-point function converges to a simple…
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…
It was discovered a few years ago that many networks in the real world exhibit self-similarity. A lot of researches on the structures and processes on real and artificial fractal complex networks have been done, drawing an analogy to…
We prove that properly rescaled large planar Eulerian triangulations converge to the Brownian map. This result requires more than a standard application of the methods that have been used to obtain the convergence of other families of…
We study the scaling limits of looptrees associated with Bienaym\'e--Galton--Watson (BGW) trees, that are obtained by replacing every vertex of the tree by a "cycle" whose size is its degree. First, we consider BGW trees whose offspring…
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…
We study the statistics of edges and vertices in the vicinity of a reference vertex (origin) within random planar quadrangulations and Eulerian triangulations. Exact generating functions are obtained for theses graphs with fixed numbers of…
We extend existing connections between random walks, branching processes, and spatial branching processes, and their respective scaling limits, to include processes in dependent random environments. More specifically, we prove new scaling…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
Testing the independence between random vectors is a fundamental problem in statistics. Distance correlation, a recently popular dependence measure, is universally consistent for testing independence against all distributions with finite…
We find explicit formulas for the probabilities of general boundary visit events for planar loop-erased random walks, as well as connectivity events for branches in the uniform spanning tree. We show that both probabilities, when suitably…
In this work we introduce correlated random walks on $\Z$. When picking suitably at random the coefficient of correlation, and taking the average over a large number of walks, we obtain a discrete Gaussian process, whose scaling limit is…
We use Stein's method to obtain a bound on the distance between scaled $p$-dimensional random walks and a $p$-dimensional (correlated) Brownian Motion. We consider dependence schemes including those in which the summands in scaled sums are…
We prove the existence of scaling limits for the projection on the backbone of the random walks on the Incipient Infinite Cluster and the Invasion Percolation Cluster on a regular tree. We treat these projected random walks as randomly…
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…
We numerically investigate the area statistics of the outer boundary of planar random loops, on the square and triangular lattices. Our Monte Carlo simulations suggest that the underlying limit distribution is the Airy distribution, which…