Evidence map›Paper›PMID 37436987›Full record

ArticleScience advances2023

Community detection in large hypergraphs.

Nicolò Ruggeri, Martina Contisciani, Federico Battiston, Caterina De Bacco

Abstract read
In one paragraph

Article in Science advances, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers.

0numbers the graph read from it
0cells of the map it votes in
11citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

11 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Review
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Hyperedge prediction and the statistical mechanisms of higher-order and lower-order interactions in complex networks.Proceedings of the National Academy of Sciences of the United States of America · 2023
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Nicolò RuggeriMax Planck Institute for Intelligent Systems, Cyber Valley, 72076 Tübingen, Germany.ORCID 0000-0001-6847-9001
Martina ContiscianiMax Planck Institute for Intelligent Systems, Cyber Valley, 72076 Tübingen, Germany.ORCID 0000-0002-6103-5499
Federico BattistonDepartment of Network and Data Science, Central European University, 1100 Vienna, Austria.ORCID 0000-0001-9646-6232
Caterina De BaccoMax Planck Institute for Intelligent Systems, Cyber Valley, 72076 Tübingen, Germany.ORCID 0000-0002-8634-0211

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Hypergraphs, describing networks where interactions take place among any number of units, are a natural tool to model many real-world social and biological systems. Here, we propose a principled framework to model the organization of higher-order data. Our approach recovers community structure with accuracy exceeding that of currently available state-of-the-art algorithms, as tested in synthetic benchmarks with both hard and overlapping ground-truth partitions. Our model is flexible and allows capturing both assortative and disassortative community structures. Moreover, our method scales orders of magnitude faster than competing algorithms, making it suitable for the analysis of very large hypergraphs, containing millions of nodes and interactions among thousands of nodes. Our work constitutes a practical and general tool for hypergraph analysis, broadening our understanding of the organization of real-world higher-order systems.

Identifiers

PMID37436987
PMCPMC10337898

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.