Random Graphs: Combinatorics, Complex Networks and Disordered Systems

  • Amin Coja-Oghlan

    Technische Universität Dortmund, Germany
  • Tobias Friedrich

    Hasso-Plattner-Institut für Digital Engineering gGmbH, Potsdam, Germany
  • Mihyun Kang

    Technische Universität Graz, Austria
  • Konstantinos Panagiotou

    Universität München, Germany
Random Graphs: Combinatorics, Complex Networks and Disordered Systems cover
Download PDF

A subscription is required to access this article.


Since the turn of the millennium the theory of random graphs has advanced by leaps and bounds. Random graphs have found very many applications, and many unexpected applications, in a remarkable variety of disciplines, and they are nowadays studied by mathematicians with various backgrounds (combinatorialists, probabilists, mathematical physicists), computer scientists and physicists. While this diversity has led to a proliferation of new models, questions and results, the community also has shattered, and by now different methods, terminologies and research agendas have come to coexist without much interaction. The workshop brought together distinct communities, who don’t typically interact at their own intra-community events, but have each made significant contributions to the recent advancements in the theory. The workshop provided an effective platform for exchanging ideas, sharing insights, and building bridges across their respective domains.

Cite this article

Amin Coja-Oghlan, Tobias Friedrich, Mihyun Kang, Konstantinos Panagiotou, Random Graphs: Combinatorics, Complex Networks and Disordered Systems. Oberwolfach Rep. 20 (2023), no. 1, pp. 883–914

DOI 10.4171/OWR/2023/16