Abstract
We present exact solutions for the size of the giant connected component of complex networks composed of cliques following bond percolation. We use our theoretical result to find the location of the percolation threshold of the model, providing analytical solutions where possible. We expect the results derived here to be useful to a wide variety of applications including graph theory, epidemiology, percolation, and lattice gas models, as well as fragmentation theory. We also examine the Erdős-Gallai theorem as a necessary condition on the graphicality of configuration model networks comprising clique subgraphs.
| Original language | English |
|---|---|
| Article number | 024304 |
| Number of pages | 10 |
| Journal | Physical Review E - Statistical, Nonlinear, and Soft Matter Physics |
| Volume | 104 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 4 Aug 2021 |
Keywords
- Complex networks
- Bond percolation
- Clustering
Access to Document
- PhysRevE.104.024304
Copyright © 2021 American Physical Society. This work has been made available online in accordance with publisher policies or with permission. Permission for further reuse of this content should be sought from the publisher or the rights holder. This is the final published version of the work, which was originally published at https://doi.org/10.1103/PhysRevE.104.024304.