Project 15: "Random graphs on a surface"

This project is running since 2015.

Principal investigator: Mihyun Kang
Graz University of Technology, Austria.
Mentor for: Dornelas; Kloas, Moosmüller; Carl.

DK Student

  • Third phase of the doctoral program:
  • Tuan Anh Do (Vietnam; since October 2019)
    Mentors: Oswin Aichholzer, Joshua Erde.

  • Michael Missethan (Austria; since October 2019)
    Mentors: Michael Kerber, Philipp Sprüssel.
  • Second phase of the doctoral program:
  • Nicola Del Giudice (Italy; September 2016–June 2020)
    Mentors: Michael Kerber, Oliver Cooley, Philipp Sprüssel.
    Thesis Title: "Random hypergraphs and random simplicial complexes".
    PhD Defense: June 19, 2020.
    Referees: T. Łuczak (Adam Mickiewicz University), T. Müller (Groningen University) M. Kang.
    Examiners: T. Łuczak (Adam Mickiewicz University), T. Müller (Groningen University).

Associated Students

  • Third phase of the doctoral program:
  • Julian Zalla (Germany; since March 2019)
    Mentors: Peter Grabner, Oliver Cooley.

  • Second phase of the doctoral program:
  • Christoph Koch (Germany; April 2012 - November 2016)
    Mentors: Wolfgang Woess, Oliver Cooley.
    Thesis Title: "Phase transition phenomena in random graphs and hypergraphs".
    PhD Defense: November 25, 2016.
    Referees: Mihyun Kang (TU Graz), Michael Krivelevich (Tel Aviv University), and Angelika Steger (ETH Zürich).
    Examiners: Angelika Steger, Wolfgang Woess.

  • Michael Moßhammer (Austria; October 2013 - May 2018)
    Mentors: Johannes Wallner, Philipp Sprüssel.
    Thesis Title: "Phase transitions and structural properties of random graphs on surfaces".
    PhD Defense: May 4, 2018.
    Referees: M. Drmota (TU Wien), M. Kang, C. McDiarmid (University of Oxford).
    Examiners: M. Drmota (TU Wien), M. Kang.

Project description

The main research field of Mihyun Kang is probabilistic and enumerative combinatorics, random graphs and hypergraphs, planar graphs and graphs on surfaces, and randomised algorithms. The main objectives are to study asymptotic properties and limit behaviour (e.g. evolution, phase transition, critical behaviour, component size distribution) and to investigate structural, enumerative and algorithmic aspects (e.g. symmetry, decomposition, asymptotic number, random sampling). In comparison with the classical Erdos-Renyi random graphs, additional constraints imposed on random graphs (e.g. planarity, genus, degree) lead to serious difficulties in the analysis. To circumvent these difficulties and to achieve the objectives, problems are approached by means of the combination of complementary methods, such as probabilistic methods, graph theoretic methods, differential equations method, methods from analytic combinatorics (e.g. singularity analysis, saddle point method), and algorithmic methods (e.g. Boltzmann sampler).