Evidence map›Paper›PMID 39850077›Full record

ArticlePNAS nexus2025

Flexible inference in heterogeneous and attributed multilayer networks.

Martina Contisciani, Marius Hobbhahn, Eleanor A Power, Philipp Hennig, Caterina De Bacco

Abstract read
In one paragraph

Article in PNAS nexus, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing 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

2 citing papers in PubMed.

  1. Article
  2. 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

5 authors.

Martina ContiscianiMax Planck Institute for Intelligent Systems, Tübingen 72076, Germany.ORCID https://orcid.org/0000-0002-6103-5499
Marius HobbhahnTübingen AI Center, University of Tübingen, Tübingen 72076, Germany.
Eleanor A PowerDepartment of Methodology, London School of Economics and Political Sciences, London WC2A 2AE, United Kingdom.ORCID https://orcid.org/0000-0002-3064-2050
Philipp HennigTübingen AI Center, University of Tübingen, Tübingen 72076, Germany.ORCID https://orcid.org/0000-0001-7293-6092
Caterina De BaccoMax Planck Institute for Intelligent Systems, Tübingen 72076, Germany.ORCID https://orcid.org/0000-0002-8634-0211

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Networked datasets can be enriched by different types of information about individual nodes or edges. However, most existing methods for analyzing such datasets struggle to handle the complexity of heterogeneous data, often requiring substantial model-specific analysis. In this article, we develop a probabilistic generative model to perform inference in multilayer networks with arbitrary types of information. Our approach employs a Bayesian framework combined with the Laplace matching technique to ease interpretation of inferred parameters. Furthermore, the algorithmic implementation relies on automatic differentiation, avoiding the need for explicit derivations. This makes our model scalable and flexible to adapt to any combination of input data. We demonstrate the effectiveness of our method in detecting overlapping community structures and performing various prediction tasks on heterogeneous multilayer data, where nodes and edges have different types of attributes. Additionally, we showcase its ability to unveil a variety of patterns in a social support network among villagers in rural India by effectively utilizing all input information in a meaningful way.

Indexed as

attributed multilayer networksautomatic differentiationLaplace approximationoverlapping communitiesprobabilistic generative models

Identifiers

PMID39850077
PMCPMC11756377

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.