114 citations · 114 across the 1 of their papers we have counts for
3 papers
cond-mat.stat-mech2004★ 114 cited
Solution for the properties of a clustered network
Juyong Park, M. E. J. Newman
We study Strauss's model of a network with clustering and present an analytic mean-field solution which is exact in the limit of large network size. Previous computer simulations h…
cond-mat.stat-mech2002
Random graphs as models of networks
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…
cond-mat.stat-mech2000
Models of the Small World: A Review
M. E. J. Newman
It is believed that almost any pair of people in the world can be connected to one another by a short chain of intermediate acquaintances, of typical length about six. This phenome…