ArticlePloS one2025
Edge percolation centrality: A new measure to quantify the influence of edges during percolation in networks.
Article in PloS one, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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.
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.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Numerous centrality measures exist to quantify the influence of edges within a network, with edge betweenness being one of the more well-known measures. However, such measures are inadequate in network percolation scenarios (e.g., the transmission of a disease over a transportation network of highways) as they fail to consider the changing percolation states of edges over time. This paper addresses this limitation by extending percolation centrality, a measure originally developed to evaluate the influence of vertices during a percolation process (i.e., a dynamic spread of a contagion) in the network, to the edge level. The proposed measure, edge percolation centrality, captures both the topological connectivity of the network as well as the percolation states of the edges. Although the algorithm's observed complexity of [Formula: see text] makes it computationally intensive, the utility of the proposed edge measure is evident in its application to both synthetic and real-world networks undergoing percolation processes.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.