Random gluing of metric spaces
From MaRDI portal
Publication:2189459
DOI10.1214/19-AOP1348zbMATH Open1454.60024arXiv1707.09833MaRDI QIDQ2189459FDOQ2189459
Publication date: 15 June 2020
Published in: The Annals of Probability (Search for Journal in Brave)
Abstract: We construct random metric spaces by gluing together an infinite sequence of pointed metric spaces that we call blocks. At each step, we glue the next block to the structure constructed so far by randomly choosing a point on the structure and then identifying it with the distinguished point of the block. The random object that we study is the completion of the structure we obtain after an infinite number of steps. We introduce a sequence that we call the weights of the blocks. The probability at each step that the next block is glued onto any of the preceding blocks is proportional to its weight. We suppose that the blocks are i.i.d. copies of the same random metric space, scaled by deterministic factors that we call . We work under some conditions on the distribution of the blocks ensuring that they a.s. have dimension , for some . The main contribution of this paper is the computation of the Hausdorff dimension of the set of points which appear during the completion procedure, which we call the leaves, when and typically behave like a power of , say for the scaling factors and for the weights. For a large domain of and , we have . However for and , our results reveal an interesting phenomenon: the dimension has a non-trivial dependence in , and , namely .}
Full work available at URL: https://arxiv.org/abs/1707.09833
Recommendations
- scientific article
- scientific article
- scientific article
- scientific article; zbMATH DE number 3400210
- scientific article; zbMATH DE number 3400212
- Random metric theory and its applications
- Random fixed point theorems in metric spaces
- Random metric spaces and random normed linear spaces
- Random metric spaces and universality
- On the probability that finite spaces with random distances are metric spaces
Cites Work
- Fractal geometry. Mathematical foundations and applications
- Geodesics in large planar maps and in the Brownian map
- The continuum random tree. I
- A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
- Critical random graphs: limiting constructions and distributional properties
- Urysohn universal space, its development and Hausdorff's approach
- A time-dependent version of Pólya's urn
- Scaling limits and influence of the seed graph in preferential attachment trees
- A line-breaking construction of the stable trees
- Explosion and linear transit times in infinite trees
- Asymptotics of heights in random trees constructed by aggregation
- Extensions of Measures and the Von Neumann Selection Theorem
- A large deviation principle for the Brownian snake
- Exceptionally small balls in stable trees
- Scaling limits for some random trees constructed inhomogeneously
- Decomposition of Lévy trees along their diameter
- Recursive construction of continuum random trees
- Random trees constructed by aggregation
- On the asymptotic behaviour of random recursive trees in random environments
Cited In (7)
- Decorated stable trees
- Scaling limits of multi-type Markov branching trees
- A binary embedding of the stable line-breaking construction
- Depths in random recursive metric spaces
- Compactness and fractal dimensions of inhomogeneous continuum random trees
- Stable graphs: distributions and line-breaking construction
- Growing random graphs with a preferential attachment structure
This page was built for publication: Random gluing of metric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189459)