IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v20y2007i4d10.1007_s10959-007-0089-7.html
   My bibliography  Save this article

Rates of Convergence of Means of Euclidean Functionals

Author

Listed:
  • Yooyoung Koo

    (Sungkyunkwan University)

  • Sungchul Lee

    (Yonsei University)

Abstract

Let L be the Euclidean functional with p-th power-weighted edges. Examples include the sum of the p-th power-weighted lengths of the edges in minimal spanning trees, traveling salesman tours, and minimal matchings. Motivated by the works of Steele, Redmond and Yukich (Ann. Appl. Probab. 4, 1057–1073, 1994, Stoch. Process. Appl. 61, 289–304, 1996) have shown that for n i.i.d. sample points {X 1,…,X n } from [0,1] d , L({X 1,…,X n })/n (d−p)/d converges a.s. to a finite constant. Here we bound the rate of convergence of EL({X 1,…,X n })/n (d−p)/d .

Suggested Citation

  • Yooyoung Koo & Sungchul Lee, 2007. "Rates of Convergence of Means of Euclidean Functionals," Journal of Theoretical Probability, Springer, vol. 20(4), pages 821-841, December.
    • Handle: RePEc:spr:jotpro:v:20:y:2007:i:4:d:10.1007_s10959-007-0089-7
    DOI: 10.1007/s10959-007-0089-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10959-007-0089-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10959-007-0089-7?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.

    References listed on IDEAS

    as
    1. Redmond, C. & Yukich, J. E., 1996. "Asymptotics for Euclidean functionals with power-weighted edges," Stochastic Processes and their Applications, Elsevier, vol. 61(2), pages 289-304, February.
    2. Lee, Sungchul, 1999. "Asymptotics of power-weighted Euclidean functionals," Stochastic Processes and their Applications, Elsevier, vol. 79(1), pages 109-116, January.
    3. Lee, Sungchul, 2000. "Rate of convergence of power-weighted Euclidean minimal spanning trees," Stochastic Processes and their Applications, Elsevier, vol. 86(1), pages 163-176, March.
    4. J. Michael Steele, 1981. "Complete Convergence of Short Paths and Karp's Algorithm for the TSP," Mathematics of Operations Research, INFORMS, vol. 6(3), pages 374-378, August.
    5. J. Michael Steele, 1990. "Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space," Mathematics of Operations Research, INFORMS, vol. 15(4), pages 749-770, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lee, Sungchul, 2000. "Rate of convergence of power-weighted Euclidean minimal spanning trees," Stochastic Processes and their Applications, Elsevier, vol. 86(1), pages 163-176, March.
    2. Yukich, J. E., 2000. "Asymptotics for weighted minimal spanning trees on random points," Stochastic Processes and their Applications, Elsevier, vol. 85(1), pages 123-138, January.
    3. Anna Franceschetti & Ola Jabali & Gilbert Laporte, 2017. "Continuous approximation models in freight distribution management," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 413-433, October.
    4. Ansari, Sina & Başdere, Mehmet & Li, Xiaopeng & Ouyang, Yanfeng & Smilowitz, Karen, 2018. "Advancements in continuous approximation models for logistics and transportation systems: 1996–2016," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 229-252.
    5. Lee, Sungchul, 1999. "Asymptotics of power-weighted Euclidean functionals," Stochastic Processes and their Applications, Elsevier, vol. 79(1), pages 109-116, January.
    6. McGivney, K. & Yukich, J. E., 1999. "Asymptotics for Voronoi tessellations on random samples," Stochastic Processes and their Applications, Elsevier, vol. 83(2), pages 273-288, October.
    7. Leonenko, Nikolaj & Seleznjev, Oleg, 2010. "Statistical inference for the [epsilon]-entropy and the quadratic Rényi entropy," Journal of Multivariate Analysis, Elsevier, vol. 101(9), pages 1981-1994, October.
    8. Ahmadi, Reza H. & Mamer, John W., 1999. "Routing heuristics for automated pick and place machines," European Journal of Operational Research, Elsevier, vol. 117(3), pages 533-552, September.

    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:spr:jotpro:v:20:y:2007:i:4:d:10.1007_s10959-007-0089-7. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.