Threshold phenomena in random graphs and hypergraphs
Member Seminar Speaker: Michael Simkin Title: Threshold phenomena in random graphs and hypergraphs Abstract: In 1959 Paul Erdos and Alfred Renyi introduced a model of random graphs that is the cornerstone of modern probabilistic combinatorics. Now known as the “Erdos-Renyi” model of random graphs it has far-reaching applications in combinatorics, computer science, and other fields. The […]