betaFeedback

WorksMathematics

Topological Learning under Sparsity through Huberized Distance Functionals

Abstract

Learning topological structure from sparsely contaminated data requires robust statistical methods, as even a small fraction of atypical observations can substantially distort the inferred topology. This article introduces a robust framework for topological learning through the Huberized Distance-to-Measure, which provides a robust filtration-generating functional for persistent homology. We establish large-sample properties of the proposed functional, and show that the associated filtration induces stable and consistent persistence diagrams. We further derive a maximum bias bound for persistence diagrams in bottleneck distance, thereby providing a quantitative measure of the sparseness associated with topological inference. The practical utility of the methodology thorough testing of statistical hypothesis problem is illustrated for a seven-circle packing configuration under sparse contamination, where it recovers the underlying topological structure. Its applicability to real data is further demonstrated through an analysis of the M-ferritin protein structure, where the method identifies a persistent H2H_2 feature corresponding to the iron-storage cavity.

Introduction

Recovering the geometric and topological structure of data from noisy finite samples is a fundamental problem in modern statistical learning. Traditional nonparametric methods primarily focus on estimating characteristics of the underlying distribution, such as densities or regression functions. In contrast, topological data analysis (TDA) provides a framework for inferring the shape of data from finite samples in metric spaces. Rather than describing data in terms of distributional functionals, TDA characterizes the topology of the support of the underlying distribution; see Carlsson [12] and H. Edelsbrunner and Harer [26]. In notation, let P\mathbb{P} be a probability distribution with compact support SP⊂Rℓ\mathcal{S}_{\mathbb{P}} \subset\mathbb{R}^{\ell} (ℓ≥1\ell\ge1). The shape of SP\mathcal{S}_{\mathbb{P}} can be described through its homology, an algebraic invariant which quantifies topological features such as connected components, loops, and higher-dimensional voids. Since SP\mathcal{S}_{\mathbb{P}} is observed only through a finite sample from P\mathbb{P}, one instead studies these features using persistent homology, a multiscale extension of homology, which tracks how these topological features evolve as the scale parameter changes. The resulting multiscale topological information is summarized by the persistence diagram, a multiset of points in R‾2\overline{\mathbb{R}}^{2}, where each point records the birth and death scales of a topological feature. The construction of persistent homology relies on a filtration, which is a nested family of topological spaces indexed by a scale parameter. Typically, this filtration is generated by the sublevel sets {x:f(x)≤t}t∈R\{x : f(x) \le t\}_{t \in\mathbb{R}} associated with a real-valued function ff defined on the ambient space. Consequently, the resulting persistence diagram is determined by the choice of the filtration-generating function. Statistical properties of persistence diagrams therefore depend on the stability and robustness of the underlying filtration-generating function.

From a statistical perspective, persistence diagrams are estimated from finite samples and are therefore subject to sampling variability, measurement error, and contamination. As these perturbations propagate through the underlying filtration, the reliability of topological inference depends on the stability and robustness of the filtration-generating function.

The Distance-to-Measure and the Challenge of Sparsity

A prominent example of such a filtration-generating function is the distance-to-measure (DTM), introduced by Chazal, Cohen-Steiner, and Mérigot [18] as a stable alternative to distance-to-set functions in the sense of Chazal, Cohen-Steiner, and Lieutier (2006). Since its introduction, DTM has become a cornerstone of topological inference. More precisely, given a probability measure P\mathbb{P} on a metric space, the DTM defines a nonnegative Lipschitz function whose sublevel sets induce a filtration. Under some regularity conditions, the associated persistence diagram recovers the homological structure of the support of P\mathbb{P} while remaining stable under perturbations of P\mathbb{P}. The statistical and computational aspects of DTM-based inference have been extensively studied in Chazal, B. Fasy, et al. [20], Anai et al. [5], and subsequent works. Despite its stability, the empirical DTM remains vulnerable to sparse contamination, where a small fraction of observations lie far from the support of the true distribution. In practice, the empirical DTM at a given point xx is computed from average squared distances to its kk-nearest neighbours. Since these averages are computed without trimming or downweighting extreme distances, even a small fraction of outlying observations within nearest neighbourhoods can substantially bias the estimate. This can distort the underlying filtration, and lead to unreliable topological inference such as loss of genuine homological features or creation of spurious ones. This observation motivates the development of robust distance-based filtration-generating functionals for topological inference.

Related Work

Robust estimation under contamination has been widely studied in statistics. The pioneering work of Huber [36] introduced the contamination model and proposed robust M-estimators based on bounded influence score functions. Subsequent developments by Huber and Ronchetti (2009) and Catoni (2012) provided a comprehensive asymptotic theory and finite-sample bounds for robust estimators under contamination. A guiding principle of robust statistics is that a small number of atypical observations should not substantially change an estimate. Under sparse contamination, classical DTM lacks this bounded-influence property. On the topological side, statistical inference for geometric and topological structure has been extensively studied over the last two decades. Foundational results on homology inference and support recovery were established by Niyogi et al. [44] and Balakrishnan et al. [6]. Statistical inference for persistence diagrams was further developed through confidence sets [28]. Recent advances in the statistical analysis of persistence diagrams and other topological summaries include Divol and Polonik (2019), together with testing procedures for homological structures [41], and methods for identifying significant topological patterns in regression curve [40]. Broader treatments of statistical TDA are given by Wasserman [55].

Despite these developments, robust statistical analysis at the level of the filtration-generating function has received comparatively less attention in TDA. Existing robustness results in TDA primarily focus on the stability of topological summaries once the filtration has been specified. Cohen-Steiner et al. (2005) established the foundational stability theorem for persistence diagrams. For DTM-based methods, Buchet, Chazal, Dey, et al. (2015) studied the stability of DTM-based filtrations under Hausdorff-type perturbations. Statistical methodologies based on persistence summaries and vectorized representations, including persistence landscapes [9], persistence images [2], and kernel methods for persistence diagrams [42, 13], have also received considerable attention; see Ali et al. [4] for a recent survey. Phillips et al. [47] studied the kernel-based topological inference under contamination, while Adler et al. [3] investigated the homological structure generated by noise. Bobrowski, Kahle, and Skraba [7] analyzed random Cech complexes under uncontaminated sampling. More recently, a few robust methodologies for topological inference have been proposed; see, for example, Vishwanath et al. [54], Zhang et al. [56], and Mahato and Dhar [43]. Bobrowski and Skraba [8] addressed outlier sensitivity through cluster persistence in weighted graphs. To the best of our knowledge, robustness is typically addressed either at the level of the persistence diagram or through geometric stability arguments after the filtration has been constructed. But something that seems to have received either very little or almost no attention in the existing literature is a systematic study of sparse contamination at the level of the filtration-generating function itself, together with its statistical and topological consequences.

To address sparse contamination, we propose a robust framework for filtration-based topological inference. The main idea is to generalize the classical DTM by replacing its quadratic distance aggregation with a Huber-type robust M-estimator. The resulting construction is referred to as the Huberized Distance-to-Measure (Huberized DTM), defines a distance-based filtration whose sublevel sets are suitable for persistent homology. This proposed framework induces a robustness-efficiency tradeoff through a tuning parameter, with the classical DTM is found as a limiting case.

Objectives and Contributions

The objective of this work is to develop a robust framework for topological inference in presence of sparse contamination. Instead of treating persistence diagrams as the primary inferential objects, we focus on robust estimation of the underlying filtration-generating function from which persistent homology is constructed. Since persistence diagrams inherit their geometric and statistical properties from the underlying filtration, stability theorems translate perturbations of the filtration function into perturbations of the associated persistence diagrams. Thus, statistical consistency and robustness of the filtration function carry over to the persistence diagrams through the stability theory of persistent homology. Robust estimation of the filtration function thus constitutes the key to robust topological inference under contamination. The proposed approach therefore addresses the effect of sparse contamination at the level of the distance functional, before it propagates to the topological summary.

The contributions of this work are as follows. First, we formulate topological inference under sparse contamination as a problem of robust estimation of distance functionals that generate filtrations. This formulation places robustness at the level of filtration function from which persistent homology is constructed. Second, we introduce the Huberized DTM, a robust distance functional obtained by incorporating the Huber loss into the DTM construction. The resulting estimator has bounded influence, which attenuates the effect of sparse contamination while preserving the multiscale geometric structure underlying persistent homology. We further establish that the Huberized DTM is well-defined and Lipschitz continuous on the metric space (M,d)(\mathcal{M},d), providing the regularity required for the induced filtration and its subsequent topological analysis. Third, we establish uniform consistency of the empirical Huberized DTM over the ambient space M\mathcal{M}, and show that this consistency carries over to the induced persistence diagrams in bottleneck distance. Together these results ensure reliable topological inference from finite samples. We also study robustness under Huber’s contamination model through maximum bias analysis. The maximum bias of the Huberized DTM is of order O(α1−α)O\left(\frac{\alpha}{1-\alpha}\right) in the contamination proportion α∈(0,12)\alpha\in\left(0,\frac{1}{2}\right), uniformly over all contaminating distributions. For the induced persistence diagrams, the maximum bias in bottleneck distance consists of a functional component, inherited from the Huberized DTM and a geometric component arising from the perturbation of the contaminated support relative to the signal support. Under a geometric sparsity condition on the contamination, both components are of order O(α1−α)O\left(\frac{\alpha}{1-\alpha}\right). These results provide a rigorous quantitative understanding of how sparse contamination affects both the filtration function and the resulting topological summaries.

As a part of our contributions, we analyze a molecular data to demonstrate the practical utility of the proposed Huberized DTM framework. In the course of this study, it is observe that the proposed framework isolates the biologically meaningful iron-storage cavity as a dominant H2H_2 feature. For details, see § 7.

Challenges

Robust topological inference under sparse contamination involves several interconnected statistical, geometric, and topological challenges. A key statistical challenge is to establish uniform convergence of the filtration-generating distance functional over the entire metric space M\mathcal{M}, as pointwise convergence does not ensure a reliable approximation of the induced filtration for topological inference. For the Huberized DTM, this analysis requires a function class indexed jointly by the evaluation point x∈Mx \in\mathcal{M} and its associated robust parameter θ∈R\theta\in\mathbb{R} within the Huber estimating equation (see, § 3.2), while accounting for the quantile-based trimming inherent in the DTM construction. Additionally, the distance functional must satisfy the regularity conditions needed for the induced filtration to be well defined and amenable to topological analysis. On the geometric side, contamination may change the support on which the filtration is constructed. As a result, its effect on the persistence diagrams arises through both the perturbations of the distance functional as well as the perturbations of the support. Addressing these challenges requires combining ideas from robust statistics, empirical-process theory, and metric geometry with the stability theory of persistence diagrams [21]. From a computational perspective, persistent homology becomes challenging as sample size (denoted by nn) increase. Storing the pairwise distance matrix requires O(n2)O(n^2) memory, while computing the kk-the homology group HkH_k requires constructing simplices up to dimension (k+1)(k+1), whose number increases as O(nk+2)O(n^{k+2}). Consequently, both the complex construction and the persistent homology computation become expensive as the sample size nn and/or homology dimension kk increases.

Organization

The remainder of the article is organized as follows. § 2 introduces the distance-to-measure framework, the contamination model, and the standing assumptions. § 3 presents the proposed Huberized DTM framework and the associated filtration for topological inference. The large-sample properties of the proposed Huberized DTM including statistical consistency and the corresponding stability and consistency results for the associated persistence diagrams are established in § 4. § 5 studies the robustness of the proposed Huberized DTM under sparse contamination, including maximum bias bounds and topological robustness of the associated persistence diagrams. The finite-sample performance of the proposed method is evaluated through simulation studies in § 6, while § 7 illustrates the practical relevance of our approach by applying it to a real-world dataset related to cellular biology. § 8 concludes with a discussion of the main findings, limitations, and directions for future research. Technical proofs together with some standing notation and definitions are provided in Appendix.

Notation

We summarize the notation used throughout the article. (M,d)(\mathcal{M},d) denotes a compact metric space, and P(M)\mathcal{P}(\mathcal{M}) denotes the collection of Borel probability measures on M\mathcal{M}. For P∈P(M)\mathbb{P} \in\mathcal{P}(\mathcal{M}), we write S\mathcal{S} for its support. For any nonempty set A⊆M\mathcal{A} \subseteq\mathcal{M}, its diameter is defined by diam⁡(A):=sup⁡x,y∈Ad(x,y)\operatorname{diam}(\mathcal{A}) := \sup_{x,y \in\mathcal{A}} d(x,y). For x∈Mx \in\mathcal{M} and ε>0\varepsilon> 0, Bε(x):={y∈M:d(x,y)<ε}B_{\varepsilon}(x) := \{y \in\mathcal{M} : d(x,y) < \varepsilon\} denotes the open ball of radius ε\varepsilon centered at xx, and 1A\mathbb{1}_{\mathcal{A}} denotes the indicator function of a measurable set A\mathcal{A}. For two sets, A,B⊆MA,B \subseteq\mathcal{M}, their symmetric difference is denoted by A△B:=(A∩Bc)∪(Ac∩B)A \triangle B := (A \cap B^{c}) \cup(A^{c} \cap B). For a real-valued function f:M→Rf : \mathcal{M} \to\mathbb{R}, its supremum norm is defined by ∥f∥∞:=sup⁡x∈M∣f(x)∣\|f\|_{\infty} := \sup_{x \in\mathcal{M}} |f(x)|. The notation C1(R)C^{1}(\mathbb{R}) denotes the class of continuously differentiable real-valued functions on R\mathbb{R}. For two sequences {an}n≥1\{a_n\}_{n \ge1} and {bn}n≥1\{b_n\}_{n \ge1}, we write an=O(bn)a_n = O(b_n) if there exists constant R>0R > 0 such that ∣anbn∣<R\left|\frac{a_n}{b_n}\right| < R, for all n≥N0(R)∈Nn \ge N_0(R) \in\mathbb{N}. For a sequence of random variables {Xn}n≥1\{X_n\}_{n \ge1} and and a random variable XX, Xn→PXX_n \xrightarrow{P} X denotes convergence in probability; that is, for every ε>0\varepsilon> 0, Pr⁡(d(Xn,X)>ε)→0\operatorname{Pr}(d(X_n, X) > \varepsilon) \to0 as n→∞n \to\infty. Furthermore, for a sequence of positive constants {an}n≥1\{a_n\}_{n \ge1}, Xn=OP(an)X_n = O_P(a_n) indicates that for every ε>0\varepsilon> 0, there exist constants Rε>0R_\varepsilon> 0 and Nε∈NN_\varepsilon\in\mathbb{N} such that Pr⁡(∣Xnan∣≥Rε)<ε\operatorname{Pr}\left(\left|\frac{X_n}{a_n}\right| \ge R_\varepsilon\right) < \varepsilon for all n≥Nεn \ge N_\varepsilon. For X∼PX \sim\mathbb{P} and x∈Mx \in\mathcal{M}, let Sx(X):=[d(x,X)]2S_x(X) := [d(x, X)]^2, with distribution function FxF_x and quantile function Fx−1F_x^{-1}. The mass parameter is denoted by m∈(0,1)m \in(0, 1). Under Huber’s contamination model, Ps\mathbb{P}_s, Pc\mathbb{P}_c, and Pα=(1−α)Ps+αPc\mathbb{P}_\alpha= (1-\alpha)\mathbb{P}_s + \alpha\mathbb{P}_c denote the signal, contaminating, and contaminated distributions, respectively, where α∈[0,1/2)\alpha\in[0, 1/2) is the contamination proportion. The persistence diagram in homological dimension pp is denoted by Dgm⁡p(⋅)\operatorname{Dgm}_p(\cdot), and dBd_B denotes the bottleneck distance between persistence diagrams.

Mathematical Framework and Preliminaries

This section introduces the mathematical framework for robust topological learning under sparse contamination through distance functionals. The metric and probabilistic framework is described in § 2.1, followed by filtrations and persistent homology in § 2.2. § 2.3 introduces the population distance-to-measure. The sampling and contamination model is described in § 2.4, while the empirical distance-to-measure construction in § 2.5.

Metric and Probabilistic Framework

Let M⊂Rℓ\mathcal{M} \subset\mathbb{R}^{\ell} (ℓ≥1\ell\ge1) be a compact metric space equipped with a distance function d:M×M→[0,∞)d : \mathcal{M} \times\mathcal{M} \to[0, \infty), and let its diameter be diam⁡(M)=sup⁡x,y∈Md(x,y):=D<∞\operatorname{diam}(\mathcal{M}) = \sup_{x,y \in\mathcal{M}} d(x,y) := D < \infty. For a Borel probability measure P\mathbb{P} on M\mathcal{M}, let Bε(x):={y∈M:d(x,y)<ε}B_\varepsilon(x) := \{y \in\mathcal{M} : d(x,y) < \varepsilon\} denotes the open ball of radius ε\varepsilon centered at xx, and let SP={x∈M:P(Bε(x))>0, for all ε>0}S_{\mathbb{P}} = \{x \in\mathcal{M} : \mathbb{P}(B_\varepsilon(x)) > 0,\ \text{for all } \varepsilon> 0\} denote the support of P\mathbb{P}. To ensure geometric regularity of the support and to facilitate stable topological inference, we restrict attention to the probability measures satisfying the following condition.

(a,b)(a,b)-standard measure: A Borel probability measure P\mathbb{P} on M\mathcal{M} is said to be an (a,b)(a,b)-standard measure, and belongs to the class Pa,b(M)\mathcal{P}_{a,b}(\mathcal{M}), if there exist constants a,b>0a, b > 0, and ε0∈(0,1)\varepsilon_0 \in(0, 1), such that for all x∈SPx \in S_{\mathbb{P}} and for all 0<ε<ε00 < \varepsilon< \varepsilon_0,

P(Bε(x))≥min⁡(1,aεb).(1)\mathbb{P}(B_\varepsilon(x)) \ge\min(1, a\varepsilon^b). \tag*{(1)}

It is further assumed that SPS_{\mathbb{P}} is compact and has positive reach in the sense of Federer [29] (details on reach are provided in Appendix). This condition ensures that SPS_{\mathbb{P}} is geometrically well behaved for topological inference by precluding self-intersections and sharp cusps.

Moreover, the uniform lower mass-bound condition imposed by assumption (A2) prevents the probability measure from being arbitrarily sparse on its support. It underlies uniform convergence in support estimation and the stability of topological descriptors, including those arising in persistent homology. Such assumptions are standard in nonparametric support estimation and geometric inference. See, for instance, the works of Tsybakov (1997), Cuevas et al. (2007), Genovese et al. (2012), Chazal, Cohen-Steiner, and Mérigot (2011), Aamari et al. (2019).

The construction of both the classical DTM and the proposed Huberized DTM are based on the quantiles of the distance distribution. Accordingly, for x∈Mx \in\mathcal{M}, P∈Pa,b(M)\mathbb{P} \in\mathcal{P}_{a,b}(\mathcal{M}) and m∈(0,1)m \in(0,1), define the mm-th quantile of P\mathbb{P} as

qm(x):=qP,m(x)=inf⁡{ε≥0:P(Bε(x))≥m}.(2)q_m(x) := q_{\mathbb{P},m}(x) = \inf\left\{\varepsilon\ge0 : \mathbb{P}(B_{\varepsilon}(x)) \ge m\right\}. \tag*{(2)}

References

  1. [2]Adams, H., Emerson, T., Kirby, M., Neville, R., Peterson, C., Shipman, P., Chepushtanova, S., Hanson, E., Motta, F., & Ziegelemeier, L. (2017). Persistence images: A stable vector representation of persistent homology. J. Mach. Learn. Res., 18, Paper No. 8, 35.
  2. [3]Adler, R. J., Bobrowski, O., & Weinberger, S. (2014). Crackle: The homology of noise. Discrete & Computational Geometry, 52(4), 680–704.arxiv.org/abs/1301.1466
  3. [4]Ali, D., Asaad, A., Jimenez, M.-J., Nanda, V., Paluzo-Hidalgo, E., & Soriano-Trigueros, M. (2023). A survey of vectorization methods in topological data analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 45(12), 14069–14080.DOI
  4. [5]Anai, H., Chazal, F., Glisse, M., Ike, Y., Inakoshi, H., Tinarrage, R., & Umeda, Y. (2019). DTM-based filtrations. In 35th International Symposium on Computational Geometry (Art. No. 58, 15, Vol. 129). Schloss Dagstuhl. Leibniz-Zent. Inform., Wad ern.DOI
  5. [6]Balakrishnan, S., Rinaldo, A., Sheehy, D., Singh, A., & Wasserman, L. (2012). Minimax rates for homology inference. Artificial Intelligence and Statistics, 64–72.arxiv.org/abs/1112.5627
  6. [7]Bobrowski, O., Kahle, M., & Skraba, P. (2017). Maximally persistent cycles in random geometric complexes. Ann. Appl. Probab., 27(4), 2032–2060.arxiv.org/abs/1509.04347
  7. [8]Bobrowski, O., & Skraba, P. (2023). Cluster persistence for weighted graphs. Entropy, 25(12), 1587.arxiv.org/abs/2310.00350
  8. [9]Bubenik, P. (2015). Statistical topological data analysis using persistence landscapes. J. Mach. Learn. Res., 16, 77–102.
  9. [12]Carlsson, G. (2009). Topology and data. Bull. Amer. Math. Soc. (N.S.), 46(2), 255–308.
  10. [13]Carriere, M., Cuturi, M., & Oudot, S. (2017). Sliced wasserstein kernel for persistence diagrams. International conference on machine learning, 664–673.arxiv.org/abs/1706.03358
  11. [15]Chasteen, N. D., & Harrison, P. M. (1999). Mineralization in ferritin: An efficient means of iron storage. Journal of structural biology, 126(3), 182–194.pubmed.ncbi.nlm.nih.gov/10441528
  12. [16]Chazal, F., Cohen-Steiner, D., Glisse, M., Guibas, L., & Oudot, S. Y. (2009). Proximity of persistence modules and their diagrams. SoCG 2009-25th Annual Symposium on Computational Geometry, 237–246.DOI
  13. [18]Chazal, F., Cohen-Steiner, D., & Mérigot, Q. (2011). Geometric inference for probability measures. Foundations of Computational Mathematics, 11, 733–751.
  14. [20]Chazal, F., Fasy, B., Lecci, F., Michel, B., Rinaldo, A., & Wasserman, L. (2017). Robust topological inference: Distance to a measure and kernel distance. J. Mach. Learn. Res., 18, Paper No. 159, 40.
  15. [21]Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2005). Stability of persistence diagrams. In Computational geometry (SCG’05) (pp. 263–271). ACM, New York.
  16. [22]Conway, J. H., & Sloane, N. J. A. (1999). Sphere packings, lattices and groups (Third, Vol. 290) [With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov]. Springer-Verlag, New York.
  17. [24]Dhar, S. S., Dassios, A., & Bergsma, W. (2016). A study of the power and robustness of a new test for independence against contiguous alternatives. Electron. J. Stat., 10(1), 330–351.DOI
  18. [26]Edelsbrunner, H., & Harer, J. L. (2010). Computational topology [An introduction]. American Mathematical Society, Providence, RI.
  19. [28]Fasy, B. T., Lecci, F., Rinaldo, A., Wasserman, L., Balakrishnan, S., & Singh, A. (2014). Confidence sets for persistence diagrams. Ann. Statist., 42(6), 2301–2339.DOI
  20. [29]Federer, H. (1959). Curvature measures. Trans. Amer. Math. Soc., 93, 418–491.DOI
  21. [30]Folland, G. B. (1999). Real analysis (Second) [Modern techniques and their applications, A Wiley-Interscience Publication]. John Wiley & Sons, Inc., New York.
  22. [32]Gibson, M. C., Patel, A. B., Nagpal, R., & Perrimon, N. (2006). The emergence of geometric order in proliferating metazoan epithelia. Nature, 442(7106), 1038–1041.pubmed.ncbi.nlm.nih.gov/16900102
  23. [33]Gonzalez, T. F. (1985). Clustering to minimize the maximum intercluster distance. Theoretical computer science, 38, 293–306.
  24. [35]Hampel, F. R., Ronchetti, E. M., Rousseeuw, P. J., & Stahel, W. A. (2005). Robust statistics: The approach based on influence functions. John Wiley & Sons.
  25. [36]Huber, P. J. (1964). Robust estimation of a location parameter. Ann. Math. Statist., 35, 73–101.
  26. [37]Huber, P. J. (1981). Robust statistics. John Wiley & Sons, Inc., New York.
  27. [39]Kosorok, M. R. (2008). Introduction to empirical processes and semiparametric inference. Springer, New York.
  28. [40]Kumar, S., & Dhar, S. S. (2026a). A novel characterization of structures in smooth regression curves: From a viewpoint of persistent homology. Electron. J. Stat., 20(1), 2171–2210.DOI
  29. [41]Kumar, S., & Dhar, S. S. (2026b). Testing homological equivalence using betti numbers. SIAM: Theory of Probability and Its Applications, 71(3), 583–604.
  30. [42]Kusano, G., Hiraoka, Y., & Fukumizu, K. (2016). Persistence weighted gaussian kernel for topological data analysis. International conference on machine learning, 2004–2013.arxiv.org/abs/1601.01741
  31. [43]Mahato, T. S., & Dhar, S. S. (2026). A robust persistent homology : Trimming approach. https://arxiv.org/abs/2512.24222
  32. [44]Niyogi, P., Smale, S., & Weinberger, S. (2008). Finding the homology of submanifolds with high confidence from random samples. Discrete & Computational Geometry, 39, 419–441.
  33. [45]Oudot, S. Y. [Steve Y]. (2015). Persistence theory: From quiver representations to data analysis (Vol. 209). American Mathematical Society.DOI
  34. [47]Phillips, J. M., Wang, B., & Zheng, Y. (2015). Geometric inference on kernel density estimates. 31st International Symposium on Computational Geometry (SoCG 2015), 857–871.
  35. [49]Rudin, W. (1976). Principles of mathematical analysis (Third). McGraw-Hill Book Co., New York-Auckland-Düsseldorf.
  36. [50]Theil, E. C. (1987). Ferritin: Structure, gene regulation, and cellular function in animals, plants, and microorganisms. Annual review of biochemistry, 56(1), 289–315.pubmed.ncbi.nlm.nih.gov/3304136
  37. [54]Vishwanath, S., Sriperumbudur, B. K., Fukumizu, K., & Kuriki, S. (2022). Robust topological inference in the presence of outliers. arXiv preprint arXiv:2206.01795.
  38. [55]Wasserman, L. (2018). Topological data analysis. Annual Review of Statistics and Its Application, 5(1), 501–532.
  39. [56]Zhang, H., Zhang, K., Ting, K. M., & Zhu, Y. (2023). Towards a persistence diagram that is robust to noise and varied densities. Proceedings of the 40th International Conference on Machine Learning, 202, 41952–41972.

Paper details

vlnc:W_2prryhjr
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 7

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

AI

View statement
Looking for related papers…
Contents