Related papers: The peeling process on random planar maps coupled …
We consider collections of $N$ chordal random curves obtained from a critical lattice model on a planar graph, in the limit when a fine-mesh graph approximates a simply-connected domain. We define and study candidates for such limits in…
We consider a system of $N$ particles on the real line that evolves through iteration of the following steps: 1) every particle splits into two, 2) each particle jumps according to a prescribed displacement distribution supported on the…
It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…
We prove that the discrete harmonic function corresponding to smooth Dirichlet boundary conditions on orthodiagonal maps, that is, plane graphs having quadrilateral faces with orthogonal diagonals, converges to its continuous counterpart as…
We establish via a probabilistic approach the quenched invariance principle for a class of long range random walks in independent (but not necessarily identically distributed) balanced random environments, with the transition probability…
We study the loop clusters induced by Poissonian ensembles of Markov loops on a finite or countable graph (Markov loops can be viewed as excursions of Markov chains with a random starting point, up to re-rooting). Poissonian ensembles are…
We consider a Branching Random Walk on $\R$ whose step size decreases by a fixed factor, $0<b<1$, with each turn. This process generates a random probability measure on $\R$, that is, the limit of uniform distribution among the $2^n$…
Most approximation algorithms for #P-complete problems (e.g., evaluating the permanent of a matrix or the volume of a polytope) work by reduction to the problem of approximate sampling from a distribution $\pi$ over a large set $\S$. This…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
Chen [Ann. Appl. Probab. {\bf 11} (2001), 1242--1262] derived exact convergence rates in a central limit theorem and a local limit theorem for a supercritical branching Wiener process.We extend Chen's results to a branching random walk…
We consider the open symmetric exclusion (SEP) and inclusion (SIP) processes on a bounded Lipschitz domain $\Omega$, with both fast and slow boundary. For the random walks on $\Omega$ dual to SEP/SIP we establish: a functional-CLT-type…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
We study the asymptotics of the $p$-mapping model of random mappings on $[n]$ as $n$ gets large, under a large class of asymptotic regimes for the underlying distribution $p$. We encode these random mappings in random walks which are shown…
We study the random walk $X$ on the range of a simple random walk on $\mathbb{Z}^d$ in dimensions $d\geq 4$. When $d\geq 5$ we establish quenched and annealed scaling limits for the process $X$, which show that the intersections of the…
This paper is a variation on the uniform spanning tree theme. We use random spanning forests to solve the following problem: for a Markov process on a finite set of size $n$, find a probability law on the subsets of any given size $m \leq…
We prove a {\it{quenched}} large deviation principle (LDP) for a simple random walk on a supercritical percolation cluster (SRWPC) on $\mathbb Z^d$ ($d\geq 2$). The models under interest include classical Bernoulli bond and site percolation…
We investigate the phase diagram of disordered copolymers at the interface between two selective solvents, and in particular its weak-coupling behavior, encoded in the slope $m_c$ of the critical line at the origin. In mathematical terms,…
Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a…
We study limit laws for simple random walks on supercritical long-range percolation clusters on the integer lattice. For the long range percolation model, the probability that two vertices are connected behaves asymptotically as a negative…
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…