Dr Henning Sulzbach PhD

Dr Henning Sulzbach

School of Mathematics
Lecturer

Contact details

Address
School of Mathematics
University of Birmingham
Edgbaston
Birmingham
B15 2TT

Henning Sulzbach is a Lecturer in probability and statistics at the School of Mathematics. He obtained his PhD at the Goethe University of Frankfurt and held Postdoctoral positions in Frankfurt, Paris, Montreal and Münster.

Henning is mainly interested in probability theory and its applications to the analysis of algorithms and random graphs. The probabilistic analysis of algorithms aims at obtaining a better understanding of average and worst-case complexity of important algorithms in computer science. In the analysis of random graphs, the main objective is the description of the geometry of networks of very large size. Applications include social networks, data structures and phylogenetic trees.

During his postdoctoral studies, Henning was awarded research fellowships from the Fondation Sciences Mathématiques de Paris and the Alexander von Humboldt Foundation.

Qualifications

  • PhD in Mathematics, Goethe University of Frankfurt, 2012
  • Diploma in Mathematics, Goethe University of Frankfurt, 2007

Biography

Henning Sulzbach received his diploma in Mathematics working on the profile of random binary search trees at the Goethe University of Frankfurt in 2007. In 2012, he obtained his PhD under the supervision of Prof Ralph Neininger at the same university. His thesis deals with the foundation of a functional contraction method for distributional recurrences with applications to invariance principles for random sums and standard data base operations in multidimensional data structures.

Holding a research fellowship from the Fondation Sciences Mathématiques de Paris, Henning spent one year at the research institute INRIA (Institut national de recherche en informatique et en automatique) in Paris. There, he was working with Nicolas Broutin on the geometry of scaling limits for random trees.

From 2014 to 2016, Henning joined the McGill University in Montreal on a Feodor Lynen Research Fellowship of the Alexander von Humboldt Foundation. Together with Luc Devroye, he was working on structural results for Galton-Watson trees, an important graph model with numerous applications.

Research

Henning Sulzbach works on the probabilistic analysis of algorithms and random graphs. His most recent research interests cover the structure of Galton-Watson trees and the profile of logarithmic trees playing an important role in theoretical computer science. Henning also worked on random small-world and scale-free graphs modelling real-world networks.

Methodologically, Henning often uses structural recursive decompositions for random combinatorial objects or algorithms. These methods are particularly powerful in the analysis of divide-and-conquer algorithms such as Quicksort.

Publications

A full list of publications can be found on Henning’s personal webpage.

  • Kuba, M. and Sulzbach, H. (2016), On martingale tail sums in affine two-color urn models with multiple drawings, to appear in Journal of Applied Probability
  • Kabluchko, Z., Marynych, A. and Sulzbach, H. (2016), Mode and Edgeworth Expansion for the Ewens Distribution and the Stirling Numbers, Journal of Integer Sequences, 19(8)
  • Sulzbach, H. (2016), On martingale tail sums for the path length in random trees, Random Structures & Algorithms, doi:10.1002/rsa.20674
  • Neininger, R. and Sulzbach, H (2015), On a functional contraction method, The Annals of Probability, 43: 1777-1822
  • Broutin, N. and Sulzbach, H. (2015), The dual tree of a recursive triangulation of the disk, The Annals of Probability, 43: 738-781