Related papers: Scaling limits for simple random walks on random o…

We study limit laws for simple random walks on supercritical long range percolation clusters on $\Z^d, d \geq 1$. For the long range percolation model, the probability that two vertices $x, y$ are connected behaves asymptotically as…

We study $I(T)$, the number of inversions in a tree $T$ with its vertices labeled uniformly at random, which is a generalization of inversions in permutations. We first show that the cumulants of $I(T)$ have explicit formulas involving the…

Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random P\'{o}lya trees: a uniform random P\'{o}lya tree of size $n$ consists of a conditioned critical…

The continuum random tree is the scaling limit of the uniform spanning tree on the complete graph with $N$ vertices. The Aldous-Broder chain on a graph $G=(V,E)$ is a discrete-time stochastic process with values in the space of rooted trees…

We consider the diffusion scaling limit of the one-dimensional vicious walker model of Fisher and derive a system of nonintersecting Brownian motions. The spatial distribution of $N$ particles is studied and it is described by use of the…

We consider dense graph sequences that converge to a connected graphon and prove that the GHP scaling limit of their uniform spanning trees is Aldous' Brownian CRT. Furthermore, we are able to extract the precise scaling constant from the…

Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…

We consider a weighted random walk on the backbone of an oriented percolation cluster. We determine necessary conditions on the weights for Brownian scaling limits under the annealed and the quenched law. This model is a random walk in…

In this paper we are interested in a random walk in a random environment on a super-critical Galton-Watson tree. We focus on the recurrent cases already studied by Y. Hu and Z. Shi and G. Faraud. We prove that the largest generation…

We consider a null-recurrent randomly biased walk $\mathbb{X}$ on a Galton-Watson tree in the (sub)-diffusive regime and we prove that properly renormalized, the local time in a critical generation converges in law towards some function of…

We consider a discrete-time branching random walk defined on the real line, which is assumed to be supercritical and in the boundary case. It is known that its leftmost position of the $n$-th generation behaves asymptotically like…

Let $M_n$ be a simple triangulation of the sphere $S^2$, drawn uniformly at random from all such triangulations with n vertices. Endow $M_n$ with the uniform probability measure on its vertices. After rescaling graph distance on $V(M_n)$ by…

We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to the local time of a standard Brownian excursion. Furthermore…

We study Markov chains on $\mathbb Z^m$, $m\geq 2$, that behave like a standard symmetric random walk outside of the hyperplane (membrane) $H=\{0\}\times \mathbb Z^{m-1}$. The transition probabilities on the membrane $H$ are periodic and…

We study the scaling limit of essentially simple triangulations on the torus. We consider, for every $n\geq 1$, a uniformly random triangulation $G_n$ over the set of (appropriately rooted) essentially simple triangulations on the torus…

Recently, Hammond and Sheffield introduced a model of correlated random walks that scale to fractional Brownian motions with long-range dependence. In this paper, we consider a natural generalization of this model to dimension $d\geq 2$. We…

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 consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its…

Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…

We prove existence of the scaling limit of the invasion percolation cluster (IPC) on a regular tree. The limit is a random real tree with a single end. The contour and height functions of the limit are described as certain diffusive…