Parking with density
We study parkings with n places, where: m(n) cars are placed according to a nonuniform probability. The aim of this paper is to show a threshold function (depending on the distribution) for the emergence of a giant component. The size of the largest blocks of consecutive occupied places and the total displacement of the cars are also studied. (C) 2001 John Wiley & Sons, Inc.
parking threshold function giant component analysis of algorithms hashing with linear probing