English
Related papers

Related papers: The dual tree of a recursive triangulation of the …

200 papers

We introduce and study an infinite random triangulation of the unit disk that arises as the limit of several recursive models. This triangulation is generated by throwing chords uniformly at random in the unit disk and keeping only those…

Probability · Mathematics 2012-01-19 Nicolas Curien , Jean-François Le Gall

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…

Probability · Mathematics 2016-02-17 Igor Kortchemski , Cyril Marzouk

In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…

Probability · Mathematics 2025-11-24 Gabriel Berzunza Ojeda , Cecilia Holmgren , Paul Thévenin

We consider a compact orientable hyperbolic 3-manifold with a compressible boundary. Suppose that we are given a sequence of geometrically finite hyperbolic metrics whose conformal boundary structures at infinity diverge to a projective…

Geometric Topology · Mathematics 2011-11-28 Inkang Kim , Cyril Lecuire , Ken'ichi Ohshika

In this paper we prove a theorem concerning lamination limits of sequences of compact disks $M_n$ embedded in $\mathbb{R}^3$ with constant mean curvature $H_n$, when the boundaries of these disks tend to infinity. This theorem generalizes…

Differential Geometry · Mathematics 2015-11-04 William H. Meeks , Giuseppe Tinaglia

We study random typical minimal factorizations of the $n$-cycle into transpositions, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions. By viewing transpositions as chords of the unit disk and by reading them…

Probability · Mathematics 2018-12-04 Valentin Féray , Igor Kortchemski

We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…

Probability · Mathematics 2014-07-01 Rudolf Grübel , Igor Michailow

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…

Probability · Mathematics 2025-11-07 Ewain Gwynne , Nina Holden , Xin Sun

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…

Probability · Mathematics 2022-05-12 Cyril Marzouk

We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…

Probability · Mathematics 2021-05-05 Nicolas Broutin , Henning Sulzbach

We give a new proof of a theorem by Le Gall & Paulin, showing that scaling limits of random planar quadrangulations are homeomorphic to the 2-sphere. The main geometric tool is a reinforcement of the notion of Gromov-Hausdorff convergence,…

Probability · Mathematics 2008-01-02 Grégory Marc Miermont

We provide a new geometric representation of a family of fragmentation processes by nested laminations, which are compact subsets of the unit disk made of noncrossing chords. We specifically consider a fragmentation obtained by cutting a…

Probability · Mathematics 2020-01-20 Paul Thévenin

Let $Q$ be a free Boltzmann quadrangulation with simple boundary decorated by a critical ($p=3/4$) face percolation configuration. We prove that the chordal percolation exploration path on $Q$ between two marked boundary edges converges in…

Probability · Mathematics 2021-02-12 Ewain Gwynne , Jason Miller

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 consider an embedding of planar maps into an equilateral triangle $\Delta$ which we call the Cardy embedding. The embedding is a discrete approximation of a conformal map based on percolation observables that are used in Smirnov's proof…

Probability · Mathematics 2021-06-04 Nina Holden , Xin Sun

We prove that quadrangulations with a simple boundary converge to the Brownian disk. More precisely, we fix a sequence $(p_n)$ of even positive integers with $p_n\sim 2\alpha \sqrt{2n}$ for some $\alpha\in(0,\infty)$. Then, for the…

Probability · Mathematics 2023-10-13 Jérémie Bettinelli , Nicolas Curien , Luis Fredes , Avelio Sepúlveda

Dual decomposition approaches in nonconvex optimization may suffer from a duality gap. This poses a challenge when applying them directly to nonconvex problems such as MAP-inference in a Markov random field (MRF) with continuous state…

Optimization and Control · Mathematics 2022-05-17 Hartmut Bauermeister , Emanuel Laude , Thomas Möllenhoff , Michael Moeller , Daniel Cremers

We embed Duquesne and Le Gall's stable tree into a binary compact continuum random tree (CRT) in a way that solves an open problem posed by Goldschmidt and Haas. This CRT can be obtained by applying a recursive construction method of…

Probability · Mathematics 2016-11-09 Franz Rembart , Matthias Winkel

For given smooth functions $(f_1,\dots,f_n)$ on $M$, Fukaya and Oh showed that the moduli space of pseudoholomorphic disks in $T^*M$ which are bounded by Lagrangian sections $\{L_i^\epsilon=\operatorname{graph}(\epsilon df_i)\}$ is…

Symplectic Geometry · Mathematics 2026-03-16 Hidemasa Suzuki

We establish a duality result between linear index coding and Locally Repairable Codes (LRCs). Specifically, we show that a natural extension of LRCs we call Generalized Locally Repairable Codes (GLCRs) are exactly dual to linear index…

Information Theory · Computer Science 2014-02-18 Karthikeyan Shanmugam , Alexandros G. Dimakis
‹ Prev 1 2 3 10 Next ›