Percolation in random graphs with higher-order clustering.

@article{Mann2021PercolationIR,
  title={Percolation in random graphs with higher-order clustering.},
  author={P. Mann and V. Smith and J. B. Mitchell and S. Dobson},
  journal={Physical review. E},
  year={2021},
  volume={103 1-1},
  pages={
          012313
        }
}
Percolation theory can be used to describe the structural properties of complex networks using the generating function formulation. This mapping assumes that the network is locally treelike and does not contain short-range loops between neighbors. In this paper we use the generating function formulation to examine clustered networks that contain simple cycles and cliques of any order. We use the natural generalization to the Molloy-Reed criterion for these networks to describe their critical… Expand

Figures from this paper

Random graphs with arbitrary clustering and their applications.
Two-pathogen model with competition on clustered networks.
Cooperative coinfection dynamics on clustered networks.

References

SHOWING 1-10 OF 25 REFERENCES
Random graphs containing arbitrary distributions of subgraphs
  • B. Karrer, M. Newman
  • Mathematics, Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2010
Random graphs with clustering.
  • M. Newman
  • Computer Science, Physics
  • Physical review letters
  • 2009
Percolation on sparse networks
Spectra of networks containing short loops
  • M. Newman
  • Computer Science, Physics
  • Physical review. E
  • 2019
Higher-order clustering in networks
General and exact approach to percolation on random graphs.
Percolation and epidemic thresholds in clustered networks.
Random graphs with arbitrary degree distributions and their applications.
How clustering affects the bond percolation threshold in complex networks.
...
1
2
3
...