Regenerative composition structures: characterisation and asymptotics of block counts
From MaRDI portal
A regenerative composition structure is a sequence \(({\mathcal C}_n)\) of random compositions of integers \(n=1,2,\dots\) which satisfies two conditions: the sampling consistency and the first-part deletion invariance. The author gives a selective overview of the topic of regenerative composition structures, by listing a few known results. For the entire collection see [Zbl 1047.68003].
Recommendations
- Regeneration in random combinatorial structures
- Asymptotics of largest components in combinatorial structures
- Asymptotics of combinatorial structures with large smallest component
- Block decomposition and statistics arising from permutation tableaux
- Recursive combinatorial structures: enumeration, probabilistic analysis and random generation
- Simulating the component counts of combinatorial structures
- Random generation and approximate counting of ambiguously described combinatorial structures
- Asymptotic laws for regenerative compositions: gamma subordinators and the like
- Localizing combinatorial properties for partitions on block graphs
- Reconstructing the number of blocks of an infinite graph
Cited in
(5)
This page was built for publication: Regenerative composition structures: characterisation and asymptotics of block counts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154704)