Pith. sign in

REVIEW 1 cited by

Simplicial Closure and higher-order link prediction

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 1802.06916 v2 pith:3HA2P3UP submitted 2018-02-20 cs.SI cond-mat.stat-mechmath.ATphysics.soc-phstat.ML

classification cs.SIcond-mat.stat-mechmath.ATphysics.soc-phstat.ML
keywords higher-orderinteractionsratherstructuredatasetslinkpredictionconsistent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Networks provide a powerful formalism for modeling complex systems by using a model of pairwise interactions. But much of the structure within these systems involves interactions that take place among more than two nodes at once; for example, communication within a group rather than person-to person, collaboration among a team rather than a pair of coauthors, or biological interaction between a set of molecules rather than just two. Such higher-order interactions are ubiquitous, but their empirical study has received limited attention, and little is known about possible organizational principles of such structures. Here we study the temporal evolution of 19 datasets with explicit accounting for higher-order interactions. We show that there is a rich variety of structure in our datasets but datasets from the same system types have consistent patterns of higher-order structure. Furthermore, we find that tie strength and edge density are competing positive indicators of higher-order organization, and these trends are consistent across interactions involving differing numbers of nodes. To systematically further the study of theories for such higher-order structures, we propose higher-order link prediction as a benchmark problem to assess models and algorithms that predict higher-order structure. We find a fundamental differences from traditional pairwise link prediction, with a greater role for local rather than long-range information in predicting the appearance of new interactions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Representing Higher-Order Networks with Spectral Moments

    cs.SI 2025-05 reject novelty 5.0 of 10

    Spectral moments of random walks on s-walk dyadic conversions of hypergraphs are proposed as a whole-graph representation and achieve strong classification accuracy, though key theoretical bounds contain errors.

Pith tools