Chad Giusti
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Chad Giusti has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Danielle S. Bassett
Yale University
6 shared publications - Vladimir Itskov
The Pennsylvania State University, University Park
4 shared publications Robert Ghrist
Department of Mathematics and Electrical & Systems Engineering University of Pennsylva- nia 19104 Philadelphia PA
3 shared publications- Ari E. Kahn
Princeton University
2 shared publications - Bill Kronholm
Department of Mathematics, Whittier College, Whittier, USA
2 shared publications Dev Sinha
Department of Mathematics, University of Oregon, Eugene, OR, 97403 USA
2 shared publications
Latest Publications
- Open Access
Learning local geometry and nonlinear topology of neural manifolds via spike-timing dependent plasticity
Neural manifolds are an indispensable framework for understanding information encoded by activity in neural populations. While some neural manifolds are linear and can be recovered from population activity using standard techniques, many neural manifolds exhibit nonlinear global topology for which such tools can be less effective. Notably, circular and toroidal manifolds describe activity in neural systems across a range of species; common examples include orientation-selective simple cells in primary visual cortex, head-direction cells in thalamic circuits, and grid cells in entorhinal cortex. That such structured information appears in both sensory and deep-brain regions raises a basic question: is the propagation of nonlinear coordinate systems a generic feature of biological neural networks, or must this be learned? If learning is necessary, how does it occur? In this paper, we apply methods from topological data analysis developed to quantitatively measure propagation of such nonlinear manifolds across populations to address these problems. We identify a collection of connectivity and parameter regimes for feed-forward networks in which learning is required, and demonstrate that simple Hebbian spike-timing dependent plasticity reorganizes such networks to correctly propagate circular coordinate systems. We observe during this learning process the emergence of geometrically non-local experimentally observed receptive field types: bimodally-tuned head-direction cells and cells with spatially periodic, band-like receptive fields. These observations provide quantitative support for the hypothesis that simple biologically plausible plasticity mechanisms suffice to induce changes in the structure of neural architectures sufficient to explain the appearance of such features in real neural systems.
Open AccessLearning local geometry and nonlinear topology of neural manifolds via spike-timing dependent plasticity
Neural manifolds are an indispensable framework for understanding information encoded by activity in neural populations. While some neural manifolds are linear and can be recovered from population activity using standard techniques, many neural manifolds exhibit nonlinear global topology for which such tools can be less effective. Notably, circular and toroidal manifolds describe activity in neural systems across a range of species; common examples include orientation-selective simple cells in primary visual cortex, head-direction cells in thalamic circuits, and grid cells in entorhinal cortex. That such structured information appears in both sensory and deep-brain regions raises a basic question: is the propagation of nonlinear coordinate systems a generic feature of biological neural networks, or must this be learned? If learning is necessary, how does it occur? In this paper, we apply methods from topological data analysis developed to quantitatively measure propagation of such nonlinear manifolds across populations to address these problems. We identify a collection of connectivity and parameter regimes for feed-forward networks in which learning is required, and demonstrate that simple Hebbian spike-timing dependent plasticity reorganizes such networks to correctly propagate circular coordinate systems. We observe during this learning process the emergence of geometrically non-local experimentally observed receptive field types: bimodally-tuned head-direction cells and cells with spatially periodic, band-like receptive fields. These observations provide quantitative support for the hypothesis that simple biologically plausible plasticity mechanisms suffice to induce changes in the structure of neural architectures sufficient to explain the appearance of such features in real neural systems.
- Open Access
Tracking the topology of neural manifolds across populations
Neural manifolds summarize the intrinsic structure of the information encoded by a population of neurons. Advances in experimental techniques have made simultaneous recordings from multiple brain regions increasingly commonplace, raising the possibility of studying how these manifolds relate across populations. However, when the manifolds are nonlinear and possibly code for multiple unknown variables, it is challenging to extract robust and falsifiable information about their relationships. We introduce a framework, called the method of analogous cycles, for matching topological features of neural manifolds using only observed dissimilarity matrices within and between neural populations. We demonstrate via analysis of simulations and \emph{in vivo} experimental data that this method can be used to correctly identify multiple shared circular coordinate systems across both stimuli and inferred neural manifolds. Conversely, the method rejects matching features that are not intrinsic to one of the systems. Further, as this method is deterministic and does not rely on dimensionality reduction or optimization methods, it is amenable to direct mathematical investigation and interpretation in terms of the underlying neural activity. We thus propose the method of analogous cycles as a suitable foundation for a theory of cross-population analysis via neural manifolds.
Open AccessTracking the topology of neural manifolds across populations
Neural manifolds summarize the intrinsic structure of the information encoded by a population of neurons. Advances in experimental techniques have made simultaneous recordings from multiple brain regions increasingly commonplace, raising the possibility of studying how these manifolds relate across populations. However, when the manifolds are nonlinear and possibly code for multiple unknown variables, it is challenging to extract robust and falsifiable information about their relationships. We introduce a framework, called the method of analogous cycles, for matching topological features of neural manifolds using only observed dissimilarity matrices within and between neural populations. We demonstrate via analysis of simulations and \emph{in vivo} experimental data that this method can be used to correctly identify multiple shared circular coordinate systems across both stimuli and inferred neural manifolds. Conversely, the method rejects matching features that are not intrinsic to one of the systems. Further, as this method is deterministic and does not rely on dimensionality reduction or optimization methods, it is amenable to direct mathematical investigation and interpretation in terms of the underlying neural activity. We thus propose the method of analogous cycles as a suitable foundation for a theory of cross-population analysis via neural manifolds.
- Open Access
Computing homology of $\mathbb{Z}_k$-complexes from their quotients
In this paper, we investigate the question of how one can recover the homology of a simplicial complex $X$ equipped with a regular action of a finite group $G$ from the structure of its quotient space $X/G.$ Specifically, we describe a process for enriching the structure of the chain complex $C_\ast(X/G; \mathbb{F})$ using the data of a complex of groups, a framework developed by Bridson and Corsen for encoding the local structure of a group action. We interpret this data through the lens of matrix representations of the acting group, and combine this structure with the standard simplicial boundary matrices for $X/G$ to construct a surrogate chain complex. In the case $G = \mathbb{Z}_k,$ the group ring $\mathbb{F}G$ is commutative and matrices over $\mathbb{F}G$ admit a Smith normal form, allowing us to recover the homology of $G$ from this surrogate complex. This algebraic approach complements the geometric compression algorithm for equivariant simplicial complexes described by Carbone, Nanda, and Naqvi.Open AccessComputing homology of $\mathbb{Z}_k$-complexes from their quotients
In this paper, we investigate the question of how one can recover the homology of a simplicial complex $X$ equipped with a regular action of a finite group $G$ from the structure of its quotient space $X/G.$ Specifically, we describe a process for enriching the structure of the chain complex $C_\ast(X/G; \mathbb{F})$ using the data of a complex of groups, a framework developed by Bridson and Corsen for encoding the local structure of a group action. We interpret this data through the lens of matrix representations of the acting group, and combine this structure with the standard simplicial boundary matrices for $X/G$ to construct a surrogate chain complex. In the case $G = \mathbb{Z}_k,$ the group ring $\mathbb{F}G$ is commutative and matrices over $\mathbb{F}G$ admit a Smith normal form, allowing us to recover the homology of $G$ from this surrogate complex. This algebraic approach complements the geometric compression algorithm for equivariant simplicial complexes described by Carbone, Nanda, and Naqvi. - Open Access
- 8 November 2024
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 121 (46)
Tracking the topology of neural manifolds across populations
Neural manifolds summarize the intrinsic structure of the information encoded by a population of neurons. Advances in experimental techniques have made simultaneous recordings from multiple brain regions increasingly commonplace, raising the possibility of studying how these manifolds relate across populations. However, when the manifolds are nonlinear and possibly code for multiple unknown variables, it is challenging to extract robust and falsifiable information about their relationships. We introduce a framework, called the method of analogous cycles, for matching topological features of neural manifolds using only observed dissimilarity matrices within and between neural populations. We demonstrate via analysis of simulations and in vivo experimental data that this method can be used to correctly identify multiple shared circular coordinate systems across both stimuli and inferred neural manifolds. Conversely, the method rejects matching features that are not intrinsic to one of the systems. Further, as this method is deterministic and does not rely on dimensionality reduction or optimization methods, it is amenable to direct mathematical investigation and interpretation in terms of the underlying neural activity. We thus propose the method of analogous cycles as a suitable foundation for a theory of cross-population analysis via neural manifolds.
- 8 November 2024
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 121 (46)
Open AccessTracking the topology of neural manifolds across populations
Neural manifolds summarize the intrinsic structure of the information encoded by a population of neurons. Advances in experimental techniques have made simultaneous recordings from multiple brain regions increasingly commonplace, raising the possibility of studying how these manifolds relate across populations. However, when the manifolds are nonlinear and possibly code for multiple unknown variables, it is challenging to extract robust and falsifiable information about their relationships. We introduce a framework, called the method of analogous cycles, for matching topological features of neural manifolds using only observed dissimilarity matrices within and between neural populations. We demonstrate via analysis of simulations and in vivo experimental data that this method can be used to correctly identify multiple shared circular coordinate systems across both stimuli and inferred neural manifolds. Conversely, the method rejects matching features that are not intrinsic to one of the systems. Further, as this method is deterministic and does not rely on dimensionality reduction or optimization methods, it is amenable to direct mathematical investigation and interpretation in terms of the underlying neural activity. We thus propose the method of analogous cycles as a suitable foundation for a theory of cross-population analysis via neural manifolds.
- Open Access
Signatures, Lipschitz-free spaces, and paths of persistence diagrams
Paths of persistence diagrams provide a summary of the dynamic topological structure of a one-parameter family of metric spaces. These summaries can be used to study and characterize the dynamic shape of data such as swarming behavior in multi-agent systems, time-varying fMRI scans from neuroscience, and time-dependent scalar fields in hydrodynamics. While persistence diagrams can provide a powerful topological summary of data, the standard space of persistence diagrams lacks the sufficient algebraic and analytic structure required for many theoretical and computational analyses. We enrich the space of persistence diagrams by isometrically embedding it into a Lipschitz-free space, a Banach space built from a universal construction. We utilize the Banach space structure to define bounded variation paths of persistence diagrams, which can be studied using the path signature, a reparametrization-invariant characterization of paths valued in a Banach space. The signature is universal and characteristic which allows us to theoretically characterize measures on the space of paths and motivates its use in the context of kernel methods. However, kernel methods often require a feature map into a Hilbert space, so we introduce the moment map, a stable and injective feature map for static persistence diagrams, and compose it with the discrete path signature, producing a computable feature map into a Hilbert space. Finally, we demonstrate the efficacy of our methods by applying this to a parameter estimation problem for a 3D model of swarming behavior.
Open AccessSignatures, Lipschitz-free spaces, and paths of persistence diagrams
Paths of persistence diagrams provide a summary of the dynamic topological structure of a one-parameter family of metric spaces. These summaries can be used to study and characterize the dynamic shape of data such as swarming behavior in multi-agent systems, time-varying fMRI scans from neuroscience, and time-dependent scalar fields in hydrodynamics. While persistence diagrams can provide a powerful topological summary of data, the standard space of persistence diagrams lacks the sufficient algebraic and analytic structure required for many theoretical and computational analyses. We enrich the space of persistence diagrams by isometrically embedding it into a Lipschitz-free space, a Banach space built from a universal construction. We utilize the Banach space structure to define bounded variation paths of persistence diagrams, which can be studied using the path signature, a reparametrization-invariant characterization of paths valued in a Banach space. The signature is universal and characteristic which allows us to theoretically characterize measures on the space of paths and motivates its use in the context of kernel methods. However, kernel methods often require a feature map into a Hilbert space, so we introduce the moment map, a stable and injective feature map for static persistence diagrams, and compose it with the discrete path signature, producing a computable feature map into a Hilbert space. Finally, we demonstrate the efficacy of our methods by applying this to a parameter estimation problem for a 3D model of swarming behavior.
- Open Access
- 15 April 2023
- Published by Springer Nature in Journal of Applied and Computational Topology
- Vol. 7 (3) , 571-617
Persistent extensions and analogous bars: data-induced relations between persistence barcodes
A central challenge in topological data analysis is the interpretation of barcodes. The classical algebraic-topological approach to interpreting homology classes is to build maps to spaces whose homology carries semantics we understand and then to appeal to functoriality. However, we often lack such maps in real data; instead, we must rely on a cross-dissimilarity measure between our observations of a system and a reference. In this paper, we develop a pair of computational homological algebra approaches for relating persistent homology classes and barcodes: persistent extension, which enumerates potential relations between homology classes from two complexes built on the same vertex set, and the method of analogous bars, which utilizes persistent extension and the witness complex built from a cross-dissimilarity measure to provide relations across systems. We provide an implementation of these methods and demonstrate their use in comparing homology classes between two samples from the same metric space and determining whether topology is maintained or destroyed under clustering and dimensionality reduction.
- 15 April 2023
- Published by Springer Nature in Journal of Applied and Computational Topology
- Vol. 7 (3) , 571-617
Open AccessPersistent extensions and analogous bars: data-induced relations between persistence barcodes
A central challenge in topological data analysis is the interpretation of barcodes. The classical algebraic-topological approach to interpreting homology classes is to build maps to spaces whose homology carries semantics we understand and then to appeal to functoriality. However, we often lack such maps in real data; instead, we must rely on a cross-dissimilarity measure between our observations of a system and a reference. In this paper, we develop a pair of computational homological algebra approaches for relating persistent homology classes and barcodes: persistent extension, which enumerates potential relations between homology classes from two complexes built on the same vertex set, and the method of analogous bars, which utilizes persistent extension and the witness complex built from a cross-dissimilarity measure to provide relations across systems. We provide an implementation of these methods and demonstrate their use in comparing homology classes between two samples from the same metric space and determining whether topology is maintained or destroyed under clustering and dimensionality reduction.
- Open Access
Persistent Extension and Analogous Bars: Data-Induced Relations Between Persistence Barcodes
A central challenge in topological data analysis is the interpretation of barcodes. The classical algebraic-topological approach to interpreting homology classes is to build maps to spaces whose homology carries semantics we understand and then to appeal to functoriality. However, we often lack such maps in real data; instead, we must rely on a cross-dissimilarity measure between our observations of a system and a reference. In this paper, we develop a pair of computational homological algebra approaches for relating persistent homology classes and barcodes: persistent extension, which enumerates potential relations between cycles from two complexes built on the same vertex set, and the method of analogous bars, which utilizes persistent extension and the witness complex built from a cross-dissimilarity measure to provide relations across systems. We provide an implementation of these methods and demonstrate their use in comparing cycles between two samples from the same metric space and determining whether topology is maintained or destroyed under clustering and dimensionality reduction.
Open AccessPersistent Extension and Analogous Bars: Data-Induced Relations Between Persistence Barcodes
A central challenge in topological data analysis is the interpretation of barcodes. The classical algebraic-topological approach to interpreting homology classes is to build maps to spaces whose homology carries semantics we understand and then to appeal to functoriality. However, we often lack such maps in real data; instead, we must rely on a cross-dissimilarity measure between our observations of a system and a reference. In this paper, we develop a pair of computational homological algebra approaches for relating persistent homology classes and barcodes: persistent extension, which enumerates potential relations between cycles from two complexes built on the same vertex set, and the method of analogous bars, which utilizes persistent extension and the witness complex built from a cross-dissimilarity measure to provide relations across systems. We provide an implementation of these methods and demonstrate their use in comparing cycles between two samples from the same metric space and determining whether topology is maintained or destroyed under clustering and dimensionality reduction.
- Open Access
Minimal Cycle Representatives in Persistent Homology using Linear Programming: an Empirical Study with User's Guide
Cycle representatives of persistent homology classes can be used to provide descriptions of topological features in data. However, the non-uniqueness of these representatives creates ambiguity and can lead to many different interpretations of the same set of classes. One approach to solving this problem is to optimize the choice of representative against some measure that is meaningful in the context of the data. In this work, we provide a study of the effectiveness and computational cost of several $\ell_1$-minimization optimization procedures for constructing homological cycle bases for persistent homology with rational coefficients in dimension one, including uniform-weighted and length-weighted edge-loss algorithms as well as uniform-weighted and area-weighted triangle-loss algorithms. We conduct these optimizations via standard linear programming methods, applying general-purpose solvers to optimize over column bases of simplicial boundary matrices. Our key findings are: (i) optimization is effective in reducing the size of cycle representatives, (ii) the computational cost of optimizing a basis of cycle representatives exceeds the cost of computing such a basis in most data sets we consider, (iii) the choice of linear solvers matters a lot to the computation time of optimizing cycles, (iv) the computation time of solving an integer program is not significantly longer than the computation time of solving a linear program for most of the cycle representatives, using the Gurobi linear solver, (v) strikingly, whether requiring integer solutions or not, we almost always obtain a solution with the same cost and almost all solutions found have entries in {-1, 0, 1} and therefore, are also solutions to a restricted $\ell_0$ optimization problem, and (vi) we obtain qualitatively different results for generators in Erd\H{o}s-R\'enyi random clique complexes.Open AccessMinimal Cycle Representatives in Persistent Homology using Linear Programming: an Empirical Study with User's Guide
Cycle representatives of persistent homology classes can be used to provide descriptions of topological features in data. However, the non-uniqueness of these representatives creates ambiguity and can lead to many different interpretations of the same set of classes. One approach to solving this problem is to optimize the choice of representative against some measure that is meaningful in the context of the data. In this work, we provide a study of the effectiveness and computational cost of several $\ell_1$-minimization optimization procedures for constructing homological cycle bases for persistent homology with rational coefficients in dimension one, including uniform-weighted and length-weighted edge-loss algorithms as well as uniform-weighted and area-weighted triangle-loss algorithms. We conduct these optimizations via standard linear programming methods, applying general-purpose solvers to optimize over column bases of simplicial boundary matrices. Our key findings are: (i) optimization is effective in reducing the size of cycle representatives, (ii) the computational cost of optimizing a basis of cycle representatives exceeds the cost of computing such a basis in most data sets we consider, (iii) the choice of linear solvers matters a lot to the computation time of optimizing cycles, (iv) the computation time of solving an integer program is not significantly longer than the computation time of solving a linear program for most of the cycle representatives, using the Gurobi linear solver, (v) strikingly, whether requiring integer solutions or not, we almost always obtain a solution with the same cost and almost all solutions found have entries in {-1, 0, 1} and therefore, are also solutions to a restricted $\ell_0$ optimization problem, and (vi) we obtain qualitatively different results for generators in Erd\H{o}s-R\'enyi random clique complexes. - 5 August 2020
- Published by Walter de Gruyter GmbH in Journal für die reine und angewandte Mathematik (Crelles Journal)
- Vol. 2021 (772) , 1-51
Mod-two cohomology rings of alternating groups
We calculate the direct sum of the mod-two cohomology of all alternating groups, with both cup and transfer product structures, which in particular determines the additive structure and ring structure of the cohomology of individual groups. We show that there are no nilpotent elements in the cohomology rings of individual alternating groups. We calculate the action of the Steenrod algebra and discuss individual component rings. A range of techniques are developed, including an almost Hopf ring structure associated to the embeddings of products of alternating groups and Fox–Neuwirth resolutions, which are new techniques. We also extend understanding of the Gysin sequence relating the cohomology of alternating groups to that of symmetric groups and calculation of restriction to elementary abelian subgroups.
- 5 August 2020
- Published by Walter de Gruyter GmbH in Journal für die reine und angewandte Mathematik (Crelles Journal)
- Vol. 2021 (772) , 1-51
Mod-two cohomology rings of alternating groups
We calculate the direct sum of the mod-two cohomology of all alternating groups, with both cup and transfer product structures, which in particular determines the additive structure and ring structure of the cohomology of individual groups. We show that there are no nilpotent elements in the cohomology rings of individual alternating groups. We calculate the action of the Steenrod algebra and discuss individual component rings. A range of techniques are developed, including an almost Hopf ring structure associated to the embeddings of products of alternating groups and Fox–Neuwirth resolutions, which are new techniques. We also extend understanding of the Gysin sequence relating the cohomology of alternating groups to that of symmetric groups and calculation of restriction to elementary abelian subgroups.
- 26 June 2020
- Published by Springer Nature
- p. 219-246
Iterated Integrals and Population Time Series Analysis
- 26 June 2020
- Published by Springer Nature
- p. 219-246
Iterated Integrals and Population Time Series Analysis