Paperlane

no. 15 · Monday 16 November 2026

Random Abstract Cell Complexes

Josef Hoppe and Michael T. Schaub

math.AT · v3 · code · 9 pp

Abstract

In machine learning and signal processing, methods based on (abstract) cell complexes (CCs) are being applied successfully in different applications. However, there is currently a lack of random models, which are necessary for a thorough evaluation of these methods, both by generating synthetic data and as null models to compare results to. We fill this gap by defining a random model for abstract cell complexes based on independent inclusion probabilities, similar to the Erdős-Rényi model for graphs. We also discuss how modifications to bias the model to incorporate more structure can be implemented. The model can also be used to lift a graph (or other cell complex) to a cell complex of arbitrary dimension. The main challenge in this is that the number of cycles (possible 2-cells) on graphs is exponential, and the same is true in higher dimensions. We overcome this complexity with an approximate sampling algorithm limited to 2-cells (polygons) that is based on a recent advance in sampling cycles on a graph. Using this algorithm, we analyze the properties of random 2-dimensional CCs and showcase its usage as a performance baseline for both topological signal processing and topological deep learning. The algorithm is available in the package py-raccoon on the Python Package Index.

code
github.com/josefhoppe/random-abstract-cell-complexes
comments
9 pages, 7 figures (plus appendix). For evaluation code, see https://github.com/josefhoppe/random-abstract-cell-complexes
fields
Algebraic Topology
pdf ↗ page arXiv:2406.01999 ↗