IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v129y2019i8p2912-2940.html
   My bibliography  Save this article

A limit field for orthogonal range searches in two-dimensional random point search trees

Author

Listed:
  • Broutin, Nicolas
  • Sulzbach, Henning

Abstract

We consider the cost of general orthogonal range queries in random quadtrees. The cost of a given query is encoded into a (random) function of four variables which characterize the coordinates of two opposite corners of the query rectangle. We prove that, when suitably shifted and rescaled, the random cost function converges uniformly in probability towards a random field that is characterized as the unique solution to a distributional fixed-point equation. We also state similar results for 2-d trees. Our results imply for instance that the worst case query satisfies the same asymptotic estimates as a typical query, and thereby resolve an open question of Chanzy et al. (2001).

Suggested Citation

  • Broutin, Nicolas & Sulzbach, Henning, 2019. "A limit field for orthogonal range searches in two-dimensional random point search trees," Stochastic Processes and their Applications, Elsevier, vol. 129(8), pages 2912-2940.
    • Handle: RePEc:eee:spapps:v:129:y:2019:i:8:p:2912-2940
    DOI: 10.1016/j.spa.2018.08.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S030441491830454X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spa.2018.08.014?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:129:y:2019:i:8:p:2912-2940. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.