Deviation results for sparse tables in hashing with linear probing
Preprint
Abstract
We consider the model of hashing with linear probing and we establish the moderate and large deviations for the total displacement in sparse tables. In this context, Weibull-like-tailed random variables appear. Deviations for sums of such heavy-tailed random variables are studied in \cite{Nagaev69-1,Nagaev69-2}. Here we adapt the proofs therein to deal with conditioned sums of such variables and solve the open question in \cite{TFC12}. By the way, we establish the deviations of the total displacement in full tables, which can be derived from the deviations of empirical processes of i.i.d.\ random variables established in \cite{Wu94}..Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Large-deviation results for triangular arrays of semiexponential random variablesJournal of Applied Probability, 2022
- A conditional Berry–Esseen inequalityJournal of Applied Probability, 2019
- A simple proof of Sanov’s theorem*Bulletin of the Brazilian Mathematical Society, New Series, 2006
- Individual displacements for linear probing hashing with different insertion policiesACM Transactions on Algorithms, 2005
- Phase transition for Parking blocks, Brownian excursion and coalescenceRandom Structures & Algorithms, 2002
- Parking with densityRandom Structures & Algorithms, 2001
- On the Analysis of Linear Probing HashingAlgorithmica, 1998
- Large Deviations of Heavy-Tailed Sums with Applications in InsuranceExtremes, 1998
- Large Deviations, Moderate Deviations and LIL for Empirical ProcessesThe Annals of Probability, 1994
- A theorem about probabilities of large deviations with an application to queuing theoryPeriodica Mathematica Hungarica, 1975