Evidence map›Paper›PMID 41865019›Full record

ArticleScientific reports2026

On the min-entropy of equilibrium graphs in network creation games.

Chuang-Chieh Lin, Chih-Chieh Hung

Abstract read
In one paragraph

Article in Scientific reports, 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

2 authors.

Chuang-Chieh Lin *Department of Computer Science and Engineering, National Taiwan Ocean University, No. 2, Beining Rd., Jhongjheng Dist., Keelung City, 202301, Taiwan.
Chih-Chieh Hung *Department of Management Information Systems, National Chung Hsing University, No.145, Taichung City, 402202, Taiwan. smalloshin@nchu.edu.tw.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

This paper investigates the Equilibrium Graph Min-Entropy (EGME) of network creation games, aiming to quantify the underlying structural complexity of equilibrium graphs formed by strategic agents. Building upon classical network creation models, we define EGME based on the probability distribution derived from each agent's social cost relative to the total social cost. Our analysis provides exact characterizations of EGME for various edge establishment cost regimes, including explicit results for small edge-cost values ([Formula: see text]) and general bounds for larger edge-cost values ([Formula: see text]). Comprehensive simulation experiments demonstrate that EGME effectively distinguishes structural variations induced by changes in network size and edge-cost parameters, exhibiting strong correlations with established global network metrics such as graph density, diameter, and betweenness centrality. These results highlight the utility of EGME as a robust measure for assessing structural complexity and network stability in strategic network formation scenarios.

Indexed as

Equilibrium graphGraph entropyNetwork creation game

Identifiers

PMID41865019
PMCPMC13144299

What OpenQuestion holds

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