Login / Signup

Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm.

Guillaume St-OngeJean-Gabriel YoungLaurent Hébert-DufresneLouis J. Dubé
Published in: Comput. Phys. Commun. (2019)
Keyphrases
  • complex networks
  • learning algorithm
  • sampling algorithm
  • k means
  • optimal solution
  • social network analysis
  • monte carlo
  • high precision
  • network structure
  • ranking algorithm