Generalized cluster trees and singular measures

In this paper we study the .-cluster tree (.-tree) under both singular and nonsingular measures. The .-tree uses probability contents within a set created by the ordering of points to construct a cluster tree so that it is well defined even for singular measures. We first derive the convergence rate for a density level set around critical points, which leads to the convergence rate for estimating an .-tree under nonsingular measures. For singular measures, we study how the kernel density estimator (KDE) behaves and prove that the KDE is not uniformly consistent but pointwise consistent after rescaling. We further prove that the estimated .-tree fails to converge in the L. metric but is still consistent under the integrated distance. We also observe a new type of critical points.the dimensional critical points (DCPs).of a singular measure. DCPs are points that contribute to cluster tree topology but cannot be defined using density gradient. Building on the analysis of the KDE and DCPs, we prove the topological consistency of an estimated .-tree.