MétaCan
Menu
Back to cohort
Record W4409421084 · doi:10.1002/mma.10963

Disease Transmission on Random Graphs Using Edge‐Based Percolation

2025· article· en· W4409421084 on OpenAlexafffund
Sicheng Zhao, F. M. G. Magpantay

Bibliographic record

VenueMathematical Methods in the Applied Sciences · 2025
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsQueen's University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsPercolation (cognitive psychology)Random graphEnhanced Data Rates for GSM EvolutionTransmission (telecommunications)Statistical physicsCombinatoricsGraphArtificial intelligenceTelecommunicationsPhysicsComputer science

Abstract

fetched live from OpenAlex

ABSTRACT Edge‐based percolation methods can be used to analyze disease transmission on complex social networks. This allows us to include complex social heterogeneity in our models while maintaining tractability. Here, we begin by reviewing the seminal works on this field in previous studies by Newman et al. (2002, 2003) and Miller et al. (2012). We present a unified discussion of the theoretical background behind these models, including a detailed derivation of some of the major results. We also demonstrate the connections between these studies and the classical literature in random graph theory as detailed in Molloy and Reed (1995, 1998). Finally, we also present an accompanying R package that takes epidemic and network parameters as input and generates estimates of the epidemic trajectory and final size. This manuscript and the R package were developed to help researchers easily understand and use network models to investigate the interaction between different community structures and disease transmission.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.008
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.002
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.063
GPT teacher head0.429
Teacher spread0.366 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2025
Admission routes2
Has abstractyes

Explore more

Same venueMathematical Methods in the Applied SciencesSame topicComplex Network Analysis TechniquesFrench-language works237,207