Dr. Annika Heckel

Research interests: Discrete mathematics, probabilistic combinatorics and random discrete structures, in particular random graphs

Publications:

Papers:

• How does the chromatic number of a random graph vary? (with Oliver Riordan)
  arXiv preprint 2103.14014 (2021)
• Non-concentration of the chromatic number of a random graph
  Journal of the American Mathematical Society 34 (2021), 245-260.
• Random triangles in random graphs
  To appear in Random Structures and Algorithms.
• Sharp concentration of the equitable chromatic number of dense random graphs
  Combinatorics, Probability and Computing 29(2) (2020 ), 213-233.
• The chromatic number of dense random graphs
  Random Structures and Algorithms 53(1) (2018), 140-182.
• On the threshold for rainbow connection number r in random graphs (with Oliver Riordan)
  Graphs and Combinatorics 32(1) (2016), 161-174.
• Mathematical foundations of and empirical investigations into the dynamic of top positions: Stabilization Effect, Reversed Matthew Effect, and Heraclitus Effect (with Albert Ziegler and Albert Ziegler)
  Psychological Test and Assessment Modeling 55(4) (2013), 401-414.
• The Hitting Time of Rainbow Connection Number Two (with Oliver Riordan)
  The Electronic Journal of Combinatorics 19(1) (2012), P37.

Oberwolfach reports:

• Non-concentration of the chromatic number (with Oliver Riordan)
  Oberwolfach Workshop 2002 "Combinatorics" (2020), 26-29.
• Non-concentration of χ(G(n,1/2))
  Oberwolfach Workshop 1916 "Combinatorics, Probability and Computing" (2019), 1141-1144.

Thesis:

• Colourings of Random Graphs
  Supervisor: Professor Oliver Riordan
  University of Oxford, 2017.