English
Related papers

Related papers: Fractal random sets associated with multitype Galt…

200 papers

We prove some asymptotic results for the radius and the profile of large random rooted planar maps with faces of arbitrary degrees. Using a bijection due to Bouttier, Di Francesco and Guitter between rooted planar maps and certain four-type…

Probability · Mathematics 2007-06-25 Grégory Miermont , Mathilde Weill

An interesting class of automatic sequences emerges from iterated paperfolding. The sequences generate curves in the plane with an almost periodic structure. We generalize the results obtained by Davis and Knuth on the self-avoiding and…

Combinatorics · Mathematics 2011-01-07 Michel Dekking

In this article, we study a simple random walk on a decorated Galton-Watson tree, obtained from a Galton-Watson tree by replacing each vertex of degree $n$ with an independent copy of a graph $G_n$ and gluing the inserted graphs along the…

Probability · Mathematics 2022-08-02 Eleanor Archer

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

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

Probability · Mathematics 2016-04-08 Charles Bordenave , Pietro Caputo

We study a model of growing planar tree graphs where in each time step we separate the tree into two components by splitting a vertex and then connect the two pieces by inserting a new link between the daughter vertices. This model…

Statistical Mechanics · Physics 2009-11-13 Francois David , Mark Dukes , Thordur Jonsson , Sigurdur Orn Stefansson

\emph{Fractal percolation} or \emph{Mandelbrot percolation} is one of the most well studied families of random fractals. In this paper we study some of the geometric measure theoretical properties (dimension of projections and structure of…

Dynamical Systems · Mathematics 2015-06-16 Michal Rams , Károly Simon

We calculate the almost sure Hausdorff dimension of uniformly random self-similar fractals. These random fractals are generated from a finite family of similarities, where the linear parts of the mappings are independent uniformly…

Dynamical Systems · Mathematics 2015-05-11 Henna Koivusalo

The Horton-Strahler number -- also called the register function -- is a combinatorial tool that quantifies the branching complexity of a rooted tree. We study the law of the Horton-Strahler number of stable Galton-Watson trees conditioned…

Probability · Mathematics 2025-09-10 Robin Khanfir

We study some properties of a class of random connected planar fractal sets induced by a Poissonian scale-invariant and translation-invariant point process. Using the second-moment method, we show that their Hausdorff dimensions are…

Probability · Mathematics 2017-07-19 Serban Nacu , Wendelin Werner

We study the long-term behavior of weighted multi-type branching processes, focusing on extending classical laws of large numbers and martingale convergence to settings with infinitely many weighted particles, arbitrary type spaces and…

Probability · Mathematics 2025-12-09 Denis Villemonais , Nicolas Zalduendo

We study numerically the fractal structure of the intrinsic geometry of random surfaces coupled to matter fields with $c=1$. Using baby universe surgery it was possible to simulate randomly triangulated surfaces made of 260.000 triangles.…

High Energy Physics - Theory · Physics 2009-10-28 J. Ambjorn P. Bialas , Z. Burda , J. Jurkiewicz , B. Petersson

We characterize the existence of certain geometric configurations in the fractal percolation limit set $A$ in terms of the almost sure dimension of $A$. Some examples of the configurations we study are: homothetic copies of finite sets,…

Probability · Mathematics 2017-03-29 Pablo Shmerkin , Ville Suomala

In this paper we propose a new model of random graph directed fractals that extends the current well-known model of random graph directed iterated function systems, $V$-variable attractors, and fractal and Mandelbrot percolation. We study…

Metric Geometry · Mathematics 2019-12-23 Sascha Troscheit

We investigate the random continuous trees called L\'evy trees, which are obtained as scaling limits of discrete Galton-Watson trees. We give a mathematically precise definition of these random trees as random variables taking values in the…

Probability · Mathematics 2007-05-23 Thomas Duquesne , Jean-Francois Le Gall

Investigating a model of scale-invariant random spatial network suggested by Aldous, Kendall constructed a random metric $T$ on $\mathbb{R}^d$, for which the distance between points is given by the optimal connection time, when travelling…

Probability · Mathematics 2023-01-31 Guillaume Blanc

We propose an iterated version of the Gilbert model, which results in a sequence of random mosaics of the plane. We prove that under appropriate scaling, this sequence of mosaics converges to that obtained by a classical Poisson line…

Probability · Mathematics 2016-10-28 Francois Baccelli , Ngoc M. Tran

We investigate Voronoi-like tessellations of bipartite quadrangulations on surfaces of arbitrary genus, by using a natural generalization of a bijection of Marcus and Schaeffer allowing to encode such structures into labeled maps with a…

Probability · Mathematics 2009-05-17 Grégory Miermont

We observe stationary random tessellations $X=\{\Xi_n\}_{n\ge1}$ in $\mathbb{R}^d$ through a convex sampling window $W$ that expands unboundedly and we determine the total $(k-1)$-volume of those $(k-1)$-dimensional manifold processes which…

Probability · Mathematics 2007-09-14 Lothar Heinrich , Hendrik Schmidt , Volker Schmidt

A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…

Probability · Mathematics 2012-06-19 Michael Aizenman , Almut Burchard , Charles M. Newman , David B. Wilson