The theory of random graphs started more than 50 years ago with the now classical works of Paul Erdős and Alfréd Rényi. Now it's a powerful and deeply developed mathematical discipline, the results of which substantially influence graph theory, combinatorics, and applications.
One of the most important applications is in the study of large, complex networks such as the Internet, social networks, biological networks, interbank networks, etc. The aim of the workshop is to bring together specialists in pure and applied theory of random graphs and to provide a platform for fruitful discussions of both fundamental and applied aspects of the theory. Workshop topics are expected to include Erdős-Rényi random graphs, web-graph models and their applications to the study of Internet topology, and models of social and interbank networks.
The conference has taken place in Moscow, Russia, from the 24th to the 26th of October 2013.
The main organizer of the conference is Andrey Raigorodsky.