Deterministic simplicial complexes
S. N. Dorogovtsev, P. L. Krapivsky

TL;DR
This paper introduces a deterministic process for growing simplicial complexes from a single vertex, analyzing their structural properties, spectra, and dimensions, revealing complex behaviors like infinite growth and power-law degree distributions.
Contribution
It presents a novel deterministic model for simplicial complex growth and thoroughly analyzes its structural, spectral, and dimensional properties, including constrained versions.
Findings
Number of simplices grows faster than n!
Degree distributions follow power laws for certain dimensions
Spectral and Hausdorff dimensions are infinite
Abstract
We investigate simplicial complexes deterministically growing from a single vertex. In the first step, a vertex and an edge connecting it to the primordial vertex are added. The resulting simplicial complex has a 1-dimensional simplex and two 0-dimensional faces (the vertices). The process continues recursively: On the -th step, every existing dimensional simplex () joins a new vertex forming a dimensional simplex; all new faces are also added so that the resulting object remains a simplicial complex. The emerging simplicial complex has intriguing local and global characteristics. The number of simplices grows faster than , and the upper-degree distributions follow a power law. Here, the upper degree (or -degree) of a -simplex refers to the number of -simplices that share it as a face. Interestingly, the -degree distributions…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Graph theory and applications · Advanced Combinatorial Mathematics
