Abstract
In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our method to a model of a random intersection graph, a random graph obtained through p-bond percolation on a general d-regular graph, and a model of an inhomogeneous random graph.
Original language | English |
---|---|
Pages (from-to) | 1228-1242 |
Number of pages | 15 |
Journal | Journal of Applied Probability |
Volume | 59 |
Issue number | 4 |
Early online date | 11 Nov 2022 |
DOIs | |
Publication status | Published - 24 Dec 2022 |
Keywords
- ballot theorem
- Random walk
ASJC Scopus subject areas
- Statistics and Probability
- Mathematics(all)
- Statistics, Probability and Uncertainty