Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erdős-Rényi random graph

A wide array of random graph models have been postulated to understand\nproperties of observed networks. Typically these models have a parameter $t$\nand a critical time $t_c$ when a giant component emerges. It is conjectured\nthat for a large class of models, the nature of this emergence is similar... View More