Evidence map›Paper›PMID 42649660›Full record

ArticleEntropy (Basel, Switzerland)2026

The Efficiency of Clusters on Networks and Their Robustness.

Silu Wang, Qingyuan Hu, Jiao Gu

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 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

3 authors.

Silu WangSchool of Mathematics and Data Science, Jiangnan University, Wuxi 214122, China.ORCID 0009-0005-3780-5819
Qingyuan HuSchool of Mathematics and Data Science, Jiangnan University, Wuxi 214122, China.ORCID 0000-0002-7451-1159
Jiao GuSchool of Mathematics and Data Science, Jiangnan University, Wuxi 214122, China.ORCID 0000-0001-7503-3104

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Cluster structures are widespread in complex networks, yet conventional network-level measures do not distinguish the accessibility provided inside a cluster from that provided through its external links. This study asks how these two topological contributions can be measured consistently and how rapidly they deteriorate under different node-removal mechanisms. We define internal and external cluster efficiency by combining edge volume, relative cluster size, and a harmonic shortest-path factor based on the mean reciprocal distance rather than the reciprocal of an arithmetic mean distance. The measures are evaluated together with a Cluster Robustness Index (CRI) and Structural Resilience Entropy (SRE) on Barabási-Albert and Lancichinetti-Fortunato-Radicchi networks and five empirical network topologies under six attack strategies. The results show that smaller clusters are generally more vulnerable to attacks on central nodes, whereas larger and less centralized clusters retain more topological efficiency. A source-level audit also shows that replacing the reciprocal of the arithmetic mean distance by the arithmetic mean of reciprocal distances changes most normalized trends only slightly; the clearest quantitative changes occur in the weighted-average efficiency panels. Intra-cluster edge addition increases internal efficiency by 1-5% and CRI-based robustness by up to 11.9%, while cross-cluster edge rewiring improves external efficiency by up to 2.45% and CRI-based robustness by up to 2.33% under the tested targeted attacks. The reported quantities are structural proxies derived from unweighted network topology; they do not represent observed flow, transmission speed, recovery dynamics, or domain-specific functionality. The framework therefore supports cluster-level vulnerability diagnosis and topology-oriented reinforcement without making claims beyond the available network data.

Indexed as

attack strategiescluster efficiencycomplex networksrobustnesstopology optimization

Identifiers

PMID42649660
PMCPMC13512097

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.