{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001153022,0.0001559595,0.0002743049,0.00008050145,0.0002540489,0.00006077343,0.000331907,0.00002650687,0.00001069595],"category_scores_gemma":[7.174927e-7,0.0001703999,0.00007819373,0.0004582657,0.00009107558,0.00006303238,0.0003880591,0.0001912579,0.000003057095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003540594,"about_ca_system_score_gemma":0.00002480033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008032712,"about_ca_topic_score_gemma":0.000001173662,"domain_scores_codex":[0.9991149,0.00009412188,0.0002879222,0.0002274599,0.0001184589,0.0001571344],"domain_scores_gemma":[0.9983394,0.0002873577,0.0002539377,0.000886219,0.0001943904,0.00003871337],"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.00001118602,0.0007737438,0.01042096,0.00005890045,0.000222288,6.434728e-8,0.0004943729,0.8034074,0.004182911,0.04986767,0.00006795646,0.1304925],"study_design_scores_gemma":[0.0001697254,0.0000396705,0.001258,0.0001858735,0.00004800411,7.153989e-7,0.00003232232,0.9956583,0.000183311,0.002177112,0.00009172325,0.000155293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1079949,0.00006081176,0.890898,0.00002528557,0.0000383664,0.0002769433,0.0000123536,0.00006299389,0.0006303072],"genre_scores_gemma":[0.7622125,0.000006720809,0.2374576,0.00002039405,0.0001450637,0.00001043295,0.000129377,0.00001547153,0.000002399954],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6542176,"threshold_uncertainty_score":0.6948707,"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."}}