Noise sensitivity of critical random graphs

Eyal Lubetzky, Yuval Peled

We study noise sensitivity of properties of the largest components $({\mathcal{C}}_j{)}_{j\ge 1}$ of the random graph $\mathcal{G}(n,p)$ in its critical window $p=(1+\lambda n^{-1/3})/n$. For inst…