The size of random fragmentation trees

Details The size of random fragmentation trees The size of random fragmentation trees

2006-09-13

arxiv.org/abs/math/0609350v1

Mathematics

Probability

Scientific paper

We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), 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 add further details. The proof uses the contraction method. We extend some previous results for recursive sequences of random variables to families of random variables with a continuous parameter; we believe that this extension has independent interest.

Affiliated with

Also associated with

No associations

Rating

The size of random fragmentation trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The size of random fragmentation trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The size of random fragmentation trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-554802