Critical Percolation on Random Networks with Prescribed Degrees
arXiv:1809.03634
Abstract
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental model for understanding robustness and spread of epidemics on these networks. From a mathematical perspective, percolation is one of the simplest models that exhibits phase transition, and fascinating features are observed around the critical point. In this thesis, we prove limit theorems about structural properties of the connected components obtained from percolation on random graphs at criticality. The results are obtained for random graphs with general degree sequence, and we identify different universality classes for the critical behavior based on moment assumptions on the degree distribution.
Ph.D. thesis
References in corpus (10)
- Critical random graphs: Diameter and mixing time
- Proofs of the martingale FCLT
- Random subgraphs of finite graphs: I. The scaling window under the triangle condition
- Critical window for the configuration model: finite third moment degrees
- Heavy-tailed configuration models at criticality
- On the critical probability in percolation
- The augmented multiplicative coalescent and critical dynamic random graph models
- Mesoscopic scales in hierarchical configuration models
- Phase transitions of extremal cuts for the configuration model
- Percolation on random graphs with a fixed degree sequence