Construction of Simplicial Complexes with Prescribed Degree-Size Sequences

06/01/2021 ∙ by Tzu-Chi Yen, et al. ∙ University of Colorado Boulder 0

We study the realizability of simplicial complexes with a given pair of integer sequences, representing the node degree distribution and facet size distribution, respectively. While the s-uniform variant of the problem is 𝖭𝖯-complete when s ≥ 3, we identify two populations of input sequences, most of which can be solved in polynomial time using a recursive algorithm that we contribute. Combining with a sampler for the simplicial configuration model [Young et al., Phys. Rev. E 96, 032312 (2017)], we facilitate efficient sampling of simplicial ensembles from arbitrary degree and size distributions. We find that, contrary to expectations based on dyadic networks, increasing nodes' degrees reduces the number of loops in simplicial complexes. Our work unveils a fundamental constraint on the degree-size sequences and sheds light on further analysis of higher-order phenomena based on local structures.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

page 5

page 6

Code Repositories

simplicial-test

A backtracking-based algorithm to check if a given degree-size sequence can realize a simplicial complex


view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

References