Evidence map›Paper›PMID 38517877›Full record

ArticlePloS one2024

Propagation and control of congestion risk in scale-free networks based on information entropy.

Huining Yan, Hua Li, Qiubai Sun, Yuxi Jiang

Open access · goldAbstract 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
0.6field-weighted citation impact, top 39% of its field
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, 2 citations in OpenAlex.

  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

4 authors at 2 institutions in 1 country.

Huining YanSchool of Electronic and Information Engineering, University of Science and Technology Liaoning, Anshan, Liaoning, China.
Hua LiSchool of Business Administration, University of Science and Technology Liaoning, Anshan, Liaoning, China.ORCID 0000-0003-0672-0618
Qiubai SunAsset Company, University of Science and Technology Liaoning, Anshan, Liaoning, China.
Yuxi JiangSchool of Economics and Management, Dalian Jiaotong University, Dalian, Liaoning, China.
University of Science and Technology Liaoning · CNDalian Jiaotong University · CN

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

To study the propagation pattern of congestion risk in the traffic network and enhance risk control capabilities, a model has been developed. This model takes into account the probabilities of five threats (the risk occurrence probability; the risk of loss; the unpredictability of risk; the uncontrollability of risk; the transferability of risk) in the traffic network to define the risk entropy and determine the risk capacity, analyze the mechanism of congestion risk propagation, and explore the impact of risk resistance, the average degree of risk capacity at intersections, and the degree of correlation on congestion risk propagation. Further, a control method model for risk propagation is proposed. Numerical simulation results demonstrate that the risk resistance parameter θ can inhibit the propagation of congestion risk during traffic congestion. The highest efficiency in controlling risk propagation is achieved when θ reaches a threshold value θ*. Furthermore, the average degree of intersection risk capacity α shows a positive correlation with θ* and a negative correlation with control efficiency. However, the degree of association ω has a negative effect on risk propagation control, decreasing the degree of association between nodes aids in risk propagation control.

Indexed as

EntropyComputer Simulation

Identifiers

PMID38517877
PMCPMC10959343
OpenAlexW4393079721

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.