Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives

In this paper, we investigate a sheaf-theoretic interpretation of stratification learning from geometric and topological perspectives. Our main result is the construction of stratification learning algorithms framed in terms of a sheaf on a partially ordered set with the Alexandroff topology. We prove that the resulting decomposition is the unique minimal stratification for which the strata are homogeneous and the given sheaf is constructible. In particular, when we choose to work with the local homology sheaf, our algorithm gives an alternative to the local homology transfer algorithm given in Bendich et al. (2012), and the cohomology stratification algorithm given in Nanda (2017). Additionally, we give examples of stratifications based on the geometric techniques of Breiding et al. (2018), illustrating how the sheaf-theoretic approach can be used to study stratifications from both topological and geometric perspectives. This approach also points toward future applications of sheaf theory in the study of topological data analysis by illustrating the utility of the language of sheaf theory in generalizing existing algorithms

Approximating Local Homology from Samples

Recently, multi-scale notions of local homology (a variant of persistent homology) have been used to study the local structure of spaces around a given point from a point cloud sample. Current reconstruction guarantees rely on constructing embedded complexes which become difficult in high dimensions. We show that the persistence diagrams used for estimating local homology, can be approximated using families of Vietoris-Rips complexes, whose simple constructions are robust in any dimension. To the best of our knowledge, our results, for the first time, make applications based on local homology, such as stratification learning, feasible in high dimensions.Comment: 23 pages, 14 figure

Convergence between Categorical Representations of Reeb Space and Mapper

The Reeb space, which generalizes the notion of a Reeb graph, is one of the few tools in topological data analysis and visualization suitable for the study of multivariate scientific datasets. First introduced by Edelsbrunner et al., it compresses the components of the level sets of a multivariate mapping and obtains a summary representation of their relationships. A related construction called mapper, and a special case of the mapper construction called the Joint Contour Net have been shown to be effective in visual analytics. Mapper and JCN are intuitively regarded as discrete approximations of the Reeb space, however without formal proofs or approximation guarantees. An open question has been proposed by Dey et al. as to whether the mapper construction converges to the Reeb space in the limit. In this paper, we are interested in developing the theoretical understanding of the relationship between the Reeb space and its discrete approximations to support its use in practical data analysis. Using tools from category theory, we formally prove the convergence between the Reeb space and mapper in terms of an interleaving distance between their categorical representations. Given a sequence of refined discretizations, we prove that these approximations converge to the Reeb space in the interleaving distance; this also helps to quantify the approximation quality of the discretization at a fixed resolution

Towards Stratification Learning through Homology Inference

A topological approach to stratification learning is developed for point cloud data drawn from a stratified space. Given such data, our objective is to infer which points belong to the same strata. First we define a multi-scale notion of a stratified space, giving a stratification for each radius level. We then use methods derived from kernel and cokernel persistent homology to cluster the data points into different strata, and we prove a result which guarantees the correctness of our clustering, given certain topological conditions; some geometric intuition for these topological conditions is also provided. Our correctness result is then given a probabilistic flavor: we give bounds on the minimum number of sample points required to infer, with probability, which points belong to the same strata. Finally, we give an explicit algorithm for the clustering, prove its correctness, and apply it to some simulated data.Comment: 48 page

L-Tetrahydropalamatine: A Potential New Medication for the Treatment of Cocaine Addiction

Levo-tetrahydropalmatine (l-THP) is an active constituent of herbal preparations containing plant species of the genera Stephania and Corydalis and has been approved and used in China for a number of clinical indications under the drug name Rotundine. The pharmacological profile of l-THP, which includes antagonism of dopamine D1 and D2 receptors and actions at dopamine D3, α adrenergic and serotonin receptors, suggests that it may have utility for treating cocaine addiction. In this review, we provide an overview of the pharmacological properties of l-THP and the evidence supporting its development as an anti-addiction medication. The results of preclinical work demonstrating that l-THP attenuates cocaine’s reinforcing/rewarding effects and reinstatement in rat models of cocaine relapse are summarized, and the outcomes of studies demonstrating efficacy in human addicts are described. Finally, an overview of the safety profile of l-THP is provided and challenges associated with US FDA approval of l-THP are discussed

Characterizing Floquet topological phases by quench dynamics: A multiple-subsystem approach

We investigate the dynamical characterization theory for periodically driven systems in which Floquet topology can be fully detected by emergent topological patterns of quench dynamics in momentum subspaces called band-inversion surfaces. We improve the results of a recent work [Zhang et al., Phys. Rev. Lett. 125, 183001 (2020)] and propose a more flexible scheme to characterize a generic class of $d$-dimensional Floquet topological phases classified by $\mathbb{Z}$-valued invariants by applying a quench along an arbitrary spin-polarization axis. Our basic idea is that by disassembling the Floquet system into multiple static subsystems that are periodic in quasienergy, a full characterization of Floquet topological phases reduces to identifying a series of bulk topological invariants for time-independent Hamiltonians, which greatly enhances the convenience and flexibility of the measurement. We illustrate the scheme by numerically analyzing two experimentally realizable models in two and three dimensions, respectively, and adopting two different but equivalent viewpoints to examine the dynamical characterization. Finally, considering the imperfection of experiment, we demonstrate that the present scheme can also be applied to a general situation where the initial state is not completely polarized. This study provides an immediately implementable approach for dynamically classifying Floquet topological phases in ultracold atoms or other quantum simulators.Comment: 15 pages, 8 figures, to appear in PR

Geometric Inference on Kernel Density Estimates

We show that geometric inference of a point cloud can be calculated by examining its kernel density estimate with a Gaussian kernel. This allows one to consider kernel density estimates, which are robust to spatial noise, subsampling, and approximate computation in comparison to raw point sets. This is achieved by examining the sublevel sets of the kernel distance, which isomorphically map to superlevel sets of the kernel density estimate. We prove new properties about the kernel distance, demonstrating stability results and allowing it to inherit reconstruction results from recent advances in distance-based topological reconstruction. Moreover, we provide an algorithm to estimate its topology using weighted Vietoris-Rips complexes.Comment: To appear in SoCG 2015. 36 pages, 5 figure

Visual Detection of Structural Changes in Time-Varying Graphs Using Persistent Homology

Topological data analysis is an emerging area in exploratory data analysis and data mining. Its main tool, persistent homology, has become a popular technique to study the structure of complex, high-dimensional data. In this paper, we propose a novel method using persistent homology to quantify structural changes in time-varying graphs. Specifically, we transform each instance of the time-varying graph into metric spaces, extract topological features using persistent homology, and compare those features over time. We provide a visualization that assists in time-varying graph exploration and helps to identify patterns of behavior within the data. To validate our approach, we conduct several case studies on real world data sets and show how our method can find cyclic patterns, deviations from those patterns, and one-time events in time-varying graphs. We also examine whether persistence-based similarity measure as a graph metric satisfies a set of well-established, desirable properties for graph metrics