Phase transitions in random graphs

Mihyun Kang (강미현)

Institut für Mathematik, Freie Universität Berlin, Germany

Institut für Mathematik, Freie Universität Berlin, Germany

2011/09/30 Fri 4PM-5PM

The phase transition deals with sudden global changes and is observed in many fundamental problems from statistical physics, mathematics and theoretical computer science, for example, Potts models, graph colourings and random k-SAT. The phase transition in random graphs refers to a phenomenon that there is a critical edge density, to which adding a small amount a drastic change in the size of the largest component occurs. In Erdös-Renyi random graph, which begins with an empty graph on n vertices and edges are added randomly one at a time to a graph, a phase transition takes place when the number of edges reaches n/2 and a giant component emerges. Since this seminal work of Erdös and Renyi, various random graph models have been introduced and studied. In this talk we discuss phase transitions in several random graph models, including Erdös-Renyi random graph, random graphs with a given degree sequence, random graph processes and random planar graphs.

Tags: 강미현