相关论文: Random Planar Lattices and Integrated SuperBrownia…

We develop an excursion theory for Brownian motion indexed by the Brownian tree, which in many respects is analogous to the classical It\^o theory for linear Brownian motion. Each excursion is associated with a connected component of the…

We study random walks on sub-Riemannian manifolds using the framework of retractions, i.e., approximations of normal geodesics. We show that such walks converge to the correct horizontal Brownian motion if normal geodesics are approximated…

This paper is devoted to the asymptotic analysis of the reinforced elephant random walk (RERW) using a martingale approach. In the diffusive and critical regimes, we establish the almost sure convergence, the law of iterated logarithm and…

We study the statistical properties of geodesics, i.e. paths of minimal length, in large random planar quadrangulations. We extend Schaeffer's well-labeled tree bijection to the case of quadrangulations with a marked geodesic, leading to…

We review results on linearly edge-reinforced random walks. On finite graphs, the process has the same distribution as a mixture of reversible Markov chains. This has applications in Bayesian statistics and it has been used in studying the…

In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…

We identify the local scaling limit of the Uniform Infinite Planar Quadrangulation (UIPQ) and of critical Boltzmann quadrangulations, when one simultaneously rescales the distances and reroot them far away from the root of a distinguished…

We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…

A rotor configuration on a graph contains in every vertex an infinite ordered sequence of rotors, each is pointing to a neighbor of the vertex. After sampling a configuration according to some probability measure, a rotor walk is a…

We prove a scaling limit result for random walk on certain random planar maps with its natural time parametrization. In particular, we show that for $\gamma \in (0,2)$, the random walk on the mated-CRT map with parameter $\gamma$ converges…

We survey recent developments about random real trees, whose prototype is the Continuum Random Tree (CRT) introduced by Aldous in 1991. We briefly explain the formalism of real trees, which yields a neat presentation of the theory and in…

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 give a lower bound for the non-collision probability up to a long time T in a system of n independent random walks with fixed obstacles on the two-dimensional lattice. By `collision' we mean collision between the random walks as well as…

We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…

In the present paper, we introduce and analyze elephant random walks (ERWs) on bipartite periodic lattices arising as coverings of dipole graphs. We focus on lattices whose admissible step directions in the two parts of the bipartition are…

In 1990, Schnyder used a 3-spanning-tree decomposition of a simple triangulation, now known as the Schnyder wood, to give a fundamental grid-embedding algorithm for planar maps. In the framework of mating of trees, a uniformly sampled…

Given a planar triangulation, a 3-orientation is an orientation of the internal edges so all internal vertices have out-degree three. Each 3-orientation gives rise to a unique edge coloring known as a Schnyder wood that has proven powerful…

We study the asymptotic behavior of random simply generated noncrossing planar trees in the space of compact subsets of the unit disk, equipped with the Hausdorff distance. Their distributional limits are obtained by triangulating at random…

Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on $\mathbb{Z}^2$ is $\mathrm{SLE}_2$. We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs embedded into…

We study the random planar map obtained from a critical, finite variance, Galton-Watson plane tree by adding the horizontal connections between successive vertices at each level. This random graph is closely related to the well-known causal…