I am assisting bioscientists, who are studying the effects of water and food deprivation on fruit flies (drosophila melanogaster). As part of their study, they obtained several gene expression (scRNA-seq) data sets from their neurons, and are clustering them based on cell sub-types in their subsequent analysis (among other things). This data is challenging to work with due to inherent variability and noise in the data, lack of ground truth (often even no clear key for validation of results), data set size and dimension. I am trying to address several of these issues by standard and topological methods for data analysis. I have been using kcluster, a clustering method developed by O. Bobrowski and P. Škraba, especially frequently. I recently presented my work on this project in AATRN Applied topology seminar (a recording can be found here).
Directed topological spaces are topological spaces with a notion of direction defined via a family of directed paths on it. They can be used to model time-dependent processes or directed networks such as transportation and social networks. We are developing a new similarity measure based on the standard distance between metric spaces, the Gromov--Hausdorff distance. Depending on which of its (equivalent) definitions we generalize to directed spaces, we obtain three different measures.
Linear regions of a neural network are convex subsets of the input space on which each unit of each layer "makes the same decision" (this is meant in terms of the chosen activation function and can be interpreted differently depending on the choice). My collaborators and I have been studying how these regions change during the training process and whether or not learning an initialization which maximizes their number is beneficial.
The output of persistent homology is an algebraic object called a persistence module. It admits a decomposition into a direct sum of interval persistence modules described entirely by the barcode invariant. We investigated when a morphism of persistence modules admits an analogous direct sum decomposition. Jacquard et al. showed that a ladder decomposition can be obtained whenever the barcodes of the persistence modules in question do not have any strictly nested bars. We refine this result and show that even in the presence of nested bars, a ladder decomposition exists when the morphism is sufficiently close to being invertible relative to the scale of the nested bars.
In this project, we gave a comprehensive guide on how to create 3D-printable models of tropical surfaces, tropical curves, and combinations thereof. Code templates for creating models in polymake, exporting them to OpenSCAD and then to an appropriate file format have been made available in the official Polymake distribution. A user guide can be found here.