Related papers: Natural methods of unsupervised topological alignm…
Different network models have been suggested for the topology underlying complex interactions in natural systems. These models are aimed at replicating specific statistical features encountered in real-world networks. However, it is rarely…
An approach based on the kernel methods for capturing the nonlinear interdependence between two signals is introduced. It is demonstrated that the proposed approach is useful for characterizing generalized synchronization with a successful…
We perform topological data analysis on the internal states of convolutional deep neural networks to develop an understanding of the computations that they perform. We apply this understanding to modify the computations so as to (a) speed…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
In the study of dynamical systems on networks/graphs, a key theme is how the network topology influences stability for steady states or synchronized states. Ideally, one would like to derive conditions for stability or instability that…
We introduce a universally applicable method, based on the bond-algebraic theory of dualities, to search for generalized order parameters in disparate systems including non-Landau systems with topological order. A key notion that we advance…
We propose an adaptive control protocol for identifying the topology of dynamical networks interconnected over undirected graphs with cooperative and antagonistic interactions. The signed network is modeled using a repelling Laplacian.…
Classical unsupervised learning methods like clustering and linear dimensionality reduction parametrize large-scale geometry when it is discrete or linear, while more modern methods from manifold learning find low dimensional representation…
Living systems exhibit complex yet organized behavior on multiple spatiotemporal scales. To investigate the nature of multiscale coordination in living systems, one needs a meaningful and systematic way to quantify the complex dynamics, a…
Topological Data Analysis has grown in popularity in recent years as a way to apply tools from algebraic topology to large data sets. One of the main tools in topological data analysis is persistent homology. This paper uses undergraduate…
We present angle-uniform parallel coordinates, a data-independent technique that deforms the image plane of parallel coordinates so that the angles of linear relationships between two variables are linearly mapped along the horizontal axis…
In a world abundant with diverse data arising from complex acquisition techniques, there is a growing need for new data analysis methods. In this paper we focus on high-dimensional data that are organized into several hierarchical datasets.…
The enduring legacy of Euclidean geometry underpins classical machine learning, which, for decades, has been primarily developed for data lying in Euclidean space. Yet, modern machine learning increasingly encounters richly structured data…
This research addresses a new tool for data analysis known as Topological Data Analysis TDA It underlies an area of Mathematics known as Combinatorial Algebra or more recently Algebraic Topology which through making strong use of…
Capturing complex high-order interactions among data is an important task in many scenarios. A common way to model high-order interactions is to use hypergraphs whose topology can be mathematically represented by tensors. Existing methods…
Using a simplistic model of juggling based on physics, a natural map is constructed from the set of periodic juggling patterns (or site swaps) to links. We then show that all topological links can be juggled.
Comparing networks is essential for a number of downstream tasks, from clustering to anomaly detection. Despite higher-order interactions being critical for understanding the dynamics of complex systems, traditional approaches for network…
Kernel density estimation is a key component of a wide variety of algorithms in machine learning, Bayesian inference, stochastic dynamics and signal processing. However, the unsupervised density estimation technique requires tuning a…
The scientific literature is a rich source of information for data mining with conceptual knowledge graphs; the open science movement has enriched this literature with complementary source code that implements scientific models. To exploit…
For data sampled from an arbitrary density on a manifold embedded in Euclidean space, the Continuous k-Nearest Neighbors (CkNN) graph construction is introduced. It is shown that CkNN is geometrically consistent in the sense that under…