Related papers: The exploration process of critical Boltzmann plan…
We study random bipartite planar maps defined by assigning nonnegative weights to each face of a map. We prove that for certain choices of weights a unique large face, having degree proportional to the total number of edges in the maps,…
We investigate the geometry of a typical spin cluster in random triangulations sampled with a probability proportional to the energy of an Ising configuration on their vertices, both in the finite and infinite volume settings. This model is…
We study the branching tree of the perimeters of the nested loops in critical $O(n)$ model for $n \in (0,2)$ on random quadrangulations. We prove that after renormalization it converges towards an explicit continuous multiplicative cascade…
We discuss duality properties of critical Boltzmann planar maps such that the degree of a typical face is in the domain of attraction of a stable distribution with parameter $\alpha\in(1,2]$. We consider the critical Bernoulli bond…
We study Bernoulli percolations on random lattices of the half-plane obtained as local limit of uniform planar triangulations or quadrangulations. Using the characteristic spatial Markov property or peeling process of these random lattices…
We study a configuration model on bipartite planar maps in which, given $n$ even integers, one samples a planar map with $n$ faces uniformly at random with these face degrees. We prove that when suitably rescaled, such maps always admit…
We consider maps which are constructed from plane trees by assigning marks to the corners of each vertex and then connecting each pair of consecutive marks on their contour by a single edge. A measure is defined on the set of such maps by…
We study the percolation model on Boltzmann triangulations using a generating function approach. More precisely, we consider a Boltzmann model on the set of finite planar triangulations, together with a percolation configuration (either…
Random planar maps are considered in the physics literature as the discrete counterpart of random surfaces. It is conjectured that properly rescaled random planar maps, when conditioned to have a large number of faces, should converge to a…
The Temporal Graph Exploration problem (TEXP) takes as input a temporal graph, i.e., a sequence of graphs $(G_i)_{i\in \mathbb{N}}$ on the same vertex set, and asks for a walk of shortest length visiting all vertices, where the $i$-th step…
We introduce the set of (non-spanning) tree-decorated planar maps, and show that they are in bijection with the Cartesian product between the set of trees and the set of maps with a simple boundary. As a consequence, we count the number of…
We prove that large Boltzmann stable planar maps of index $\alpha \in (1;2)$ converge in the scaling limit towards a random compact metric space $\mathcal{S}_{\alpha}$ that we construct explicitly. They form a one-parameter family of random…
This study analyzes the Collatz map through nonlinear dynamics. By embedding integers in Sharkovsky's ordering, we show that odd initial values suffice for full dynamical characterization. We introduce ``direction phases'' to partition…
We show that a large class of site percolation processes on any planar graph contains either zero or infinitely many infinite connected components. The assumptions that we require are: tail triviality, positive association (FKG) and that…
We study a model of $n$ non-intersecting squared Bessel processes in the confluent case: all paths start at time $t = 0$ at the same positive value $x = a$, remain positive, and are conditioned to end at time $t = T$ at $x = 0$. In the…
We consider critical percolation on the triangular lattice in a bounded simply connected domain with boundary conditions that force an interface between two prescribed boundary points. We say the interface forms a "near-loop" when it comes…
We study the asymptotic behaviour of uniform random maps with a prescribed face-degree sequence, in the bipartite case, as the number of faces tends to infinity. Under mild assumptions, we show that, properly rescaled, such maps converge in…
We study a large class of Bernoulli percolation models on random lattices of the half- plane, obtained as local limits of uniform planar triangulations or quadrangulations. We first compute the exact value of the site percolation threshold…
We introduce Eulerian maps with blocked edges as a general way to implement statistical matter models on random maps by a modification of intrinsic distances. We show how to code these dressed maps by means of mobiles, i.e. decorated trees…
Recently, in ["The coin-turning walk and its scaling limit", Electronic Journal of Probability, 25 (2020)], the ``coin-turning walk'' was introduced on ${\mathbb Z}$. It is a non-Markovian process where the steps form a (possibly)…