Strong convergence of partial match queries in random quadtrees
classification
🧮 math.PR
cs.DS
keywords
randommatchpartialqueriesalmostapproachconvergeconvergence
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.