Ontology highlight
ABSTRACT:
SUBMITTER: St-Onge G
PROVIDER: S-EPMC6839824 | biostudies-literature | 2019 Jul
REPOSITORIES: biostudies-literature
St-Onge Guillaume G Young Jean-Gabriel JG Hébert-Dufresne Laurent L Dubé Louis J LJ
Computer physics communications 20190219
Efficient stochastic simulation algorithms are of paramount importance to the study of spreading phenomena on complex networks. Using insights and analytical results from network science, we discuss how the structure of contacts affects the efficiency of current algorithms. We show that algorithms believed to require O(log N) or even O(1) operations per update-where <i>N</i> is the number of nodes-display instead a polynomial scaling for networks that are either dense or sparse and heterogeneous ...[more]