Strong Convergence of Partial Match Queries in Random Quadtrees

Nicolas Curien · Combinatorics Probability Computing · 2012

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.

Read the paper · More papers on PaperTik