114 citations · 305 across the 7 of their papers we have counts for
5 papers · 1 filter
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…
The statistical mechanics of networks
Juyong Park, M. E. J. Newman
We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizin…
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…
Why social networks are different from other types of networks
M. E. J. Newman, Juyong Park
We argue that social networks differ from most other types of networks, including technological and biological networks, in two important ways. First, they have non-trivial cluster…
The origin of degree correlations in the Internet and other networks
Juyong Park, M. E. J. Newman
It has been argued that the observed anticorrelation between the degrees of adjacent vertices in the network representation of the Internet has its origin in the restriction that n…