Basic Usage

In this notebook, we will show some typical use cases of the API First, we import the necessary libraries.

[ ]:
import numpy as np
import matplotlib.pyplot as plt
import cechmate as cm
from persim import plot_diagrams
import tadasets

Rips Filtrations

First, we show how to do a rips filtration (NOTE: The library is strongly recommended in this case, so this is mainly to show syntax)

# Initialize a noisy circle
X = tadasets.dsphere(n=100, d=1, r=1, noise=0.2)
# Instantiate and build a rips filtration
rips = cm.Rips(max_dim=1) #Go up to 1D homology
dgmsrips = rips.diagrams()
Constructing boundary matrix...
Finished constructing boundary matrix (Elapsed Time 2.44)
Computing persistence pairs...
Finished computing persistence pairs (Elapsed Time 1.74)
plt.scatter(X[:, 0], X[:, 1])
plt.title("Point Cloud")
plt.title("Rips Persistence Diagrams")

Cech Filtrations

Let’s try computing Cech filtrations.

[ ]:
cech = cm.Cech(max_dim=1) #Go up to 1D homology
dgmscech = cech.diagrams() * 2
[ ]:
plot_diagrams(dgmsrips + dgmscech, labels = ['$H_0$ Rips', '$H_1$ Rips', '$H_0$ Cech', '$H_1$ Cech'])

Alpha Filtrations

Now we will perform an alpha filtration on the exact same point cloud.

[ ]:
alpha = cm.Alpha()
filtration =*X) # Alpha goes by radius instead of diameter
dgmsalpha = alpha.diagrams(filtration)
[ ]:
plot_diagrams(dgmsrips + dgmsalpha, labels = ['$H_0$ Rips', '$H_1$ Rips', '$H_0$ Alpha', '$H_1$ Alpha'])

Note that the alpha filtration is substantially faster than the Rips filtration, and it is also more geometrically accurate. In rips, we add a triangle the moment its edges are added, but growing balls around their vertices do not necessarily cover the triangle at that point, as they are in the Cech filtration. Alpha is the intersection of Cech balls with Voronoi regions, so it is a strict subset of Cech. Hence, it takes a larger scale to add triangles, so the classes die slightly later.

Now let’s try an example with a 400 points sampled from a 4-sphere in 5 dimensions.

[ ]:
X = tadasets.dsphere(n=400, r=1, d=4)

alpha = cm.Alpha()
filtration =
dgms = alpha.diagrams(filtration)

As expected, the only nontrivial homology is in \(H_4\).

Normally computing \(H_4\) with that number of points would grind Rips to a halt, but it runs in a reasonable amount of time with Alpha. The bottleneck with Alpha is constructing the filtration and computing many circumcenters. Note that computing the persistence pairs takes even less time than H1 for Rips with only 100 points shown above.

Custom filtration

If you have a point cloud and a set of simplices with times at which they are added, you can compute the persistence diagrams associated to the custom filtration you’ve defined. For instance, assume we want to compute a filtration where 4 vertices enter at time 0 and the edges and triangles are added in the pattern below (note how the triangles are not added the moment all of their edges are added, unlike Rips):

Then we can execute the following code:

[ ]:
filtration = [([0], 0),
            ([1], 0),
            ([2], 0),
            ([3], 0),
            ([0, 1], 1),
            ([0, 2], 1),
            ([1, 2], 2),
            ([0, 1, 2], 4),
            ([0, 3], 2),
            ([2, 3], 3),
            ([0, 2, 3], 6)]
#Compute persistence diagrams
dgms = cm.phat_diagrams(filtration, show_inf = True)
print("H0:\n", dgms[0])
print("H1:\n", dgms[1])
[ ]: