16,130 research outputs found
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
Parallel Mapper
The construction of Mapper has emerged in the last decade as a powerful and
effective topological data analysis tool that approximates and generalizes
other topological summaries, such as the Reeb graph, the contour tree, split,
and joint trees. In this paper, we study the parallel analysis of the
construction of Mapper. We give a provably correct parallel algorithm to
execute Mapper on multiple processors and discuss the performance results that
compare our approach to a reference sequential Mapper implementation. We report
the performance experiments that demonstrate the efficiency of our method
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
Persistent Homology Guided Force-Directed Graph Layouts
Graphs are commonly used to encode relationships among entities, yet their
abstractness makes them difficult to analyze. Node-link diagrams are popular
for drawing graphs, and force-directed layouts provide a flexible method for
node arrangements that use local relationships in an attempt to reveal the
global shape of the graph. However, clutter and overlap of unrelated structures
can lead to confusing graph visualizations. This paper leverages the persistent
homology features of an undirected graph as derived information for interactive
manipulation of force-directed layouts. We first discuss how to efficiently
extract 0-dimensional persistent homology features from both weighted and
unweighted undirected graphs. We then introduce the interactive persistence
barcode used to manipulate the force-directed graph layout. In particular, the
user adds and removes contracting and repulsing forces generated by the
persistent homology features, eventually selecting the set of persistent
homology features that most improve the layout. Finally, we demonstrate the
utility of our approach across a variety of synthetic and real datasets
The G protein-coupled receptor heterodimer network (GPCR-HetNet) and its hub components
G protein-coupled receptors (GPCRs) oligomerization has emerged as a vital characteristic of receptor structure. Substantial experimental evidence supports the existence of GPCR-GPCR interactions in a coordinated and cooperative manner. However, despite the current development of experimental techniques for large-scale detection of GPCR heteromers, in order to understand their connectivity it is necessary to develop novel tools to study the global heteroreceptor networks. To provide insight into the overall topology of the GPCR heteromers and identify key players, a collective interaction network was constructed. Experimental interaction data for each of the individual human GPCR protomers was obtained manually from the STRING and SCOPUS databases. The interaction data were used to build and analyze the network using Cytoscape software. The network was treated as undirected throughout the study. It is comprised of 156 nodes, 260 edges and has a scale-free topology. Connectivity analysis reveals a significant dominance of intrafamily versus interfamily connections. Most of the receptors within the network are linked to each other by a small number of edges. DRD2, OPRM, ADRB2, AA2AR, AA1R, OPRK, OPRD and GHSR are identified as hubs. In a network representation 10 modules/clusters also appear as a highly interconnected group of nodes. Information on this GPCR network can improve our understanding of molecular integration. GPCR-HetNet has been implemented in Java and is freely available at http://www.iiia.csic.es/similar to ismel/GPCR-Nets/index.html
- …