Related papers: Topological Trajectory Classification and Landmark…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…
With the recent development of localization and tracking systems for both indoor and outdoor settings, we consider the problem of sensing, representing and analyzing human movement trajectories that we expect to gather in the near future.…
Focusing on coupling between edges, we generalize the relationship between the normalized graph Laplacian and random walks on graphs by devising an appropriate normalization for the Hodge Laplacian -- the generalization of the graph…
Despite growing interest in synchronization dynamics over "higher-order" network models, optimization theory for such systems is limited. Here, we study a family of Kuramoto models inspired by algebraic topology in which oscillators are…
Despite the vast literature on network dynamics, we still lack basic insights into dynamics on higher-order structures (e.g., edges, triangles, and more generally, $k$-dimensional "simplices") and how they are influenced through…
We outline a novel clustering scheme for simplicial complexes that produces clusters of simplices in a way that is sensitive to the homology of the complex. The method is inspired by, and can be seen as a higher-dimensional version of,…
Graphs are ubiquitous to model the irregular (non-Euclidean) structure of complex data, but they are limited to pairwise relationships and fail to model the complexities of the datasets exhibiting higher-order interactions. In that context,…
The null space of the $k$-th order Laplacian $\mathbf{\mathcal L}_k$, known as the {\em $k$-th homology vector space}, encodes the non-trivial topology of a manifold or a network. Understanding the structure of the homology embedding can…
The manifold hypothesis, which assumes that data lies on or close to an unknown manifold of low intrinsic dimension, is a staple of modern machine learning research. However, recent work has shown that real-world data exhibits distinct…
Hodge Laplacians have been previously proposed as a natural tool for understanding higher-order interactions in networks and directed graphs. Here we introduce a Hodge-theoretic approach to spectral theory and dimensionality reduction for…
Trajectory prediction in a cluttered environment is key to many important robotics tasks such as autonomous navigation. However, there are an infinite number of possible trajectories to consider. To simplify the space of trajectories under…
A standard problem in applied topology is how to discover topological invariants of data from a noisy point cloud that approximates it. We consider the case where a sample is drawn from a properly embedded C1-submanifold without boundary in…
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…
In this paper, we consider a simple class of stratified spaces -- 2-complexes. We present an algorithm that learns the abstract structure of an embedded 2-complex from a point cloud sampled from it. We use tools and inspiration from…
Robustness of higher-order networks is often quantified by the instantaneous smallest positive eigenvalue of the Hodge $1$-Laplacian under simplex deletion. We show that this observable is generically ill-defined: along a deletion…
We provide the first comprehensive study on how to classify trajectories using only their spatial representations, measured on 5 real-world data sets. Our comparison considers 20 distinct classifiers arising either as a KNN classifier of a…
Among plenty of applications, low-dimensional homogeneous spaces appear in cosmological models as both, classical factor spaces of multidimensional geometry and minisuperspaces in canonical quantization. Here a new tool to restrict their…
The present paper mainly presents, for example, explicit classifications of compact smooth manifolds having non-empty boundaries and simple structures where the dimensions are general. Studies of this type is fundamental and important. They…
A central problem in topological data analysis is that of computing the homology of a given simplicial complex. Said complexes can have arbitrary large number of simplices, as can happen, for example, if the space is the Rips-Vietoris or…
Detecting small targets at range is difficult because there is not enough spatial information present in an image sub-region containing the target to use correlation-based methods to differentiate it from dynamic confusers present in the…