254 citations · 259 across the 4 of their papers we have counts for
7 papers · 1 filter
Near-optimal Anomaly Detection in Graphs using Lovasz Extended Scan Statistic
James Sharpnack, Akshay Krishnamurthy, Aarti Singh
The detection of anomalous activity in graphs is a statistical problem that arises in many applications, such as network surveillance, disease outbreak detection, and activity moni…
Detecting Anomalous Activity on Networks with the Graph Fourier Scan Statistic
James Sharpnack, Alessandro Rinaldo, Aarti Singh
We consider the problem of deciding, based on a single noisy measurement at each vertex of a given graph, whether the underlying unknown signal is constant over the graph or there…
On the Bootstrap for Persistence Diagrams and Landscapes
Frédéric Chazal, Brittany Terese Fasy, Fabrizio Lecci +3
Persistent homology probes topological properties from point clouds and functions. By looking at multiple scales simultaneously, one can record the births and deaths of topological…
Tight Lower Bounds for Homology Inference
Sivaraman Balakrishnan, Alessandro Rinaldo, Aarti Singh +1
The homology groups of a manifold are important topological invariants that provide an algebraic summary of the manifold. These groups contain rich topological information, for ins…
Cluster Trees on Manifolds
Sivaraman Balakrishnan, Srivatsan Narayanan, Alessandro Rinaldo +2
In this paper we investigate the problem of estimating the cluster tree for a density supported on or near a smooth -dimensional manifold isometrically embedded in $\mat…
Confidence sets for persistence diagrams
Brittany Terese Fasy, Fabrizio Lecci, Alessandro Rinaldo +3
Persistent homology is a method for probing topological properties of point clouds and functions. The method involves tracking the birth and death of topological features (2000) as…