4.9k citations · 5.9k across the 4 of their papers we have counts for
5 papers · 1 filter
Random graphs with clustering
M. E. J. Newman
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the…
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…
Solution of the 2-star model of a network
Juyong Park, M. E. J. Newman
The p-star model or exponential random graph is among the oldest and best-known of network models. Here we give an analytic solution for the particular case of the 2-star model, wh…
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…
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…