Parking with density
From MaRDI portal
The author considers a problem of 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 consecutive occupied places and the total displacement of the cars are also studied.
Recommendations
Cites work
- Acyclic and parking functions
- An approximation of partial sums of independent RV's, and the sample DF. II
- Hashing with Linear Probing under Nonuniform Probabilities
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- Linear probing: The probable largest search time grows logarithmically with the number of records
- Mappings of acyclic and parking functions
- On the analysis of linear probing hashing
- Open-addressing hashing with unequal-probability keys
- The expected length of the longest probe sequence for bucket searching when the distribution is not uniform
Cited in
(11)- On the parking problem
- Hard rods: statistics of parking configurations
- Saturation in a Markovian parking process
- Deviation results for sparse tables in hashing with linear probing
- Group parking permit problems
- Per-site occupancy in the discrete parking problem
- Random parking, Euclidean functionals, and rubber elasticity
- A conditional Berry-Esseen inequality
- Parking in the city: an example of limited resource sharing
- Asymptotics in Knuth's parking problem for caravans
- Burning cars in a parking lot
This page was built for publication: Parking with density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2746214)