13,404 research outputs found
Using the Simplex Code to Construct Relative Difference Sets in 2-groups
Relative Difference Sets with the parameters (2a, 2b, 2a, 2a-b) have been constructed many ways (see [2], [3], [5], [6], and [7] for examples). This paper modifies an example found in [1] to construct a family of relative difference sets in 2-groups that gives examples for b = 2 and b = 3 that have a lower rank than previous examples. The Simplex code is used in the construction
Simplicial quantum dynamics
Present-day quantum field theory can be regularized by a decomposition into
quantum simplices. This replaces the infinite-dimensional Hilbert space by a
high-dimensional spinor space and singular canonical Lie groups by regular spin
groups. It radically changes the uncertainty principle for small distances.
Gaugeons, including the gravitational, are represented as bound fermion-pairs,
and space-time curvature as a singular organized limit of quantum
non-commutativity.
Keywords: Quantum logic, quantum set theory, quantum gravity, quantum
topology, simplicial quantization.Comment: 25 pages. 1 table. Conference of the International Association for
Relativistic Dynamics, Taiwan, 201
Topological Data Analysis with Bregman Divergences
Given a finite set in a metric space, the topological analysis generalizes
hierarchical clustering using a 1-parameter family of homology groups to
quantify connectivity in all dimensions. The connectivity is compactly
described by the persistence diagram. One limitation of the current framework
is the reliance on metric distances, whereas in many practical applications
objects are compared by non-metric dissimilarity measures. Examples are the
Kullback-Leibler divergence, which is commonly used for comparing text and
images, and the Itakura-Saito divergence, popular for speech and sound. These
are two members of the broad family of dissimilarities called Bregman
divergences.
We show that the framework of topological data analysis can be extended to
general Bregman divergences, widening the scope of possible applications. In
particular, we prove that appropriately generalized Cech and Delaunay (alpha)
complexes capture the correct homotopy type, namely that of the corresponding
union of Bregman balls. Consequently, their filtrations give the correct
persistence diagram, namely the one generated by the uniformly growing Bregman
balls. Moreover, we show that unlike the metric setting, the filtration of
Vietoris-Rips complexes may fail to approximate the persistence diagram. We
propose algorithms to compute the thus generalized Cech, Vietoris-Rips and
Delaunay complexes and experimentally test their efficiency. Lastly, we explain
their surprisingly good performance by making a connection with discrete Morse
theory
Topological Data Analysis of Task-Based fMRI Data from Experiments on Schizophrenia
We use methods from computational algebraic topology to study functional
brain networks, in which nodes represent brain regions and weighted edges
encode the similarity of fMRI time series from each region. With these tools,
which allow one to characterize topological invariants such as loops in
high-dimensional data, we are able to gain understanding into low-dimensional
structures in networks in a way that complements traditional approaches that
are based on pairwise interactions. In the present paper, we use persistent
homology to analyze networks that we construct from task-based fMRI data from
schizophrenia patients, healthy controls, and healthy siblings of schizophrenia
patients. We thereby explore the persistence of topological structures such as
loops at different scales in these networks. We use persistence landscapes and
persistence images to create output summaries from our persistent-homology
calculations, and we study the persistence landscapes and images using
-means clustering and community detection. Based on our analysis of
persistence landscapes, we find that the members of the sibling cohort have
topological features (specifically, their 1-dimensional loops) that are
distinct from the other two cohorts. From the persistence images, we are able
to distinguish all three subject groups and to determine the brain regions in
the loops (with four or more edges) that allow us to make these distinctions
Topological Schemas of Memory Spaces
Hippocampal cognitive map---a neuronal representation of the spatial
environment---is broadly discussed in the computational neuroscience literature
for decades. More recent studies point out that hippocampus plays a major role
in producing yet another cognitive framework that incorporates not only
spatial, but also nonspatial memories---the memory space. However, unlike
cognitive maps, memory spaces have been barely studied from a theoretical
perspective. Here we propose an approach for modeling hippocampal memory spaces
as an epiphenomenon of neuronal spiking activity. First, we suggest that the
memory space may be viewed as a finite topological space---a hypothesis that
allows treating both spatial and nonspatial aspects of hippocampal function on
equal footing. We then model the topological properties of the memory space to
demonstrate that this concept naturally incorporates the notion of a cognitive
map. Lastly, we suggest a formal description of the memory consolidation
process and point out a connection between the proposed model of the memory
spaces to the so-called Morris' schemas, which emerge as the most compact
representation of the memory structure.Comment: 24 pages, 8 Figures, 1 Suppl. Figur
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
The Topology ToolKit
This system paper presents the Topology ToolKit (TTK), a software platform
designed for topological data analysis in scientific visualization. TTK
provides a unified, generic, efficient, and robust implementation of key
algorithms for the topological analysis of scalar data, including: critical
points, integral lines, persistence diagrams, persistence curves, merge trees,
contour trees, Morse-Smale complexes, fiber surfaces, continuous scatterplots,
Jacobi sets, Reeb spaces, and more. TTK is easily accessible to end users due
to a tight integration with ParaView. It is also easily accessible to
developers through a variety of bindings (Python, VTK/C++) for fast prototyping
or through direct, dependence-free, C++, to ease integration into pre-existing
complex systems. While developing TTK, we faced several algorithmic and
software engineering challenges, which we document in this paper. In
particular, we present an algorithm for the construction of a discrete gradient
that complies to the critical points extracted in the piecewise-linear setting.
This algorithm guarantees a combinatorial consistency across the topological
abstractions supported by TTK, and importantly, a unified implementation of
topological data simplification for multi-scale exploration and analysis. We
also present a cached triangulation data structure, that supports time
efficient and generic traversals, which self-adjusts its memory usage on demand
for input simplicial meshes and which implicitly emulates a triangulation for
regular grids with no memory overhead. Finally, we describe an original
software architecture, which guarantees memory efficient and direct accesses to
TTK features, while still allowing for researchers powerful and easy bindings
and extensions. TTK is open source (BSD license) and its code, online
documentation and video tutorials are available on TTK's website
PyDEC: Software and Algorithms for Discretization of Exterior Calculus
This paper describes the algorithms, features and implementation of PyDEC, a
Python library for computations related to the discretization of exterior
calculus. PyDEC facilitates inquiry into both physical problems on manifolds as
well as purely topological problems on abstract complexes. We describe
efficient algorithms for constructing the operators and objects that arise in
discrete exterior calculus, lowest order finite element exterior calculus and
in related topological problems. Our algorithms are formulated in terms of
high-level matrix operations which extend to arbitrary dimension. As a result,
our implementations map well to the facilities of numerical libraries such as
NumPy and SciPy. The availability of such libraries makes Python suitable for
prototyping numerical methods. We demonstrate how PyDEC is used to solve
physical and topological problems through several concise examples.Comment: Revised as per referee reports. Added information on scalability,
removed redundant text, emphasized the role of matrix based algorithms,
shortened length of pape
- …