English

Deterministic simplicial complexes

Combinatorics 2026-01-23 v1 Disordered Systems and Neural Networks Statistical Mechanics Physics and Society

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 nn-th step, every existing dd-dimensional simplex (dn1d\leq n-1) joins a new vertex forming a (d+1)(d+1)-dimensional simplex; all 2d+122^{d+1}-2 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 n!n!, and the upper-degree distributions follow a power law. Here, the upper degree (or dd-degree) of a dd-simplex refers to the number of (d+1)(d{+}1)-simplices that share it as a face. Interestingly, the dd-degree distributions evolve quite differently for different values of dd. We compute the Hodge Laplacian spectra of simplicial complexes and show that the spectral and Hausdorff dimensions are infinite. We also explore a constrained version where the dimension of the added simplices is fixed to a finite value mm. In the constrained model, the number of simplices grows exponentially. In particular, for m=1m=1, the spectral dimension is 22. For m=2m=2, the spectral dimension is finite, and the degree distribution follows a power law, while the 11-degree distribution decays exponentially.

Keywords

Cite

@article{arxiv.2507.07402,
  title  = {Deterministic simplicial complexes},
  author = {S. N. Dorogovtsev and P. L. Krapivsky},
  journal= {arXiv preprint arXiv:2507.07402},
  year   = {2026}
}

Comments

20 pages, 13 figures