Regenerative Compositions in the Case of Slow Variation

Asymptotic laws for regenerative compositions: gamma subordinators and the like

For $\widetilde{\cal R} = 1 - \exp(- {\cal R})$ a random closed set obtained by exponential transformation of the closed range ${\cal R}$ of a subordinator, a regenerative composition of generic positive integer $n$ is defined by recording the sizes of clusters of $n$ uniform random points as they are separated by the points of $\widetilde{\cal R}$. We focus on the number of parts $K_n$ of the composition when $\widetilde{\cal R}$ is derived from a gamma subordinator. We prove logarithmic asymptotics of the moments and central limit theorems for $K_n$ and other functionals of the composition s…

Regenerative Composition Structures

A new class of random composition structures (the ordered analog of Kingman's partition structures) is defined by a regenerative description of component sizes. Each regenerative composition structure is represented by a process of random sampling of points from an exponential distribution on the positive halfline, and separating the points into clusters by an independent regenerative random set. Examples are composition structures derived from residual allocation models, including one associated with the Ewens sampling formula, and composition structures derived from the zero set of a Brownia…

Regenerative compositions in the case of slow variation: A renewal theory approach

A regenerative composition structure is a sequence of ordered partitions derived from the range of a subordinator by a natural sampling procedure. In this paper, we extend previous studies Barbour and Gnedin (2006), Gnedin, Iksanov and Marynych (2010) and Gnedin, Pitman and Yor (2006) on the asymptotics of the number of blocks $K_n$ in the composition of integer $n$, in the case when the L{é}vy measure of the subordinator has a property of slow variation at 0. Using tools from the renewal theory the limit laws for $K_n$ are obtained in terms of integrals involving the Brownian motion or stable…

由类伽马从属过程生成的可再生组合中块数的重对数律

A law of the iterated logarithm for the number of blocks in regenerative compositions generated by gamma-like subordinators

本文研究由类伽马从属过程生成的可再生随机组合，证明了当样本量趋于无穷时组合中块数满足重对数律，并附带证明了布朗运动与正则变化函数卷积的重对数律。

Regenerative tree growth: Binary self-similar continuum random trees and Poisson--Dirichlet compositions

We use a natural ordered extension of the Chinese Restaurant Process to grow a two-parameter family of binary self-similar continuum fragmentation trees. We provide an explicit embedding of Ford's sequence of alpha model trees in the continuum tree which we identified in a previous article as a distributional scaling limit of Ford's trees. In general, the Markov branching trees induced by the two-parameter growth rule are not sampling consistent, so the existence of compact limiting trees cannot be deduced from previous work on the sampling consistent case. We develop here a new approach to es…

Moderate parts in regenerative compositions: the case of regular variation

A regenerative random composition of integer $n$ is constructed by allocating $n$ standard exponential points over a countable number of intervals, comprising the complement of the closed range of a subordinator $S$. Assuming that the Lévy measure of $S$ is infinite and regularly varying at zero of index $-α$, $α\in(0,\,1)$, we find an explicit threshold $r=r(n)$, such that the number $K_{n,\,r(n)}$ of blocks of size $r(n)$ converges in distribution without any normalization to a mixed Poisson distribution. The sequence $(r(n))$ turns out to be regularly varying with index $α/(α+1)$ and the mi…