2000 character limit reached
Strong convergence of partial match queries in random quadtrees
Published 26 Sep 2011 in math.PR and cs.DS | (1109.5579v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.