12 citations · 17 across the 10 of their papers we have counts for
11 papers
Homological Trimming and Regularity of Filtrations via Local Obstruction Modules
Siddharth Pritam
Existing link-based combinatorial preprocessing methods speed up the computation of persistent homology by removing a vertex or edge only when its link remains a cone. We replace t…
The Non-Orientable Topology of Condorcet's Paradox
Ori Livson, Siddharth Pritam, Mikhail Prokopenko
Preference cycles are prevalent in problems of decision-making, and are contradictory when preferences are assumed to be transitive. This contradiction underlies Condorcet's Parado…
Challenges in 3D Data Synthesis for Training Neural Networks on Topological Features
Dylan Peek, Matthew P. Skerritt, Siddharth Pritam +1
Topological Data Analysis (TDA) involves techniques of analyzing the underlying structure and connectivity of data. However, traditional methods like persistent homology can be com…
Time Series Analysis of Spiking Neural Systems via Transfer Entropy and Directed Persistent Homology
Dylan Peek, Siddharth Pritam, Matthew P. Skerritt +1
We present a topological framework for analysing neural time series that integrates Transfer Entropy (TE) with directed Persistent Homology (PH) to characterize information flow in…
Filtration-Based Representation Learning for Temporal Graphs
Samrik Chowdhury, Siddharth Pritam, Rohit Roy +1
In this work, we introduce a filtration on temporal graphs based on -temporal motifs (recurrent subgraphs), yielding a multi-scale representation of temporal structure. Our temp…
Strong Collapse of Random Simplicial Complexes
Jean-Daniel Boissonnat, Kunal Dutta, Soumik Dutta +1
The \emph{strong collapse} of a simplicial complex, proposed by Barmak and Minian (\emph{Disc. Comp. Geom. 2012}), is a combinatorial collapse of a complex onto its sub-complex. Re…
Filtration-Domination in Bifiltered Graphs
Ángel Javier Alonso, Michael Kerber, Siddharth Pritam
Bifiltered graphs are a versatile tool for modelling relations between data points across multiple grades of a two-dimensional scale. They are especially popular in topological dat…
Swap, Shift and Trim to Edge Collapse a Filtration
Marc Glisse, Siddharth Pritam
Boissonnat and Pritam introduced an algorithm to reduce a filtration of flag (or clique) complexes, which can in particular speed up the computation of its persistent homology. The…
Strong Collapse for Persistence
Jean-Daniel Boissonnat, Siddharth Pritam, Divyansh Pareek
We introduce a fast and memory efficient approach to compute the persistent homology (PH) of a sequence of simplicial complexes. The basic idea is to simplify the complexes of the…
Homotopy equivalence between Voronoi medusa and Delaunay medusa
Siddharth Pritam, Michael Kerber
We trace movements of certain points in space-time along their corresponding continuous path. We partition the space at every moment of time using alpha-Complexes, Voronoi medusa i…
"Infographics" team: Selecting Control Parameters via Maximal Fisher Information
Siddharth Pritam
Team description paper for RoboCup 2014 Soccer Simulation League 2D.