Skip to main content
Article thumbnail
Location of Repository

Bipartite Random Graphs and Cuckoo Hashing

By Reinhard Kutzelnigg


The aim of this paper is to extend the analysis of Cuckoo Hashing of Devroye and Morin in 2003. In particular we make several asymptotic results much more precise. We show, that the probability that the construction of a hash table succeeds, is asymptotically 1 − c(ε)/m + O(1/m 2) for some explicit c(ε), where m denotes the size of each of the two tables, n = m(1 − ε) is the number of keys and ε ∈ (0, 1). The analysis rests on a generating function approach to the so called Cuckoo Graph, a random bipartite graph. We apply a double saddle point method to obtain asymptotic results covering tree sizes, the number of cycles and the probability that no complex component occurs

Topics: hashing, random bipartite graphs, generating functions, double saddle point method
Year: 2006
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.