2021
DOI: 10.48550/arxiv.2106.00185
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Construction of simplicial complexes with prescribed degree-size sequences

Tzu-Chi Yen

Abstract: 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 NP-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… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 46 publications
(50 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?