论文信息 - Parking with density

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. ©2001 John Wiley & Sons, Inc. Random Struct. Alg., 18: 364–380, 2001.

Jean-François Marckert

[1] Philippe Flajolet,et al. On the Analysis of Linear Probing Hashing , 1998, Algorithmica.

[2] Svante Janson,et al. A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0 , 2001 .

[3] Georg Ch. Pflug,et al. Linear probing with a nonuniform address distribution , 1987, JACM.

[4] Amir Dembo,et al. Large Deviations Techniques and Applications , 1998 .

[5] Jean Françon. Acyclic and Parking Functions , 1975, J. Comb. Theory, Ser. A.

[6] David Aldous. Hashing with Linear Probing under Nonuniform Probabilities , 1988 .

[7] Luc Devroye,et al. The Expected Length of the Longest Probe Sequence for Bucket Searching when the Distribution is Not Uniform , 1985, J. Algorithms.

[8] P. Major,et al. An approximation of partial sums of independent RV's, and the sample DF. II , 1975 .

[9] Gaston H. Gonnet. Open-Addressing Hashing with Unequal-Probability Keys , 1980, J. Comput. Syst. Sci..

[10] David Thomas,et al. The Art in Computer Programming , 2001 .

[11] P. Major,et al. An approximation of partial sums of independent RV'-s, and the sample DF. I , 1975 .

[12] Boris G. Pittel,et al. Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records , 1987, J. Algorithms.

[13] John Riordan,et al. Mappings of acyclic and parking functions , 1974 .

[14] Guy Louchard,et al. Phase Transition for Parking Blocks, Brownian Excursion and Coalescence , 2022 .