{"id":"W2885426747","doi":"10.1016/j.cpc.2019.02.008","title":"Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm","year":2019,"lang":"en","type":"article","venue":"Computer Physics Communications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"National Institute of General Medical Sciences; Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; National Science Foundation; National Institutes of Health; Canada First Research Excellence Fund","keywords":"Computer science; Algorithm; Computation; Node (physics); Sampling (signal processing); Scaling; Range (aeronautics); Markov process; Set (abstract data type); Complex network; Time complexity; Binary logarithm; Network dynamics; Markov chain; Theoretical computer science; Mathematics; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003471849,0.0006839653,0.001081332,0.0009669496,0.000782426,0.001155417,0.001817688,0.00132382,0.001845446],"category_scores_gemma":[0.0137465,0.0005608564,0.0006974826,0.0007602698,0.001261273,0.001824116,0.001736387,0.001627331,0.0006576822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007155862,"about_ca_system_score_gemma":0.001167877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002719639,"about_ca_topic_score_gemma":0.002485492,"domain_scores_codex":[0.9984626,0.0006930243,0.00007279301,0.0002067065,0.0004532202,0.0001116045],"domain_scores_gemma":[0.9924201,0.005107191,0.0004697363,0.000991397,0.0007357283,0.0002757784],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004437653,0.000187588,0.002499184,0.0001075171,0.00007644471,0.0001432005,0.0002843341,0.7861587,0.01648677,0.07105461,0.001038104,0.1215198],"study_design_scores_gemma":[0.0000136201,0.00001493233,0.00004674974,0.00000176059,0.000002660992,0.0000164979,0.000004350929,0.9941658,0.00102885,0.004514328,0.0001868204,0.000003704338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01129661,0.00001991078,0.9880019,0.00005144441,0.000008504182,0.00003620146,0.000008089572,0.0001869295,0.0003904564],"genre_scores_gemma":[0.2720993,0.00009201689,0.7252681,0.00008110324,0.00005331211,0.0002441755,0.0001172,0.0001407949,0.001903943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003471849,"threshold_uncertainty_score":0.01836115,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04759234340524349,"score_gpt":0.3107841496008659,"score_spread":0.2631918061956224,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}