Skip to main content

Dr John Haslegrave

  picture-for-website.jpg

John Haslegrave

Research Fellow

Office: B2.15
Phone: +44 (0)24 761 50903
Email: j dot haslegrave at warwick dot ac dot uk


Teaching Responsibilities 2018–19
Term 1

CS260 Algorithms
Seminar group 1: Thursdays, 10:00, S0.09;
Seminar group 6: Fridays, 10:00, CS1.01;
Seminar group 8: Fridays, 12:00, CS1.01.

Term 2

Cover for MA252 Combinatorial Optimisation, lectures 2–3.


Seminars and talks

I will be speaking at the Université Paris 13 Probability seminar on Wedneday 19th June. I will also give a talk at the British Combinatorial Conference. Earlier this year I spoke at the Open University Winter Combinatorics Meeting, the NYU Shanghai Probability seminar, and the Discrete Geometry symposium at CanaDAM, Vancouver.

I jointly organised the Warwick combinatorics seminar (Fridays, 14:00, MS.04) for 2017–18, with Katherine Staden (term 1) and with Maryam Sharifzadeh (terms 2–3).


Research

My main research interests are random graphs, random walks, interacting particle systems, preferential attachment, and extremal problems on graphs and hypergraphs. I am currently working with Agelos Georgakopoulos on the ERC project Random Graph Geometry and Convergence.

Preprints
  • J. Haslegrave & C. Panagiotis: Site percolation and isoperimetric inequalities for plane graphs. arXiv
  • J. Haslegrave, V. Sidoravicius & L. Tournier: Three-speed ballistic annihilation: phase transition and universality. arXiv
  • J. Haslegrave: The ballistic annihilation threshold is positive. arXiv
  • A. Georgakopoulos, J. Haslegrave, R. Montgomery & B. Narayanan: Spanning surfaces in 3-graphs. arXiv
  • A. Georgakopoulos & J. Haslegrave: Percolation on an infinitely generated group. arXiv
To appear
  1. J. Haslegrave, J. Jordan & M. Yarrow: Condensation in preferential attachment models with location-based choice, Random Structures and Algorithms. arXiv
Publications
  1. R. Henze, C. Mu, et al.: Multi-scale stochastic organization-oriented coarse-graining exemplified on the human mitotic checkpoint, Scientific Reports 9 (2019). journal
  2. A. Georgakopoulos, J. Haslegrave & R. Montgomery: Forcing large tight components in 3-graphs, European Journal of Combinatorics 77 (2019). journal arXiv
  3. J. Haslegrave & J. Jordan: Non-convergence of proportions of types in a preferential attachment graph with three co-existing types, Electronic Communications in Probability 23 (2018). journal arXiv
    Dedicated to our late friend and colleague Chris Cannings.
  4. J. Haslegrave: Proof of a local antimagic conjecture, Discrete Mathematics and Theoretical Computer Science 20:1 (2018). journal arXiv
  5. J. Haslegrave, R. A. B. Johnson & S. Koch: Locating a robber with multiple probes, Discrete Mathematics 341 (2018). journal arXiv
  6. J. Haslegrave & M. Puljiz: Reaching consensus on a connected graph, Journal of Applied Probability 54:1 (2017). journal arXiv
  7. J. Haslegrave & C. Cannings: Majority dynamics with one nonconformist, Discrete Applied Mathematics 219 (2017). journal arXiv
  8. J. Haslegrave, R. A. B. Johnson & S. Koch: Subdivisions in the robber-locating game, Discrete Mathematics 339:11 (2016). journal arXiv
  9. J. Haslegrave & J. Jordan: Preferential attachment with choice, Random Structures and Algorithms 48:4 (2016). journal arXiv
  10. J. Haslegrave, R. A. B. Johnson & S. Koch: The robber-locating game, Discrete Mathematics 339:1 (2016). journal arXiv
  11. J. Haslegrave: Bounds on Herman's algorithm, Theoretical Computer Science 550 (2014). journal arXiv
  12. J. Haslegrave: Judicious partitions of uniform hypergraphs, Combinatorica 34:5 (2014). journal arXiv
  13. J. Haslegrave: Extremal results on average subtree density of series-reduced trees, Journal of Combinatorial Theory series B 107 (2014). journal arXiv
  14. J. Haslegrave: An evasion game on a graph, Discrete Mathematics 314 (2014). journal arXiv
  15. J. Haslegrave: The Bollobás–Thomason conjecture for 3-uniform hypergraphs, Combinatorica 32:4 (2012). journal arXiv

A BibTeX file for all the papers listed above is available here.