Strong convergence of partial match queries in random quadtrees
Probability
2011-09-27 v1 Data Structures and Algorithms
Abstract
We prove that the rescaled costs of partial match queries in a random two-dimensional quadtree converge almost surely towards a random limit which is identified as the terminal value of a martingale. Our approach shares many similarities with the theory of self-similar fragmentations.
Cite
@article{arxiv.1109.5579,
title = {Strong convergence of partial match queries in random quadtrees},
author = {Nicolas Curien},
journal= {arXiv preprint arXiv:1109.5579},
year = {2011}
}
Comments
11 pages, 4 figures