Evidence map›Paper›PMID 38547213›Full record

ArticlePloS one2024

Anti-modularization for both high robustness and efficiency including the optimal case.

Jaeho Kim, Yukio Hayashi

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

2 authors.

Jaeho KimDivison of Transdisciplinary Sciences, Japan Advanced Institute of Science and Technology, Nomi, Ishikawa, Japan.ORCID https://orcid.org/0009-0002-5984-8869
Yukio HayashiDivison of Transdisciplinary Sciences, Japan Advanced Institute of Science and Technology, Nomi, Ishikawa, Japan.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Although robustness of connectivity and modular structures in networks have been attracted much attentions in complex networks, most researches have focused on those two features in Erdos-Renyi random graphs and Scale-Free networks whose degree distributions follow Poisson and power-law, respectively. This paper investigates the effect of modularity on robustness in a modular d-regular graphs. Our results reveal that high modularity reduces the robustness even from the optimal robustness of a random d-regular graph in the pure effect of degree distributions. Moreover, we find that a low modular d-regular graph exhibits small-world property that average path length is O(logN). These results indicate that low modularity on modular structures leads to coexistence of both high robustness and efficiency of paths.

Identifiers

PMID38547213
PMCPMC10977745

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.