Fluctuations of the Occupation Density for a Parking Process

ABSTRACT: Consider the following simple parking process on n := {−n,..., n}d , d ≥ 1: at each step, a site i is chosen at random in n and if i and all its nearest neighbor sites are empty, i is occupied. Once occupied, a site remains so forever. The process continues until all sites in n are either...