14.1k citations · 16k across the 11 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
cond-mat.stat-mech2007★ 78 cited
Bicomponents and the robustness of networks to failure
M. E. J. Newman, Gourab Ghoshal
A common definition of a robust connection between two nodes in a network such as a communication network is that there should be at least two independent paths connecting them, so…
cond-mat.stat-mech2007★ 97 cited
Component sizes in networks with arbitrary degree distributions
M. E. J. Newman
We give an exact solution for the complete distribution of component sizes in random networks with arbitrary degree distributions. The solution tells us the probability that a rand…