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

Quasi-Random Influences of Boolean Functions., and . CoRR, (2022)¨ m Method Spectral Grouping Using the Nystro, , , and . 26 (2): 214--225 (2004)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)Subgraph Counts in Random Clustering Graphs., and . WAW, volume 14671 of Lecture Notes in Computer Science, page 1-16. Springer, (2024)A Random Graph Model for Clustering Graphs., and . WAW, volume 13894 of Lecture Notes in Computer Science, page 112-126. Springer, (2023)The diameter of random sparse graphs, and . Adv. Appl. Math., (2001)Eigenvalues of Random Power Law Graphs, , and . Annals of Combinatorics, 7 (1): 21--33 (2003)Connected components in random graphs with given degree sequences, and . Annals of Combinatorics, (2002)The average distances in random graphs with given expected degrees, and . Proceedings of the National Academy of Sciences, 99 (25): 15879-15882 (2002)A Local Clustering Algorithm for Connection Graphs., and . WAW, volume 8305 of Lecture Notes in Computer Science, page 26-43. Springer, (2013)