Dr Nikolaos Fountoulakis MEng MSc DPhil

Dr Nikolaos Fountoulakis

School of Mathematics
Reader in Probabilistic Combinatorics

Contact details

School of Mathematics
Watson Building
University of Birmingham
B15 2TT

Nikolaos's research is motivated by mechanisms that describe the structure and the evolution of networks (particularly mathematical models used in order to describe networks which emerge in applications). In this context, he studies also processes, which describe the dissemination of information within a network. Randomness is the key feature that underlies these themes. His research has been funded by the Engineering and Physical Sciences Research Council (EPSRC) as well as by the European Commission and the Alan Turing Institute.

Personal webpage


  • DPhil in Mathematics, University of Oxford, 2003
  • MSc in Mathematics, University of Oxford, 2000
  • MEng in Computer Engineering and Informatics, University of Patras, 1999


School of Mathematics, University of Birmingham

  • 2018-present  Reader in Probabilistic Combinatorics
  • 2016-2018 Senior Lecturer in Combinatorics
  • 2011-2016 Lecturer in Combinatorics

Postdoctoral experience

  • 2008-2011 Postdoctoral researcher and Marie Curie Fellow Max Plank Institute for Informatics, Saarbrüken, Germany
  • 2006-2008 Postdoctoral researcher, School of Mathematics, University of Birmingham
  • 2003-2004 Postdoctoral researcher, School of Computer Science, McGill University


Semester 1

LM Stochastic Processes

Semester 2

LI/LH Algebra and Combinatorics 2

LI/LH Statistics

Postgraduate supervision

Nikolaos is interested in supervising PhD students in random graph models, structural theory and stochastic processes.


Research Themes

  • Combinatorics
  • Random structures
  • Stochastic processes on random graphs

Research Activity

Nikolaos's research focuses on the use of randomness in order to investigate and explain the structure of networks which emerge in applications. He is interested in the probabilistic analysis of geometric mechanisms which explain the structure and the evolution of large complex networks.



N. Fountoulakis & B. Reed. 2007 Faster mixing and small bottlenecks. Probability Theory & Related Fields, 137, 475-486.

O. Cooley, N. Fountoulakis, D. Kuhn & D. Osthus. 2009 Embedding and Ramsey numbers of sparse K-uniform hypergraphs. Combinatorica, 28, 263-297.

N. Fountoulakis & A. Huber. 2009 Quasirandom rumour spreading on the complete graph is as fast as randomized rumour spreading. SIAM Journal on Discrete Mathematics, 23, 1964-1991.

N. Fountoulakis & K. Panagiotou. 2011 3-connected cases in random planar graphs. Combinatorics, Probability & Computing, 20, 381-412.

View all publications in research portal