Evidence map›Paper›PMID 42481486›Full record

ArticleNature communications2026

Modeling network evolution by multi-agent reinforcement learning.

Dong Li, Tianwei Lin, Zhaoyang Bao, Bingqiao Gu, Yatao Zhang, Fei Yang, Yanhao Sun, Zhanwei Du, Petter Holme

Abstract read
In one paragraph

Article in Nature communications, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

9 authors.

Dong LiSchool of Mechanical, Electrical and Information Engineering, Shandong University, Weihai, China.
Tianwei LinSchool of Mechanical, Electrical and Information Engineering, Shandong University, Weihai, China.
Zhaoyang BaoSchool of Mechanical, Electrical and Information Engineering, Shandong University, Weihai, China.
Bingqiao GuSchool of Mechanical, Electrical and Information Engineering, Shandong University, Weihai, China.
Yatao ZhangSchool of Mechanical, Electrical and Information Engineering, Shandong University, Weihai, China.
Fei YangSchool of Mechanical, Electrical and Information Engineering, Shandong University, Weihai, China.
Yanhao SunSchool of Computer Science and Technology, Xi'an Jiaotong University, Xi'an, China. yanhaosun18@gmail.com.ORCID http://orcid.org/0009-0004-4353-3322
Zhanwei DuSchool of Public Health and Emergency Management, Southern University of Science and Technology, Shenzhen, China. duzw@sustech.edu.cn.ORCID http://orcid.org/0000-0002-2020-767X
Petter HolmeDepartment of Computer Science, Aalto University, Espoo, Finland. petter.holme@aalto.fi.ORCID http://orcid.org/0000-0003-2156-1096

Funding

National Natural Science Foundation of China (National Science Foundation of China) 62376136, 62076149, 12471330Natural Science Foundation of Guangdong Province (Guangdong Natural Science Foundation) 2024A1515011935
6 · The paper itself

Abstract

Modeling network evolution is foundational for understanding and regulating networks. Existing models simplify away the fact that network evolution is often a group decision process, leading to two primary limitations: that nodes lack the ability to learn policy and that there is no coordination among node policies. To address these shortcomings and consider the effectiveness of multi-agent reinforcement learning in solving group decision tasks, this paper proposes a complex Network Evolution model based on Multi-Agent Reinforcement Learning (NEMARL). In our model, swarm intelligence emerging through collaborative interactions among autonomous nodes drives the evolution of the network structure. Our extensive experiments demonstrate that the NEMARL model accurately reproduces classical network characteristics and fits real network data well. Furthermore, we demonstrate its effectiveness through scenario testing.

Identifiers

PMID42481486
PMCPMC13500852

What OpenQuestion holds

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