The Size of Random Fragmentation Trees

@inproceedings{Neininger2006TheSO,
  title={The Size of Random Fragmentation Trees},
  author={Ralph Neininger},
  year={2006}
}
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar [7], who found a phase transition: the number of fragmentations is asymptotically normal in some cases but not in others, depending on the position of roots of a certain characteristic equation. This parallels the behaviour of discrete analogues with various random trees that have been studied in computer science. We give rigorous proofs of this phase transition, and… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS
13 Citations
31 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Random sequential bisection and its associated binary tree

  • M. Sibuya, Y. Itoh
  • Ann. Inst. Statist. Math
  • 1987
Highly Influential
4 Excerpts

Ideal metrics in the problem of approximating the distributions of sums of independent random variables. (Russian) Teor

  • V. M. Zolotarev
  • Verojatnost. i Primenen
  • 1977
Highly Influential
6 Excerpts

Approximation of the distributions of sums of independent random variables with values in infinite-dimensional spaces. (Russian.) Teor

  • V. M. Zolotarev
  • Verojatnost. i Primenen. 21,
  • 1976
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…