English
Related papers

Related papers: Scaling limits for the peeling process on random m…

200 papers

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…

Probability · Mathematics 2018-09-07 Timothy Budd

The infinite discrete stable Boltzmann maps are "heavy-tailed" generalisations of the well-known Uniform Infinite Planar Quadrangulation. Very efficient tools to study these objects are Markovian step-by-step explorations of the lattice…

Probability · Mathematics 2021-03-26 Nicolas Curien , Cyril Marzouk

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…

Mathematical Physics · Physics 2016-02-23 Timothy Budd

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.…

Probability · Mathematics 2018-03-09 Nicolas Curien , Cyril Marzouk

The uniform infinite planar quadrangulation is an infinite random graph embedded in the plane, which is the local limit of uniformly distributed finite quadrangulations with a fixed number of faces. We study asymptotic properties of this…

Probability · Mathematics 2017-01-05 Jean-François Le Gall , Laurent Ménard

We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…

Probability · Mathematics 2016-08-04 Erich Baur , Grégory Miermont , Gourab Ray

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…

Probability · Mathematics 2024-05-03 Aleksandra Korzhenkova

We construct the uniform infinite planar map (UIPM), obtained as the n \to \infty local limit of planar maps with n edges, chosen uniformly at random. We then describe how the UIPM can be sampled using a "peeling" process, in a similar way…

Probability · Mathematics 2017-01-05 Laurent Ménard , Pierre Nolin

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…

Probability · Mathematics 2013-01-23 Omer Angel , Nicolas Curien

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…

Probability · Mathematics 2015-12-21 Loïc Richier

The convex hull peeling of a point set is obtained by taking the convex hull of the set and repeating iteratively the operation on the interior points until no point remains. The boundary of each hull is called a layer. We study the number…

Probability · Mathematics 2022-06-22 Pierre Calka , Gauthier Quilan

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…

Probability · Mathematics 2021-07-01 Timothy Budd , Nicolas Curien

Pareto hull peeling is a discrete algorithm, generalizing convex hull peeling, for sorting points in Euclidean space. We prove that Pareto peeling of a random point set in two dimensions has a scaling limit described by a first-order…

Probability · Mathematics 2023-05-31 Ahmed Bou-Rabee , Peter S. Morfe

We establish the scaling limit of the geodesics to the root for the first passage percolation distance on random planar maps. We first describe the scaling limit of the number of faces along the geodesics. This result enables us to compare…

Probability · Mathematics 2025-09-15 Emmanuel Kammerer

We develop a method to compute the generating function of the number of vertices inside certain regions of the Uniform Infinite Planar Triangulation (UIPT). The computations are mostly combinatorial in flavor and the main tool is the…

Probability · Mathematics 2020-03-16 Laurent Ménard

We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its…

Probability · Mathematics 2017-11-22 Paola Bermolen , Matthieu Jonckheere , Jaron Sanders

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…

Probability · Mathematics 2015-04-10 Paola Bermolen , Matthieu Jonckheere , Jaron Sanders

We study site percolation on uniform quadrangulations of the upper half plane. The main contribution is a method for applying Angel's peeling process, in particular for analyzing an evolving boundary condition during the peeling. Our method…

Probability · Mathematics 2019-12-16 Jakob E. Björnberg , Sigurdur Örn Stefánsson

We consider several aspects of the scaling limit of percolation on random planar triangulations, both finite and infinite. The equivalents for random maps of Cardy's formula for the limit under scaling of various crossing probabilities are…

Probability · Mathematics 2007-05-23 Omer Angel

We prove sandwich theorems and a Tauberian theorem in the space of compact metric measure spaces, endowed with the Gromov-Hausdorff-Prokhorov (GHP) topology. These results hold with respect to a close relative of Gromov's Lipschitz order.…

Probability · Mathematics 2025-10-08 William Fleurat
‹ Prev 1 2 3 10 Next ›