Recently, Chatterjee and Diaconis used a large deviation principle for the Erdos-Renyi graph to study the asymptotic structure of exponential random graph models (ERGMs). ERGMs are popular models for ...

The largest components of the critical Erdős-Rényi graph, G (n, p) with p = 1/n, have size of order n⅔ with high probability. We give detailed asymptotics for the probability that there is an ...

Daniel Larremore, an associate professor of computer science at CU Boulder, was awarded the prestigious Erdős–Rényi Prize in network science today in Vienna, Austria, for his internationally ...