Subject
Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference32 articles.
1. The coupon-collector’s problem revisited;Adler;J. Appl. Probab.,2003
2. Emergence of scaling in random networks;Barabási;Science,1999
3. C. Barrett, R. Beckman, M. Khan, V. Kumar, M. Marathe, P. Stretz, T. Dutta, B. Lewis, Generation and analysis of large synthetic social contact networks, in: Proceedings of the 2009 Winter Simulation Conference, WSC, 2009, pp. 1003–1014.
4. Fast parallel algorithms for edge-switching to achieve a target visit rate in heterogeneous graphs;Bhuiyan,2014
5. A sequential importance sampling algorithm for generating random graphs with prescribed degrees;Blitzstein;Internet Math.,2011
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献