Related papers: Scaling limits of loop-erased random walks and uni…
The Doob transform technique enables the study of a killed random walk (KRW) via a random walk (RW) with transition probabilities tilted by a discrete massive harmonic function. The main contribution of this paper is to transfer this…
In this paper we consider heavy tailed Markov renewal processes and we prove that, suitably renormalised, they converge in law towards the $\ga$-stable regenerative set. We then apply these results to the strip wetting model which is a…
We consider super-diffusive L\'evy walks in $d \geqslant 2$ dimensions when the duration of a single step, i.e., a ballistic motion performed by a walker, is governed by a power-law tailed distribution of infinite variance and finite mean.…
A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…
We give an explicit construction of the scaling limit of the minimum spanning tree of the complete graph. The limit object is described using a recursive construction involving the convex minorants of a Brownian motion with parabolic drift…
We study a variant of the down-up and up-down walks over an $n$-partite simplicial complex, which we call expanderized higher order random walks -- where the sequence of updated coordinates correspond to the sequence of vertices visited by…
Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=0) on T is the nearest-neighbor random walk which, when at a…
The Airy line ensemble is a random collection of continuous ordered paths that plays an important role within random matrix theory and the Kardar-Parisi-Zhang universality class. The aim of this paper is to prove a universality property of…
Let $S$ be the random walk obtained from "coin turning" with some sequence $\{p_n\}_{n\ge 1}$, as introduced in [6]. In this paper we investigate the scaling limits of $S$ in the spirit of the classical Donsker invariance principle, both…
We consider the equiprobable distribution of spanning trees on the square lattice. All bonds of each tree can be oriented uniquely with respect to an arbitrary chosen site called the root. The problem of predecessors is finding the…
We study the scaling laws of diffusion in two-dimensional media with long-range correlated disorder through exact enumeration of random walks. The disordered medium is modelled by percolation clusters with correlations decaying with the…
We introduce a model of tree-rooted planar maps weighted by their number of $2$-connected blocks. We study its enumerative properties and prove that it undergoes a phase transition. We give the distribution of the size of the largest…
We consider the survival probability $f(t)$ of a random walk with a constant hopping rate $w$ on a host lattice of fractal dimension $d$ and spectral dimension $d_s\le 2$, with spatially correlated traps. The traps form a sublattice with…
The main topic of these lecture notes is the continuum scaling limit of planar lattice models. One reason why this topic occupies an important place in the theory of probability and mathematical statistical physics is that scaling limits…
One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…
For random collections of self-avoiding loops in two-dimensional domains, we define a simple and natural conformal restriction property that is conjecturally satisfied by the scaling limits of interfaces in models from statistical physics.…
Kenyon, Miller, Sheffield, and Wilson (2015) showed how to encode a random bipolar-oriented planar map by means of a random walk with a certain step size distribution. Using this encoding together with the mating-of-trees construction of…
In this work we investigate a class of random walks that interacts with its environment called Tree Builder Random Walk (TBRW). In our settings, at each step, the walker adds a random number of vertices to its position sampled according to…
In this article, we establish solid foundations for the study of Maximal Entropy Random Walks (MERWs) on infinite graphs. We introduce a generalized definition that extends the original concept, along with rigorous tools for handling this…
We introduce a family of stochastic processes on the integers, depending on a parameter $p \in [0,1]$ and interpolating between the deterministic rotor walk (p=0) and the simple random walk (p=1/2). This p-rotor walk is not a Markov chain…