4.9k citations · 17.5k across the 17 of their papers we have counts for
17 papers
A message passing approach for general epidemic models
Brian Karrer, M. E. J. Newman
In most models of the spread of disease over contact networks it is assumed that the probabilities per unit time of disease transmission and recovery from disease are constant, imp…
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…
Robustness of community structure in networks
Brian Karrer, Elizaveta Levina, M. E. J. Newman
The discovery of community structure is a common challenge in the analysis of network data. Many methods have been proposed for finding community structure, but few have been propo…
Finding community structure in networks using the eigenvectors of matrices
M. E. J. Newman
We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates tha…
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…