Partial Match Queries in Two-Dimensional Quadtrees : a Probabilistic Approach
Probability
2010-09-17 v1
Abstract
We analyze the mean cost of the partial match queries in random two-dimensional quadtrees. The method is based on fragmentation theory. The convergence is guaranteed by a coupling argument of Markov chains, whereas the value of the limit is computed as the fixed point of an integral equation.
Keywords
Cite
@article{arxiv.1009.3113,
title = {Partial Match Queries in Two-Dimensional Quadtrees : a Probabilistic Approach},
author = {Nicolas Curien and Adrien Joseph},
journal= {arXiv preprint arXiv:1009.3113},
year = {2010}
}