中文
相关论文

相关论文: Packing and Hausdorff measures of stable trees

200 篇论文

We study fine properties of L\'evy trees that are random compact metric spaces introduced by Le Gall and Le Jan in 1998 as the genealogy of continuous state branching processes. L\'evy trees are the scaling limits of Galton-Watson trees and…

概率论 · 数学 2010-08-03 Thomas Duquesne

We study fine properties of the so-called stable trees, which are the scaling limits of critical Galton-Watson trees conditioned to be large. In particular we derive the exact Hausdorff measure function for Aldous' continuum random tree and…

概率论 · 数学 2007-05-23 Thomas Duquesne , Jean-Francois Le Gall

The $\gamma$-stable trees are random measured compact metric spaces that appear as the scaling limit of Galton-Watson trees whose offspring distribution lies in a $\gamma$-stable domain, $\gamma \in (1, 2]$. They form a specific class of…

概率论 · 数学 2011-11-16 Thomas Duquesne , Guanying Wang

It has been claimed in Aldous, Miermont and Pitman [PTRF, 2004] that all L\'evy trees are mixings of inhomogeneous continuum random trees. We give a rigorous proof of this claim in the case of a stable branching mechanism, relying on a new…

概率论 · 数学 2022-11-15 Minmin Wang

We study the diameter of L{\'e}vy trees that are random compact metric spaces obtained as the scaling limits of Galton-Watson trees. L{\'e}vy trees have been introduced by Le Gall and Le Jan (1998) and they generalise Aldous' Continuum…

概率论 · 数学 2015-03-18 Thomas Duquesne , Minmin Wang

Random code-trees with necks were introduced recently to generalise the notion of $V$-variable and random homogeneous sets. While it is known that the Hausdorff and packing dimensions coincide irrespective of overlaps, their exact Hausdorff…

度量几何 · 数学 2019-04-01 Sascha Troscheit

We introduce a class of random compact metric spaces L(\alpha) indexed by \alpha \in (1,2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can be informally be…

概率论 · 数学 2014-11-14 Nicolas Curien , Igor Kortchemski

Let $(\mathcal{T},d)$ be the random real tree with root $\rho$ coded by a Brownian excursion. So $(\mathcal{T},d)$ is (up to normalisation) Aldous CRT \cite{AldousI} (see Le Gall \cite{LG91}). The $a$-level set of $\mathcal{T}$ is the set…

概率论 · 数学 2014-07-22 Xan Duhalde

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…

概率论 · 数学 2007-05-23 Thomas Duquesne , Jean-Francois Le Gall

We prove that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set converges in the Gromov-Hausdorff sense after a suitable rescaling to the Brownian continuum random tree. This proves a conjecture by…

概率论 · 数学 2016-12-15 Benedikt Stufler

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…

概率论 · 数学 2021-05-05 Nicolas Broutin , Henning Sulzbach

We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to the local time of a standard Brownian excursion. Furthermore…

组合数学 · 数学 2010-03-08 Michael Drmota , Bernhard Gittenberger

We define decorated $\alpha$-stable trees which are informally obtained from an $\alpha$-stable tree by blowing up its branchpoints into random metric spaces. This generalizes the $\alpha$-stable looptrees of Curien and Kortchemski, where…

We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…

数学物理 · 物理学 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the…

概率论 · 数学 2017-04-10 Tao Lei

We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…

概率论 · 数学 2016-12-19 Nicolas Curien , Bénédicte Haas

We determine the exact Hausdorff measure functions for the range and level sets of a class of Gaussian random fields satisfying sectorial local nondeterminism and other assumptions. We also establish a Chung-type law of the iterated…

概率论 · 数学 2020-12-08 Cheuk Yin Lee

We introduce a new, relatively simple, line-breaking construction of the $\alpha$-stable tree which realises its random finite-dimensional distributions. This is a direct analogue of Aldous' line-breaking construction of the Brownian…

概率论 · 数学 2026-02-11 Christina Goldschmidt , Liam Hill

We obtain new non-asymptotic tail bounds for the height of uniformly random trees with a given degree sequence, simply generated trees and conditioned Bienaym\'e trees (the family trees of branching processes), in the process settling three…

概率论 · 数学 2024-03-11 Louigi Addario-Berry , Serte Donderwinkel

The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree. Aldous's Brownian continuum random tree, the…

概率论 · 数学 2007-05-23 Steven N. Evans , Jim Pitman , Anita Winter
‹ 上一页 1 2 3 10 下一页 ›