Abstract
Motivated by Murtagh’s experimental observation that sparse random samples of the hypercube become more and more ultrametric as the dimension increases, we consider a strict version of his ultrametricity coefficient, an index derived from Rammal’s degree of ultrametricity, and a topological ultrametricity index. First, we prove that the three ultrametricity indices converge in probability to one as dimension increases, if the sample size remains fixed. This is done for uniformly and normally distributed samples in the Euclidean hypercube, and for uniformly distributed samples in F2 N with Hamming distance, as well as for very general probability distributions. Further, this holds true for random categorial data in complete disjunctive form. A second result is that the ultrametricity indices vanish in the limit for the full hypercube F2 N as dimensionN increases,whereby Murtagh’s ultrametricity index is largest, and the topological ultrametricity index smallest, if N is large.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Benois-Pineau, A. Yu. Khrennikov and N. V. Kotovich, “Segmentation of images in p-adic and Euclidean metrics,” Dokl.Math. 64, 450–455 (2001).
J. P. Benzecri, L’analyse des données: la taxonomie, Vol. 1 (Dunod, Paris, 1980).
P. E. Bradley, “On p-adic classification,” p-Adic Numbers Ultrametric Anal. Appl. 1 (4), 271–285 (2009).
P. E. Bradley, “Mumford dendrograms,” Computer J. 53 (4), 393–404 (2010).
P. E. Bradley, “An ultrametric interpretation of building related event data,” Constr. Manag. Econ. 28 (3), 311–326 (2010).
P. E. Bradley and A. C. Braun, “Finding the asymptotically optimal Baire distance for multi-channel data,” Appl.Math. 6(3), 484–495 (2015).
G. Carlsson, “Topology and data,” Bull. AMS 46 (2), 255–308 (2009).
J. W. Moon and L. Moser, “On cliques in graphs,” Isr._J. Math. 3 (1), 23–28 (1965).
F. Murtagh, “On ultrametricity, data coding, and computation,” J. Class. 21, 167–184 (2004).
F. Murtagh, “The remarkable simplicity of very high dimensional data: application of model-based clustering,” J. Class. 26, 249–277 (2009).
R. Rammal, J. C. Angles d’Auriac and B. Doucot, “On the degree of ultrametricity,” J. Phys. Lett. 46, L-945–L-952 (1985).
C. J. van Rijsbergen, “A clustering algorithm,” Computer J. 13 (1), 113–115 (1970).
L. Vietoris, “Über den höheren Zusammenhang kompakter Räume und eine Klasse von zusammenhangstreuen Abbildungen,” Math. Ann. 97 (1), 454–472 (1927).
A. Zomorodian, “Fast construction of the Vietoris-Rips complex,” Comp. & Graph. 34 (3), 263–271 (2010).
A. P. Zubarev, “On stochastic generation of ultrametrics in high-dimensional Euclidean spaces,” p-Adic Numbers Ultrametric Anal. Appl. 6 (2), 155–165 (2014).
Author information
Authors and Affiliations
Corresponding author
Additional information
The text was submitted by the author in English.
Rights and permissions
About this article
Cite this article
Bradley, P.E. Ultrametricity indices for the Euclidean and Boolean hypercubes. P-Adic Num Ultrametr Anal Appl 8, 298–311 (2016). https://doi.org/10.1134/S2070046616040038
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S2070046616040038