John Sylvester
Scholar

John Sylvester

Google Scholar ID: WEYRxKoAAAAJ
Lecturer, University of Liverpool
Discrete ProbabilityGraph TheoryAlgorithms
Citations & Impact
All-time
Citations
135
 
H-index
7
 
i10-index
6
 
Publications
20
 
Co-authors
17
list available
Publications
20 items
Browse publications on Google Scholar (top-right) ↗
Resume (English only)
Academic Achievements
  • Involved in organizing conferences such as the Liverpool Discrete Mathematics Colloquium on 2-3 September 2025 and 12-13 November 2024; Member of the STACS 2026 Program Committee; Published several preprints including 'Functionality of Random Graphs', 'Boolean combinations of graphs', and 'Mean-Biased Processes for Balanced Allocations'; Also has an upcoming publication in SODA 2026 titled 'Temporal Exploration of Random Spanning Tree Models'.
Research Experience
  • Before joining the University of Liverpool, was a PostDoc with Kitty Meeks and Jessica Enright at the University of Glasgow; Prior to that, was a PostDoc with Thomas Sauerwald at the University of Cambridge.
Education
  • PhD supervised by Agelos Georgakopoulos and David Croydon at the University of Warwick; Undergraduate degree in Mathematics from University College London.
Background
  • Lecturer at the Department of Computer Science, University of Liverpool. Works primarily in discrete probability, random processes on graphs and random graphs, and is also interested in (temporal) graph theory and algorithms.