Parking on a random rooted plane tree
In this paper, we investigate a parking process on a uniform random rooted plane tree with n vertices. Every vertex of the tree has a parking space for a single car. Cars arrive at independent uniformly random vertices of the tree. If the parking space at a vertex is unoccupied when a car arrives th...
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Journal article |
| Språk: | English |
| Publicerad: |
Bernoulli Society for Mathematical Statistics and Probability
2020
|