Parking on a Random Tree

Details Parking on a Random Tree Parking on a Random Tree

2007-11-26

arxiv.org/abs/0711.4061v1

Mathematics

Probability

7 pages

Scientific paper

10.1007/s10955-008-9589-9

Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking RSA: at every vertex of the tree a particle (or car) arrives with rate one. The particle sticks to the vertex whenever the vertex and all of its nearest neighbors are not occupied yet. We provide an explicit expression for the so-called parking constant in terms of the generating function.

Affiliated with

Also associated with

No associations

Rating

Parking on a Random Tree 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 Parking on a Random Tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parking on a Random Tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-171023