Author of the publication

The average distances in random graphs with given expected degrees

, and . Proceedings of the National Academy of Sciences, 99 (25): 15879-15882 (2002)
DOI: 10.1073/pnas.252631999

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Brief Survey of PageRank Algorithms.. IEEE Trans. Network Science and Engineering, 1 (1): 38-42 (2014)Decomposition of Random Graphs into Complete Bipartite Graphs., and . SIAM J. Discret. Math., 30 (1): 296-310 (2016)The maximum relaxation time of a random walk., , , and . Adv. Appl. Math., (2018)¨ m Method Spectral Grouping Using the Nystro, , , and . 26 (2): 214--225 (2004)The Spectral Gap of Graphs Arising From Substring Reversals., and . Electron. J. Comb., 24 (3): 3 (2017)Quasi-Random Influences of Boolean Functions., and . CoRR, (2022)Primitive Juggling Sequences., and . Am. Math. Mon., 115 (3): 185-194 (2008)A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification, and . WAW, volume 6516 of Lecture Notes in Computer Science, page 2-14. Springer, (2010)The Diameter of Sparse Random Graphs., and . Adv. Appl. Math., 26 (4): 257-279 (2001)A Local Clustering Algorithm for Connection Graphs., and . Internet Math., 11 (4-5): 333-351 (2015)