Random graphs with clustering.

  title={Random graphs with clustering.},
  author={Mark E. J. Newman},
  journal={Physical review letters},
  volume={103 5},
  • M. Newman
  • Published 24 March 2009
  • Computer Science
  • Physical review letters
We offer a solution to a long-standing problem in the theory of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity--the propensity for two neighbors of a network node also to be neighbors of one another. We show how standard random-graph models can be generalized to incorporate clustering and give exact solutions for various properties of the resulting networks, including sizes of network components, size of the giant component if there… 

Figures from this paper

Hierarchical Configuration Model

We introduce a class of random graphs with a community structure, which we call the hierarchical configuration model. On the inter-community level, the graph is a configuration model, and on the

Percolation in random graphs with higher-order clustering.

This paper uses the natural generalization to the Molloy-Reed criterion for these networks to describe their critical properties and derive an approximate analytical description of the size of the giant component, providing solutions for Poisson and power-law networks.

Random graphs with arbitrary clustering and their applications.

This paper extends the analytical solutions to the percolation properties of random networks with homogeneous clustering to investigate networks that contain clusters whose nodes are not degree equivalent, including multilayer networks.

Mixing patterns in graphs with higher-order structure

This paper examines the percolation properties of higher-order networks that have non-trivial clustering and subgraph-based assortative mixing and proposes a Monte Carlo graph generation algorithm to draw random networks from the ensemble of graphs with Monte Carlo statistics.

Percolation on random networks with arbitrary k-core structure.

This work introduces a hard-core random network (HRN) model that generates maximally random networks with arbitrary degree distribution and arbitrary k-core structure and solves exactly the bond percolation problem on the HRN model.

Exact formula for bond percolation on cliques.

The theoretical result is used to find the location of the percolation threshold of the model, providing analytical solutions where possible and the Erdős-Gallai theorem is examined as a necessary condition on the graphicality of configuration model networks comprising clique subgraphs.

Bond percolation on a class of correlated and clustered random graphs

It is argued that the multitype approach coupled with the use of clustered hyperedges can reproduce a wide spectrum of complex patterns, and thus enhances the capability to model real complex networks.

Statistical properties of random clique networks

In this paper, a random clique network model to mimic the large clustering coefficient and the modular structure that exist in many real complex networks, such as social networks, artificial

Cascades on a class of clustered random networks

An analytical approach to determining the expected cascade size in a broad range of dynamical models on the class of random networks with arbitrary degree distribution and nonzero clustering and Watts' threshold model gives excellent agreement with numerical simulations.

Degree correlations in graphs with clique clustering.

This paper defines a joint-degree correlation function for vertices in the giant component of clustered configuration model networks which are composed of clique subgraphs and uses this model to investigate the organization among nearest-neighbor sub graphs for random graphs as a function of subgraph topology as well as clustering.



Properties of highly clustered networks.

  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
The results indicate that increased clustering leads to a decrease in the size of the giant component of the network, and clustering causes epidemics to saturate sooner, meaning that they infect a near-maximal fraction of thenetwork for quite low transmission rates.

Solution for the properties of a clustered network.

  • Juyong ParkM. Newman
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
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 have revealed a

Highly clustered scale-free networks.

  • K. KlemmV. Eguíluz
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
The model shows stylized features of real-world networks: power-law distribution of degree, linear preferential attachment of new links, and a negative correlation between the age of a node and its link attachment rate.

Tuning clustering in random networks with arbitrary degree distributions.

A generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable and an universal relation among clustering and degree-degree correlations for all networks is unveiled.

Network robustness and fragility: percolation on random graphs.

This paper studies percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolators, bond percolations, and models in which occupation probabilities depend on vertex degree.

Emergence of scaling in random networks

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Structure of growing social networks.

Using computer simulations, it is found that models that incorporate all of these features reproduce many of the features of real social networks, including high levels of clustering or network transitivity and strong community structure in which individuals have more links to others within their community than to individuals from other communities.

Growing scale-free networks with tunable clustering.

The standard scale-free network model is extended to include a "triad formation step" and the clustering coefficient is shown to be tunable simply by changing a control parameter---the average number of triad formation trials per time step.

Clustering in complex networks

A few mile-stones in the quantitative description of this feature are reviewed, together with selected models that reproduce certain attributes of clustering in various networks.

Random graphs with arbitrary degree distributions and their applications.

It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.