相关论文: Markovian explorations of random planar maps are r…
The peeling process, which describes a step-by-step exploration of a planar map, has been instrumental in addressing percolation problems on random infinite planar maps. Bond and face percolation on maps with faces of arbitrary degree are…
We extend the peeling exploration introduced in arxiv:1506.01590 to the setting of Boltzmann planar maps coupled to a rigid $O(n)$ loop model. Its law is related to a class of discrete Markov processes obtained by confining random walks to…
We study the scaling limit of the volume and perimeter of the discovered regions in the Markovian explorations known as peeling processes for infinite random planar maps such as the uniform infinite planar triangulation (UIPT) or…
We start by studying a peeling process on finite random planar maps with faces of arbitrary degrees determined by a general weight sequence, which satisfies an admissibility criterion. The corresponding perimeter process is identified as a…
We revisit, in a self contained way, the Markov property on planar maps and decorated planar maps from three perspectives. First, we characterize the laws on these planar maps that satisfy both the Markov property and rerooting invariance,…
We are interested in the cycles obtained by slicing at all heights random Boltzmann triangulations with a simple boundary. We establish a functional invariance principle for the lengths of these cycles, appropriately rescaled, as the size…
We study the geometry of infinite random Boltzmann planar maps having weight of polynomial decay of order $k^{-2}$ for each vertex of degree $k$. These correspond to the dual of the discrete "stable maps" of Le Gall and Miermont [Scaling…
In this paper we investigate pointed $(\mathbf{q}, g, n)$-Boltzmann loop-decorated maps with loops traversing only inner triangular faces. Using the peeling exploration of arXiv:1809.02012 modified to this setting we show that its law in…
The peeling process is an algorithmic procedure that discovers a random planar map step by step. In generic cases such as the UIPT or the UIPQ, it is known [Curien & Le Gall, Scaling limits for the peeling process on random maps, Ann. Inst.…
We study the geometry of infinite random Boltzmann planar maps with vertices of high degree. These correspond to the duals of the Boltzmann maps associated to a critical weight sequence $(q_{k})_{ k \geq 0}$ for the faces with polynomial…
We discuss asymptotics of large Boltzmann random planar maps such that every vertex of degree $k$ has weight of order $k^{-2}$. Infinite maps of that kind were studied by Budd, Curien and Marzouk. These maps can be seen as the dual of the…
A simple construction is presented, which generalises piecewise linear one-dimensional Markov maps to an arbitrary number of dimensions. The corresponding coupled map lattice, known as a simplicial mapping in the mathematical literature,…
The purpose of the present work is twofold. First, we develop the theory of general self-similar growth-fragmentation processes by focusing on martingales which appear naturally in this setting and by recasting classical results for…
Poissonian ensembles of Markov loops on a finite graph define a random graph process in which the addition of a loop can merge more than two connected components. We study Markov loops on the complete graph derived from a simple random walk…
We study the simple random walk on the Uniform Infinite Half-Plane Map, which is the local limit of critical Boltzmann planar maps with a large and simple boundary. We prove that the simple random walk is recurrent, and that the resistance…
We consider an exploration algorithm where at each step, a random number of items become active while related items get explored. Given an initial number of items $N$ growing to infinity and building on a strong homogeneity assumption, we…
Ballistic deposition is one of the many models of interface growth that are believed to be in the KPZ universality class, but have so far proved to be largely intractable mathematically. In this model, blocks of size one fall independently…
This habilitation thesis summarizes the research that I have carried out from 2005 to 2019. It is organized in four chapters. The first three deal with random planar maps. Chapter 1 is about their metric properties: from a general…
Analysis of algorithms on time-varying networks (often called evolving graphs) is a modern challenge in theoretical computer science. The edge-Markovian is a relatively simple and comprehensive model of evolving graphs: every pair of…
Consider Bernoulli(1/2) percolation on $\mathbb{Z}^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make…