Connectivity threshold and recovery time in rank-based models for complex networks
暂无分享,去创建一个
[1] Svante Janson,et al. Random graphs , 2000, ZOR Methods Model. Oper. Res..
[2] Pawel Pralat,et al. Rank-Based Attachment Leads to Power Law Graphs , 2010, SIAM J. Discret. Math..
[3] Anthony Bonato,et al. A course on the Web graph , 2008 .
[4] Daniel W. Lozier,et al. NIST Digital Library of Mathematical Functions , 2003, Annals of Mathematics and Artificial Intelligence.
[5] Andrei Z. Broder,et al. Graph structure in the Web , 2000, Comput. Networks.
[6] Nicholas C. Wormald,et al. Random graphs and asymptotics , 2004 .
[7] Joel H. Spencer,et al. Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.
[8] Pawel Pralat,et al. Protean graphs with a variety of ranking schemes , 2009, Theor. Comput. Sci..
[9] Santo Fortunato,et al. Scale-free network growth by ranking. , 2006, Physical review letters.
[10] Pawel Pralat. The diameter of protean graphs , 2008, Discret. Math..
[11] Nicholas C. Wormald,et al. Growing Protean Graphs , 2007, Internet Math..
[12] N. Wormald. The differential equation method for random graph processes and greedy algorithms , 1999 .