Georgia Institute of Technology College of Sciences

During the last 30 years there has been much interest in random graph processes, i.e., random graphs which grow by adding edges (or vertices) step-by-step in some random way. Part of the motivation stems from more realistic modeling, since many real world networks such as Facebook evolve over time. Further motivation stems from extremal combinatorics, where these processes lead to some of the best known bounds in Ramsey and Turan Theory (that go beyond textbook applications of the probabilistic method). I will review several random graph processes of interest, and (if time permits) illustrate one of the main proof techniques using a simple toy example.