Partial Match Queries in Two-Dimensional Quadtrees : a Probabilistic Approach
classification
🧮 math.PR
keywords
matchpartialquadtreesqueriestwo-dimensionalanalyzeapproachargument
read the original 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.
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.