Dr
Bas
Lodewijks

School of Mathematical and Physical Sciences

Lecturer in Probability

bas.lodewijks@sheffield.ac.uk
Hicks Building

Full contact details

Dr Bas Lodewijks
School of Mathematical and Physical Sciences

Hicks Building
Hounsfield Road

Sheffield

S3 7RH

Profile
I completed my undergraduate studies at the University of Technology Eindhoven in the Netherlands, after which I obtained a PhD at the University of Bath under the supervision of Marcel Ortgiese. Before coming to the University of Sheffield as a Lecturer in 2025, I was a postdoctoral researcher at the University of Lyon 1 and University of Saint-Etienne and held a Marie SkÅ‚odowska-Curie Fellowship at the University of Augsburg.

 
Publications

Journal articles

  • Lodewijks B & Ortgiese M (2024) . The Annals of Applied Probability, 34(4).
  • Lodewijks B (2024) . Advances in Applied Probability, 56(3), 868-926.
  • Eslava L, Lodewijks B & Ortgiese M (2023) . Stochastic Processes and their Applications, 158, 505-569.
  • Lodewijks B (2022) . Electronic Journal of Probability, 27(none).
  • Komjáthy J & Lodewijks B (2020) . Stochastic Processes and their Applications, 130(3), 1309-1367.
  • Lodewijks B & Ortgiese M (2020) . Electronic Journal of Probability, 25(none).
  • Lodewijks B () . Journal of Applied Probability, 1-19.
  • Jahnel B, Köppl J, Lodewijks B & Tóbiás A () . Journal of Applied Probability, 1-18.
  • van der Hofstad R & Lodewijks B () . Journal of Statistical Physics, 191(9).

Preprints

  • Bäumler J, Kerriou C, Lodewijks B, Martin J, Powierski E, Rácz MZ & Sridhar A (2026) On the largest common subtree of uniform attachment trees.
  • Engel R & Lodewijks B (2026) High-degree vertices in uniform recursive directed acyclic graphs with freezing.
  • Lichev L, Linker A, Lodewijks B & Mitsche D (2026) On the depth of depth-weighted trees.
  • Bäumler J, Jahnel B, Köppl J, Lodewijks B, Reeves L & Tóbiás A (2025) Local criteria for global connectivity comparisons: beyond stochastic domination.
  • Lodewijks B (2025) Preferential Attachment Trees with Vertex Death: Persistence of the Maximum Degree.
  • Heydenreich M & Lodewijks B (2025) Preferential Attachment Trees with Vertex Death: Lack of Persistence of the Maximum Degree.
  • Lodewijks B (2024) A star is born: Explosive Crump-Mode-Jagers branching processes in random environment.
  • Lodewijks B & Maitra N (2024) Long-range competition on the torus.
  • Hofstad RVD & Lodewijks B (2023) Long-range first-passage percolation on the torus.
  • Iyer T & Lodewijks B (2023) On the structure of genealogical trees associated with explosive Crump-Mode-Jagers branching processes.
  • Jahnel B, Köppl J, Lodewijks B & Tóbiás A (2023) Percolation in lattice $k$-neighbor graphs.
  • Díaz J, Lichev L & Lodewijks B (2022) Dynamic random graphs with vertex removal.
  • Lichev L, Lodewijks B, Mitsche D & Schapira B (2022) On the first and second largest components in the percolated Random Geometric Graph.
  • Lodewijks B (2022) On joint properties of vertices with a given degree or label in the random recursive tree.
  • Lodewijks B (2021) The location of high-degree vertices in weighted recursive graphs with bounded random weights.
  • Eslava L, Lodewijks B & Ortgiese M (2021) Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights.
  • Lodewijks B & Ortgiese M (2020) The maximal degree in random recursive graphs with random weights.
  • Lodewijks B & Ortgiese M (2020) A phase transition for preferential attachment models with additive fitness.
  • Lodewijks B (2019) Mapping NP-hard and NP-complete optimisation problems to Quadratic Unconstrained Binary Optimisation problems.
  • Komjáthy J & Lodewijks B (2018) Explosion in weighted Hyperbolic Random Graphs and Geometric Inhomogeneous Random Graphs.
Research group
My main interests lie in (discrete) probability theory, in particular random graphs where we study the patterns and structure that arise in such graphs as their size (number of vertices/edge becomes large) I study a variety of random graph models that aim to describe the structure of real-world networks and processes that take place on such real-world networks. Branching processes and first-passage percolation are common tools for the analysis of such models, which I work with on occasion as well.

Links