Bond percolation on a class of clustered random networks

TL;DR

This paper derives analytical results for bond percolation thresholds and giant component sizes in clustered random networks, matching well with simulations on synthetic and real-world data.

Contribution

It introduces a method to analytically determine percolation properties in networks with prescribed degree distribution and clustering spectrum.

Findings

Analytical formulas for percolation threshold and giant component size.

Good agreement between theory and simulations.

Applicable to both synthetic and real-world networks.

Abstract

Analytical results are derived for the bond percolation threshold and the size of the giant connected component in a class of random networks with non-zero clustering. The network's degree distribution and clustering spectrum may be prescribed, and theoretical results match well to numerical simulations on both synthetic and real-world networks.