A Flexible Approach for Normal Approximation of Geometric and Topological Statistics
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the add-one cost operator, which helps one to deal with the second-order cost operator via suitably appropriate first-order operators. We combine this flexible notion with the theory of strong stabilization to establish our results. We illustrate the applicability of our results by establishing normal approximation results for certain geometric and topological statistics arising frequently in practice. Several existing results also emerge as special cases of our approach.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Flexible Mesh Segmentation via Reeb Graph Representation of Geometrical and Topological Features
This paper presents a new mesh segmentation method that integrates geometrical and topological features through a flexible Reeb graph representation. The algorithm consists of three phases: construction of the Reeb graph…
Computational EfficiencySegmentationMerging Hazy Sets with m-Schemes: A Geometric Approach to Data Visualization
Many machine learning algorithms try to visualize high dimensional metric data in 2D in such a way that the essential geometric and topological features of the data are highlighted. In this paper, we introduce a framewor…
Data VisualizationEfficient Learning of Quadratic Variance Function Directed Acyclic Graphs via Topological Layers
Directed acyclic graph (DAG) models are widely used to represent causal relationships among random variables in many application domains. This paper studies a special class of non-Gaussian DAG models, where the condition…
TopoFisher: Learning Topological Summary Statistics by Maximizing Fisher Information
Persistence diagrams provide stable, interpretable summaries of geometric and topological structure and are useful for simulation-based inference when low-order statistics miss key information. Yet persistence-based pipe…
Permutation-Free High-Order Interaction Tests
Kernel-based hypothesis tests offer a flexible, non-parametric tool to detect high-order interactions in multivariate data, beyond pairwise relationships. Yet the scalability of such tests is limited by the computational…
Causal Discoveryfeature selection