Pith. sign in

REVIEW 1 cited by

Higher-order organization of complex networks

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 1612.08447 v1 pith:57ZRZFXH submitted 2016-12-26 cs.SI cs.DMphysics.soc-ph

classification cs.SIcs.DMphysics.soc-ph
keywords networkshigher-ordercomplexconnectivityframeworkorganizationpatternsclustering
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Networks are a fundamental tool for understanding and modeling complex systems in physics, biology, neuroscience, engineering, and social science. Many networks are known to exhibit rich, lower-order connectivity patterns that can be captured at the level of individual nodes and edges. However, higher-order organization of complex networks---at the level of small network subgraphs---remains largely unknown. Here we develop a generalized framework for clustering networks based on higher-order connectivity patterns. This framework provides mathematical guarantees on the optimality of obtained clusters and scales to networks with billions of edges. The framework reveals higher-order organization in a number of networks including information propagation units in neuronal networks and hub structure in transportation networks. Results show that networks exhibit rich higher-order organizational structures that are exposed by clustering based on higher-order connectivity patterns.

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