Research
I am interested in applied algebraic topology, computational topology, and combinatorial topology. I am a member of the
John Harer Group.
Here is my PhD thesis, a related research highlight, and my research statement.
Papers


The VietorisRips Complex of the Circle.
With Michał Adamaszek.
Preprint available upon request.
[Abstract,
Slides,
Poster]

Given a metric space and a positive connectivity parameter, the VietorisRips simplicial complex has a vertex for each point in the metric space, and contains a set of vertices as a simplex if its diameter is less than the connectivity parameter. A theorem of JeanClaude Hausmann states that if the metric space is a Riemannian manifold and the connectivity parameter is sufficiently small, then the VietorisRips complex is homotopy equivalent to the original manifold. What happens for larger connectivity parameters? We show that as the connectivity parameter increases, the VietorisRips complex of the circle obtains the homotopy type of the circle, the 3sphere, the 5sphere, the 7sphere, ..., until finally it is contractible. The same progression of homotopy types occurs for the ambient Čech complex of the circle, i.e. a nerve complex of circular arcs, as the length of the arcs increases.


Nerve Complexes of Circular Arcs.
With Michał Adamaszek, Florian Frick, Chris Peterson, and Corrine PreviteJohnson.
[arXiv:1410.4336,
Abstract]

We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a point, an odddimensional sphere, or a wedge sum of spheres of the same even dimension. Moreover this homotopy type can be computed in time O(n log n). For the particular case of the nerve complex of evenlyspaced arcs of the same length, we determine the dihedral group action on homology, and we relate the complex to a cyclic polytope with n vertices. We give three applications of our knowledge of the homotopy types of nerve complexes of circular arcs. First, we use the connection to cyclic polytopes to give a novel topological proof of a known upper bound on the distance between successive roots of a homogeneous trigonometric polynomial. Second, we show that the Lovász bound on the chromatic number of a circular complete graph is either sharp or off by one. Third, we show that the VietorisRips simplicial complex of $n$ points in the circle is homotopy equivalent to either a point, an odddimensional sphere, or a wedge sum of spheres of the same even dimension, and furthermore this homotopy type can be computed in time O(n log n).
We use the nudged elastic band method from computational chemistry to analyze highdimensional data. Our approach is inspired by Morse theory, and as output we produce an increasing sequence of small cell complexes modeling the dense regions of the data. We test the method on data sets arising in social networks and in image processing. Furthermore, we apply the method to identify new topological structure in a data set of optical flow patches.
Suppose that ballshaped sensors wander in a bounded domain. A sensor doesn't know its location but does know when it overlaps a nearby sensor. We say that an evasion path exists in this sensor network if a moving intruder can avoid detection. In "Coordinatefree coverage in sensor networks with controlled boundaries via homology", Vin de Silva and Robert Ghrist give a necessary condition, depending only on the timevarying connectivity data of the sensors, for an evasion path to exist. Using zigzag persistent homology, we provide an equivalent condition that moreover can be computed in a streaming fashion. However, no method with timevarying connectivity data as input can give necessary and sufficient conditions for the existence of an evasion path. Indeed, we show that the existence of an evasion path depends not only on the fibrewise homotopy type of the region covered by sensors but also on its embedding in spacetime. For planar sensors that also measure weak rotation and distance information, we provide necessary and sufficient conditions for the existence of an evasion path.
Carlsson, Ishkanov, de Silva, and Zomorodian apply computational topological tools to the data set of 3 × 3 patches from optical images studied by Lee, Pedersen, and Mumford and find geometric structures for high density subsets. One high density subset is called the primary circle and essentially consists of patches with a line separating a light and a dark region. In this paper, we apply the techniques of Carlsson et al. to range patches. By enlarging to 5 × 5 and 7 × 7 patches, we find core subsets that have the topology of the primary circle, suggesting a stronger connection between optical patches and range patches than was found by Lee, Pedersen, and Mumford.
Extended Abstracts


JavaPlex: A Research Software Package for Persistent (Co)Homology.
With Andrew Tausz and Mikael VejdemoJohansson.
Proceedings of ICMS 2014, Han Hong and Chee Yap (Eds), LNCS 8592 (2014), 129136.
[Publisher Website,
Abstract]

The computation of persistent homology has proven a fundamental component of the nascent field of topological data analysis and computational topology. We describe a new software package for topological computation, with design focus on needs of the research community. This tool, replacing previous jPlex and Plex, enables researchers to access state of the art algorithms for persistent homology, cohomology, hom complexes, filtered simplicial complexes, filtered cell complexes, witness complex constructions, and many more essential components of computational topology. We describe the design goals we have chosen, the resulting software package, and some of its more novel capabilities.
Software Tutorials