For those of you that plan to head to Kyoto in June for SoCG 2014, Yasu Hiraoka and I are organizing a small, informal workshop on TDA just before the main conference.
“This workshop will focus on the following question: Which promising directions in computational topology can mathematicians and machine learning researchers work on together, in order to develop new models, algorithms, and theory for machine learning? While all aspects of computational topology are appropriate for this workshop, our emphasis is on topology applied to machine learning — concrete models, algorithms and real-world applications.”
More here: http://topology.cs.wisc.edu
This workshop will be devoted to generalizations of persistent homology with a particular emphasis on finding calculable algebraic invariants useful for applications. Applications of persistence — for example, signal processing, drug design, tumor identification, shape classification, and geometric inference — rely on the classification of persistence via barcodes, geometrization of the space of barcodes via metrics or as an algebraic variety, and on efficient algorithms. Accordingly, this workshop will bring together theoriticians, computer scientist, and the users of computational topology.
The main topics for the workshop are:
- Generalizations of persistence: multidimensional persistence, well groups, (co)sheaves
The workshop will differ from typical conferences in some regards. Participants will be invited to suggest open problems and questions before the workshop begins, and these will be posted on the workshop website. These include specific problems on which there is hope of making some progress during the workshop, as well as more ambitious problems which may influence the future activity of the field. Lectures at the workshop will be focused on familiarizing the participants with the background material leading up to specific problems, and the schedule will include discussion and parallel working sessions.
Space and funding is available for a few more participants. If you would like to participate, please apply by filling out the on-line form no later than May 15, 2014. Applications are open to all, and we especially encourage women, underrepresented minorities, junior mathematicians, and researchers from primarily undergraduate institutions to apply.
I’d like to point to you an open problem that I find interesting. A good reference is the paper “How many lions are needed to clear a grid?” by Florian Berger, Alexander Gilbers, Ansgar Grüne, and Rolf Klein .
Disclaimer: I would classify this problem as more combinatorial than topological.
Suppose we have a graph which is an grid. This graph contains vertices, and the case is drawn below.
We have lions moving on this grid. At each time step a lion occupies a vertex, and between adjacent time steps a lion either stays put or travels across one edge to an adjacent vertex.
We also need to define the subset of vertices which are “contaminated” at time . A lion can clean a contaminated vertex, but in the absence of lions, the contamination spreads. At starting time every vertex not occupied by a lion is contaminated; this gives . How does the contaminated set update as the lions move? A vertex is in if is not covered by a lion at time and either
- belongs to , or
- has a neighbor in such that no lion travels from vertex to between times and .
Suppose you are given lions. You get to choose the lions’ starting vertices at time zero in the grid – all other vertices begin contaminated. You get to pick how each lion moves at each time step. Can you design a way to clear all contaminated vertices from the grid?
If then this problem is easy. At time zero simply line up the lions along the left-hand side of the grid, from top to bottom. At each time step, sweep each lion one step to the right. At time the lions will be on the right-hand side of the grid, and there will be no contaminated vertices.
It is unknown whether lions are sufficient to clear the grid or not. I would guess that most people think lions are insufficient, but nobody has a proof!
An equivalent way to phrase this problem is to use a mobile evader instead of the set of contaminated vertices. Suppose our evader moves at the same speed as the lions: at each time step the evader occupies a vertex, and between adjacent time steps the evader either stays put or crosses one edge. The evader is caught if it occupies the same vertex or crosses the same edge as any lion. It is known that lions can catch any such evader (say by sweeping from left to right), and it is unknown whether lions are sufficient or not. To see the equivalence between the formulations using a mobile evader or contaminated vertices, note that is the set of all possible locations of a mobile evader at time .
This is one of those problems that is harder than it sounds. Upon first hearing it your reaction is that you will have a proof after one evening of hard work. A week later you still haven’t made much progress, and you’re a week behind on your normal research agenda. Consider yourself warned!
One reason why I classify this problem as more combinatorial than topological is that the details of the discretization matter. For example, see Figure 1 of  (Note – in this figure, a vertex of the grid is drawn as a square. This is their representation of a grid with 16 vertices, not a grid with 25 vertices). For a second example, see Figure 5 of . In the 3d version of this problem, you might expect that lions are necessary to clear an grid. Figure 5 of  shows that this is false – 8 lions (which is less than 9) are sufficient to clear the grid.
The 4th International Congress on Mathematical Software (ICMS 2014) takes place in Seoul, Korea on Aug 5-9. This year, it will host a workshop session dedicated to Computational Topology. Contributions on state-of-the-art software for topological problems as well as applications of such software to other domains are welcome. See the dedicated webpage for more information,
How to contribute: Submit a short abstract of 200-500 words to the session organizer until March 31. You will get a notification about acceptance within one week and upon positive evaluation, you will give a talk at ICMS. An extended abstract (due end of April) will appear in the conference proceedings. A special issue of Journal of Symbolic Computation will be organized immediately after the workshop.
Algebraic Topology- Methods, Computation and Science 6 (ATMCS6) is now open for registration. The conference takes place at PIMS University of British Columbia May 26-30.
Confirmed speakers include:
Vin de Silva
For more details, see:
Applied and computational topology refers to the adaptation of topological ideas and techniques to study problems in science and engineering. A particular focus is on using invariants and methods of algebraic topology to understand large high-dimensional data sets. The further development of topological techniques for use in applications and the creation of new areas of application in the subject are amongst the goals of this workshop.
The workshop will bring together leading researchers in this emerging discipline as well as providing an opportunity for young mathematicians to get involved in it. In past years, the ATMCS conference has been very successful in providing a forum for cutting-edge research to be disseminated; attendance tends to represent a broad swath of the diverse research community which works in this area.
The workshop will feature lectures and discussion in the morning and afteroon. Mid-Morning and Afternoon refreshments will be provided during the conference.
On behalf of the organizers
Andrew Blumberg, U Texas
Matthew Kahle, Ohio State
Mikael Vejdemo-Johansson, KTH / IMA / IJS
To start off the feature articles at appliedtopology.org, I figured it might be worth while collecting good entry points to the field. One of the most common questions I get about persistent homology and topological data analysis is how to get started with our techniques and ideas.
Overview articles and books
First off in the list of entry points is the written word. There are survey articles, overview articles and books written about topological data analysis as a whole, as well as focusing on specific parts.
Topology and Data by Gunnar Carlsson. This survey article came soon after Ghrist’s survey, and covers persistent homology, as well as Mapper for topological simplification and modeling. It also comes with a good discussion of the underlying philosophy of the field.
Barcodes: the persistent topology of data by Robert Ghrist. This is the first major survey article to come out, and covers persistent homology and some of its applications.
Topology for computing by Afra Zomorodian. This is the first book format exposition of persistent homology for applied and computational topology. It is a good and self-contained introduction to the field, if ever so slightly dated: in particular, it does not cover anything about zigzag persistence or multi-dimensional persistence.
Computational Topology: an introduction by Herbert Edelsbrunner and John Harer. This book covers the state of the art as of 2010 of computational topology, with some focus on persistent homology: one third of the book is devoted to persistence and its applications. Throughout, the book discusses the underlying theory, the most obvious algorithm, and the fastest known algorithm.
So you understand what the underlying ideas of the field are. Next up, you’ll want to try them out on your own data. There are some ways you can go to do this, and they all have their specific strengths and weaknesses.
Plex, jPlex, javaPlex: this sequence of libraries were developed in the Stanford group, and with an explicit aim at always interoperating smoothly and easily with Matlab. Of the three, we currently recommend javaPlex unless this library does not cover your exact use case — in which case some methods may exist in jPlex. Plex is written in C++, and connects to Matlab through a MEX interface, while jPlex and javaPlex are both Java libraries.
Dionysus: this library, written and maintained by Dmitriy Morozov, provides a platform for developing and experimenting with computational topology algorithms in C++ or in Python. It interfaces with CGAL for low dimensional geometric constructions, and has example applications provided for persistent homology, cohomology, vineyards, alphashapes and numerous other common techniques.
Perseus: this package, developed by Vidit Nanda, provides a platform for computing persistent homology for cubical and simplicial complexes generated in a number of different ways. It specifically uses methods based on discrete morse theory for speeding up computations.
pHat: this package, created by Ulrich Bauer, Michael Kerber and Jan Reininghaus builds on results by the authors that speeds up persistence computation by specific tricks that use structures in a persistence boundary matrix. Currently only using Z/2-coefficients and not constructing the complex for you, it seems to be the fastest publicly available package.
CHomP: this software package came out of the CHomP research project, and consists of a rich collection of tools to work persistently or statically with cubical complex data. For homology on image or voxel collection data, CHomP forms the fastest and most complete analysis system available right now.
We warmly appreciate suggestions for more papers, software, or other resources if you have anything to add to this list.
Given a pair of spaces , with , the short exact sequence of the pair is a relationship between the chains and . The sequence that looks like this:
is short exact, or that: . If you want to know more about exact sequences I recommend reading this.
and the map is called the connecting homomorphism.
The natural question to ask is: What is ? The answer is that
that . However, if you read the aforementioned authoritative text on the subject you will see that is not explicitly defined, but its existence is merely proved.
However, given a particular and , one is able to come up with an idea of what the map does. I’ll go over the basic diagram chase and then show how this works by example.
Since we are given a representation of we can begin by taking a homology class which is relative cycle. Any chain in which is in the class has the property that in . Such a chain is called a lift.
Assuming we have found a lift we can compute , and it turns out that (because ), which means that . So our mapping sends to . So you now just need to prove that this process is well defined and this ends your diagram chase as well as your interest in the details of this sequence. Unless of course you are Mr. Cooperman, or, a computer scientist.
If you are a computer scientist you might be dissatisfied because it is not entirely clear how is presented. Indeed itself is not unique as it depends on our choice of lift, is likely itself not even a member of our given representative for homology on .
The problem we have is that so far our cycle is written down as a linear combination of cells. We want an equivalent representation in terms of cycles. Noether says we can write down .
This tells us that we can use our homology basis to form a basis for our cycle group, and its not to hard to see that we can extend the cycle group to a basis for all chains. However in our case we want to take a cycle expressed in the chain basis, and write it as a linear combination of given cycles. This amounts to being able to write down a rectangular “change of basis” matrix between the cell basis and the given cycle basis on .
The column space of this matrix would be given by our given cycle basis, and the row space would be given by the canonical cell basis for . We then look to “solve ” over (in this blog ), in the sense that we want to write down a linear combination of the cycles in apply our matrix and end up with the we computed.
Consider this space :
which is homotopic to an annulus.
We can imagine that , and that is obtained by gluing a disc onto the boundary of , so that is itself homotopic to a disc, is then homotopic to a sphere, with exactly one non-trivial 2nd homology class. The boundary of this class would be the outermost cycle of .
Lets say that we are provided a basis for and . If I want to express the outer bounding cycle in this basis, I begin by writing down the change of basis matrix, in order to solve I augment the matrix with the identity matrix on the right and on the bottom.
Now you can see that modulo our extra row for our matrix is in row echelon form, and it suffices to perform one Gaussian elimination (over ) in this last column to achieve our result:
Notice how the right hand side now contains our vector and indeed .