Counting intervals in the packing process

DOI10.1214/aoap/1015345351zbMath1021.60005OpenAlexW2107323631MaRDI QIDQ1872417

Yuliy M. Baryshnikov, Alexander V. Gnedin

Publication date: 6 May 2003

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1015345351

zbMATH Keywords

limit theorempacking problemself-similar processrandom intervals

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05)

Related Items (4)

The size of random fragmentation trees ⋮ Additional aspects of the non-conservative Kolmogorov-Filippov fragmentation model ⋮ The dual tree of a recursive triangulation of the disk ⋮ Recognising the last record of sequence

Cites Work

• Splitting intervals. II: Limit laws for lengths
• Packing random intervals on-line
• Parking arcs on the circle with applications to one-dimensional communication networks
• Integro-differential equations and generalized hypergeometric functions
• Random Recursive Constructions: Asymptotic Geometric and Topological Properties
• A Review of the packing problem
• Fixed points of the smoothing transformation
• Splitting intervals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting intervals in the packing process