Protean graphs with a variety of ranking schemes
暂无分享,去创建一个
[1] Anthony Bonato,et al. A course on the Web graph , 2008 .
[2] Santo Fortunato,et al. Scale-free network growth by ranking. , 2006, Physical review letters.
[3] Christian Borgs,et al. First to market is not everything: an analysis of preferential attachment with fitness , 2007, STOC '07.
[4] Jonathan L. Gross,et al. Handbook of graph theory , 2007, Discrete mathematics and its applications.
[5] Nicholas C. Wormald,et al. Growing Protean Graphs , 2007, Internet Math..
[6] Svante Janson,et al. Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.
[7] Pawel Pralat,et al. Rank-Based Attachment Leads to Power Law Graphs , 2010, SIAM J. Discret. Math..
[8] Elisa Schae. Review of a course on the web graph by Anthony Bonato (American Mathematical Society, Providence, Rhode Island, USA) , 2009, SIGA.
[9] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[10] Svante Janson,et al. Random graphs , 2000, ZOR Methods Model. Oper. Res..
[11] S. Ross. A random graph , 1981 .
[12] N. Wormald. The differential equation method for random graph processes and greedy algorithms , 1999 .
[13] Andrei Z. Broder,et al. Graph structure in the Web , 2000, Comput. Networks.
[14] Tomasz Luczak,et al. Protean Graphs , 2006, Internet Math..
[15] Pawe L Pra Lat,et al. A NOTE ON THE DIAMETER OF PROTEAN GRAPHS , 2007 .
[16] Pawel Pralat. The diameter of protean graphs , 2008, Discret. Math..
[17] F. Chung,et al. Complex Graphs and Networks , 2006 .
[18] Pawe L Pra Lat,et al. CONNECTIVITY THRESHOLD AND RECOVERY TIME IN RANK-BASED MODELS FOR COMPLEX NETWORKS , 2011 .
[19] Nicholas C. Wormald,et al. Random graphs and asymptotics , 2004 .
[20] Joel H. Spencer,et al. Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.
[21] Pawe L Pra Lat,et al. Protean Graphs with a Variety of Ranking Schemes , 2008, COCOA.