Evidence map›Paper›PMID 38483852›Full record

ArticlePloS one2024

Optimizing the robustness of higher-low order coupled networks.

Chunlin Zheng, Yonglin Hu, Chengjun Zhang, Wenbin Yu, Hui Yao, Yangsong Li, Cheng Fan, Xiaolin Cen

Abstract read
In one paragraph

Article in PloS one, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

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

1 citing paper in PubMed.

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

8 authors.

Chunlin ZhengSchool of Computer Science, Nanjing University of Information Science and Technology, Nanjing, China.
Yonglin HuSchool of Computer Science, Nanjing University of Information Science and Technology, Nanjing, China.
Chengjun ZhangSchool of Computer Science, Nanjing University of Information Science and Technology, Nanjing, China.ORCID 0000-0002-4458-5843
Wenbin YuSchool of Computer Science, Nanjing University of Information Science and Technology, Nanjing, China.
Hui YaoSchool of Computer Science, Nanjing University of Information Science and Technology, Nanjing, China.
Yangsong LiSchool of Computer Science, Nanjing University of Information Science and Technology, Nanjing, China.
Cheng FanSchool of Computer Science, Nanjing University of Information Science and Technology, Nanjing, China.
Xiaolin CenSchool of Computer Science, Nanjing University of Information Science and Technology, Nanjing, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Enhancing the robustness of complex networks is of great practical significance as it ensures the stable operation of infrastructure systems. We measure its robustness by examining the size of the largest connected component of the network after initial attacks. However, traditional research on network robustness enhancement has mainly focused on low-order networks, with little attention given to higher-order networks, particularly higher-low order coupling networks(the largest connected component of the network must exist in both higher-order and low-order networks). To address this issue, this paper proposes robust optimization methods for higher-low order coupled networks based on the greedy algorithm and the simulated annealing algorithm. By comparison, we found that the simulated annealing algorithm performs better. The proposed method optimizes the topology of the low-order network and the higher-order network by randomly reconnecting the edges, thereby enhancing the robustness of the higher-order and low-order coupled network. The experiments were conducted on multiple real networks to evaluate the change in the robustness coefficient before and after network optimization. The results demonstrate that the proposed method can effectively improve the robustness of both low-order and higher-order networks, ultimately enhancing the robustness of higher-low order coupled networks.

Indexed as

AlgorithmsModels, Theoretical

Identifiers

PMID38483852
PMCPMC10939264

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.