A generaliztion of an inequality of Stepanov
Journal of Combinatorial Theory Series B
Sudden emergence of a giant k-core in a random graph
Journal of Combinatorial Theory Series B
On the largest component of the random graph at a nearcritical stage
Journal of Combinatorial Theory Series B
The phase transition in the cluster-scaled model of a random graph
Random Structures & Algorithms
Large deviation analysis for layered percolation problems on the complete graph
Random Structures & Algorithms
On z-analogue of Stepanov-Lomonosov-Polesskii inequality
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
We present a large-deviations/thermodynamic approach to the classic problem of percolation on the complete graph. Specifically, we determine the large-deviation rate function for the probability that the giant component occupies a fixed fraction of the graph while all other components are “small.” One consequence is an immediate derivation of the “cavity” formula for the fraction of vertices in the giant component. As a byproduct of our analysis we compute the large-deviation rate functions for the probability of the event that the random graph is connected, the event that it contains no cycles and the event that it contains only small components. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007