Data structures with dynamical random transitions

Abstract

We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered dynamic random walks. The basic operations (insertion, deletion, positive and negative queries, batched insertion, lazy deletion, etc.) are time-dependent random variables. This model is a (small) step toward the analysis of these structures when the distribution of the set of histories is not uniform. As an illustration, we focus on list structures (linear lists, priority queues, and dictionaries) but the technique is applicable as well to more advanced data structures.

DOI: 10.1002/rsa.20091

Extracted Key Phrases

6 Figures and Tables

Showing 1-10 of 21 references

Dynamic Z d -random walks in a random scenery: A strong law of large numbers

  • N Guillotin-Plantard
  • 2001
2 Excerpts

Asymptotics of a dynamic random walk in a random scenery I. A law of large numbers

  • N Guillotin
  • 2000
2 Excerpts

Asymptotics of a dynamic random walk in a random scenery II. A functional limit theorem

  • N Guillotin
  • 1999
2 Excerpts

Almost-sure central limit theorem for a Markov model of random walk in dynamical random environment

  • C Boldrighini, R A Minlos, A Pellegrinotti
  • 1997
1 Excerpt