On certain perturbations of the Erdos-Renyi random graph
Abstract
We study perturbations of the Erdos-Renyi model for which the statistical weight of a graph depends on the abundance of certain geometrical patterns. Using the formal correspondance with an exactly solvable effective model, we show the existence of a percolation transition in the thermodynamical limit and derive perturbatively the expression of the threshold. The free energy and the moments of the degree distribution are also computed perturbatively in that limit and the percolation criterion is compared with the Molloy-Reed criterion.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.