Parking on a random tree
Consider a uniform random rooted labelled tree on n vertices. We imagine that each node of the tree has space for a single car to park. A number m ≤ n of cars arrive one by one, each at a node chosen independently and uniformly at random. If a car arrives at a space which is already occupied, it fol...
| Main Authors: | , |
|---|---|
| 格式: | Journal article |
| 出版: |
Cambridge University Press
2018
|