2-simplices finder
Jupyter notebook to find all 2-simplices in a given DGL graph
Portfolio
Finding Simplicial Sets within a graph by using successive quotients
This Jupyter notebook encodes a solution to the problem of finding all n-simplices within a graph.
Left Kan Extension of a Delta Set
Constructing the coskeleton of a Delta set
CinchNET
GNN that message passes features within a simplex, essentially bottlenecking it within a simplex
Conway’s Game of Life in Reverse
Jupyter notebook to find initial configurationf of a given evolution of a Game of Life
Constructing a simplicial set
Python scripts to construct various simplicial sets in different circumstances
PseudoTop Vertex Neural Network
GNN that message passes features of pseudotop vertices, after a refinement
Simplicial Finder
Finding simplices of a directed graph using adjacency matrix