Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.13977 v1 pith:AAEORU27 submitted 2023-06-24 physics.soc-ph cond-mat.dis-nnnlin.AO

A Generative Hypergraph Model for Double Heterogeneity

classification physics.soc-ph cond-mat.dis-nnnlin.AO
keywords modelhyperedgenetworkbecomecomplexgenerativeheterogeneityhypergraph
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

While network science has become an indispensable tool for studying complex systems, the conventional use of pairwise links often shows limitations in describing high-order interactions properly. Hypergraphs, where each edge can connect more than two nodes, have thus become a new paradigm in network science. Yet, we are still in lack of models linking network growth and hyperedge expansion, both of which are commonly observable in the real world. Here, we propose a generative hypergraph model by employing the preferential attachment mechanism in both nodes and hyperedge formation. The model can produce bi-heterogeneity, exhibiting scale-free distributions in both hyperdegree and hyperedge size. We provide a mean-field treatment that gives the expression of the two scaling exponents, which agree with the numerical simulations. Our model may help to understand the networked systems showing both types of heterogeneity and facilitate the study of complex dynamics thereon.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.