IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v34y2017i3d10.1007_s00357-017-9236-8.html
   My bibliography  Save this article

On the Ultrametric Generated by Random Distribution of Points in Euclidean Spaces of Large Dimensions with Correlated Coordinates

Author

Listed:
  • A. P. Zubarev

    (Samara State University of Railway Transport
    Samara University)

Abstract

Recently a general theorem stating that the matrix of normalized Euclidean distances on the set of specially distributed random points in the n-dimensional Euclidean space ℝ n with independent coordinates converges in probability as n→∞ to the ultrametric matrix had been proved. The main theorem of the present paper extends this result to the case of weakly correlated coordinates of random points. Prior to formulating and stating this result we give two illustrative examples describing particular algorithms of generation of such nearly ultrametric spaces.

Suggested Citation

  • A. P. Zubarev, 2017. "On the Ultrametric Generated by Random Distribution of Points in Euclidean Spaces of Large Dimensions with Correlated Coordinates," Journal of Classification, Springer;The Classification Society, vol. 34(3), pages 366-383, October.
    • Handle: RePEc:spr:jclass:v:34:y:2017:i:3:d:10.1007_s00357-017-9236-8
    DOI: 10.1007/s00357-017-9236-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-017-9236-8
    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/s00357-017-9236-8?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. Peter Hall & J. S. Marron & Amnon Neeman, 2005. "Geometric representation of high dimension, low sample size data," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 67(3), pages 427-444, June.
    2. Fionn Murtagh, 2004. "On Ultrametricity, Data Coding, and Computation," Journal of Classification, Springer;The Classification Society, vol. 21(2), pages 167-184, September.
    3. F. Murtagh, 2005. "Identifying the ultrametricity of time series," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 43(4), pages 573-579, February.
    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. Fionn Murtagh, 2009. "The Remarkable Simplicity of Very High Dimensional Data: Application of Model-Based Clustering," Journal of Classification, Springer;The Classification Society, vol. 26(3), pages 249-277, December.
    2. Fionn Murtagh, 2007. "Multiple correspondence analysis and related methods," Psychometrika, Springer;The Psychometric Society, vol. 72(2), pages 275-277, June.
    3. Yata, Kazuyoshi & Aoshima, Makoto, 2013. "PCA consistency for the power spiked model in high-dimensional settings," Journal of Multivariate Analysis, Elsevier, vol. 122(C), pages 334-354.
    4. Jung, Sungkyu & Sen, Arusharka & Marron, J.S., 2012. "Boundary behavior in High Dimension, Low Sample Size asymptotics of PCA," Journal of Multivariate Analysis, Elsevier, vol. 109(C), pages 190-203.
    5. Siqi Xiang & Wan Zhang & Kai Zhang & J. S. Marron, 2024. "Extreme Value Theory for Binary Expansion Testing," Sankhya A: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 86(1), pages 327-343, November.
    6. Wang, Shao-Hsuan & Huang, Su-Yun, 2022. "Perturbation theory for cross data matrix-based PCA," Journal of Multivariate Analysis, Elsevier, vol. 190(C).
    7. Patrick Erik Bradley, 2017. "Finding Ultrametricity in Data using Topology," Journal of Classification, Springer;The Classification Society, vol. 34(1), pages 76-84, April.
    8. Kazuyoshi Yata & Makoto Aoshima, 2012. "Inference on High-Dimensional Mean Vectors with Fewer Observations Than the Dimension," Methodology and Computing in Applied Probability, Springer, vol. 14(3), pages 459-476, September.
    9. Saha, Enakshi & Sarkar, Soham & Ghosh, Anil K., 2017. "Some high-dimensional one-sample tests based on functions of interpoint distances," Journal of Multivariate Analysis, Elsevier, vol. 161(C), pages 83-95.
    10. Yugo Nakayama & Kazuyoshi Yata & Makoto Aoshima, 2020. "Bias-corrected support vector machine with Gaussian kernel in high-dimension, low-sample-size settings," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 72(5), pages 1257-1286, October.
    11. Bar, Haim & Wells, Martin T., 2023. "On graphical models and convex geometry," Computational Statistics & Data Analysis, Elsevier, vol. 187(C).
    12. Biswas, Munmun & Ghosh, Anil K., 2014. "A nonparametric two-sample test applicable to high dimensional data," Journal of Multivariate Analysis, Elsevier, vol. 123(C), pages 160-171.
    13. Mao, Guangyu, 2018. "Testing independence in high dimensions using Kendall’s tau," Computational Statistics & Data Analysis, Elsevier, vol. 117(C), pages 128-137.
    14. Matthieu Stigler & Apratim Dey & Andrew Hobbs & David Lobell, 2022. "With big data come big problems: pitfalls in measuring basis risk for crop index insurance," Papers 2209.14611, arXiv.org.
    15. Marron, J.S., 2017. "Big Data in context and robustness against heterogeneity," Econometrics and Statistics, Elsevier, vol. 2(C), pages 73-80.
    16. Shin-ichi Tsukada, 2019. "High dimensional two-sample test based on the inter-point distance," Computational Statistics, Springer, vol. 34(2), pages 599-615, June.
    17. Patrick K. Kimes & Yufeng Liu & David Neil Hayes & James Stephen Marron, 2017. "Statistical significance for hierarchical clustering," Biometrics, The International Biometric Society, vol. 73(3), pages 811-821, September.
    18. Jianqing Fan & Jinchi Lv, 2008. "Sure independence screening for ultrahigh dimensional feature space," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 70(5), pages 849-911, November.
    19. Mao, Guangyu, 2015. "A note on testing complete independence for high dimensional data," Statistics & Probability Letters, Elsevier, vol. 106(C), pages 82-85.
    20. Borysov, Petro & Hannig, Jan & Marron, J.S., 2014. "Asymptotics of hierarchical clustering for growing dimension," Journal of Multivariate Analysis, Elsevier, vol. 124(C), pages 465-479.

    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:jclass:v:34:y:2017:i:3:d:10.1007_s00357-017-9236-8. 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.