随机四叉树中部分匹配查询的Strong convergence
Strong convergence of partial match queries in random quadtrees
摘要：
我们证明了在随机二维四叉树中部分匹配查询的重标度成本几乎必然收敛于一个随机极限，该极限被确定为鞅的终值。我们的方法与自相似碎裂理论有许多相似之处。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
