Discovery of Nodal Attributes through a Rank-Based Model of Network Structure
暂无分享,去创建一个
[1] F. Chung,et al. Complex Graphs and Networks , 2006 .
[2] Pawel Pralat. The diameter of protean graphs , 2008, Discret. Math..
[3] David Lazer,et al. The co‐evolution of individual and network , 2001 .
[4] Cun-Quan Zhang,et al. Emergence of segregation in evolving social networks , 2011, Proceedings of the National Academy of Sciences.
[5] Mark E. J. Newman,et al. The Structure and Function of Complex Networks , 2003, SIAM Rev..
[6] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .
[7] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[8] Svante Janson,et al. Random graphs , 2000, ZOR Methods Model. Oper. Res..
[9] Anthony Bonato,et al. A course on the Web graph , 2008 .
[10] Anthony Bonato,et al. A Spatial Web Graph Model with Local Influence Regions , 2007, Internet Math..
[11] Pawe L Pra Lat,et al. CONNECTIVITY THRESHOLD AND RECOVERY TIME IN RANK-BASED MODELS FOR COMPLEX NETWORKS , 2011 .
[12] Pawel Pralat,et al. Connectivity threshold and recovery time in rank-based models for complex networks , 2011, Discret. Math..
[13] Rory Wilson,et al. Estimating node similarity from co-citation in a spatial graph model , 2010, SAC '10.
[14] Pawel Pralat,et al. Rank-Based Models of Network Structure and the Discovery of Content , 2011, WAW.
[15] Svante Janson,et al. Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.
[16] Nicholas C. Wormald,et al. Growing Protean Graphs , 2007, Internet Math..
[17] Pawel Pralat,et al. Protean graphs with a variety of ranking schemes , 2009, Theor. Comput. Sci..
[18] Santo Fortunato,et al. Scale-free network growth by ranking. , 2006, Physical review letters.
[19] Stanley Wasserman,et al. Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.
[20] Nicholas C. Wormald,et al. Random graphs and asymptotics , 2004 .
[21] Joel H. Spencer,et al. Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.
[22] N. Wormald. The differential equation method for random graph processes and greedy algorithms , 1999 .
[23] Tomasz Luczak,et al. Protean Graphs , 2006, Internet Math..
[24] Pawe L Pra Lat,et al. A NOTE ON THE DIAMETER OF PROTEAN GRAPHS , 2007 .
[25] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[26] Pawel Pralat,et al. Rank-Based Attachment Leads to Power Law Graphs , 2010, SIAM J. Discret. Math..