114 citations · 114 across the 1 of their papers we have counts for
1 paper · 1 filter
M. E. J. Newman
The random graph of Erdos and Renyi is one of the oldest and best studied models of a network, and possesses the considerable advantage of being exactly solvable for many of its av…