معرفی
Dr. John Haslegrave is a Lecturer in Probability at Lancaster University's School of Mathematical Sciences, where he is an active member of both the Probability and Combinatorics research groups. Previously, he held positions at the University of Oxford (working with Peter Keevash), University of Warwick (with Agelos Georgakopoulos), and University of Sheffield (with Hong Liu and Chris Cannings). He completed his PhD at Trinity College, Cambridge under Béla Bollobás.
His research focuses on:
- Random graphs and evolving network models (especially preferential attachment)
- Interacting particle systems and random walks on graphs
- Extremal problems in graph/hypergraph theory
- Percolation theory and geometric probability
- Combinatorial optimization and graph invariants
Analysis of recent publications reveals strong emphasis on probabilistic combinatorics, with frequent exploration of: structural graph properties, asymptotic behavior of stochastic processes, geometric embeddings, and optimization problems. His work consistently bridges discrete mathematics with statistical physics concepts.
Dr. Haslegrave welcomes PhD students interested in discrete probability and graph theory, with current supervision interests including preferential attachment models, interacting particle systems, planar percolation, and extremal problems. He teaches undergraduate courses in Graph Theory (MATH326) and Probability (MATH103), and organizes Lancaster's Pure Mathematics Seminar series.
