Dr John Sylvester

  • Research Associate (School of Computing Science)

Biography

I am a PostDoc working with Kitty Meeks and Jessica Enright on their Multilayer algorithms project.

Before this I was a PostDoc in the at the Computer Lab, University of Cambridge Thomas Sauerwald.

I Completed my PhD at the University of Warwick under the supervision of Agelos Georgakopoulos and before that I did an undergrad in Maths at University College London.

 

Publications

List by: Type | Date

Jump to: 2021 | 2020 | 2019
Number of items: 5.

2021

Rivera, N., Sauerwald, T. and Sylvester, J. (2021) Multiple Random Walks on Graphs: Mixing Few to Cover Many. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 12-16 Jul 2021, p. 107. ISBN 9783959771955 (doi:10.4230/LIPICS.ICALP.2021.107)

Georgakopoulos, A., Haslegrave, J., Sauerwald, T. and Sylvester, J. (2021) The power of two choices for random walks. Combinatorics, Probability and Computing, (doi: 10.1017/s0963548321000183) (Early Online Publication)

Sylvester, J. (2021) Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs. Journal of Graph Theory, 96(1), pp. 44-84. (doi: 10.1002/jgt.22551)

2020

Georgakopoulos, A., Haslegrave, J., Sauerwald, T. and Sylvester, J. (2020) Choice and Bias in Random Walks. In: 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), Seattle, WA, USA, 12-14 Jan 2020, p. 76. ISBN 9783959771344 (doi:10.4230/LIPICS.ITCS.2020.76)

2019

Riveria, N., Sauerwald, T., Stauffer, A. and Sylvester, J. (2019) The Dispersion Time of Random Walks on Finite Graphs. In: 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '19), Phoenix, AZ, USA, 22-24 Jun 2019, pp. 103-113. ISBN 9781450361842 (doi:10.1145/3323165.3323204)

This list was generated on Mon Sep 20 06:05:55 2021 BST.
Number of items: 5.

Articles

Georgakopoulos, A., Haslegrave, J., Sauerwald, T. and Sylvester, J. (2021) The power of two choices for random walks. Combinatorics, Probability and Computing, (doi: 10.1017/s0963548321000183) (Early Online Publication)

Sylvester, J. (2021) Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs. Journal of Graph Theory, 96(1), pp. 44-84. (doi: 10.1002/jgt.22551)

Conference Proceedings

Rivera, N., Sauerwald, T. and Sylvester, J. (2021) Multiple Random Walks on Graphs: Mixing Few to Cover Many. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 12-16 Jul 2021, p. 107. ISBN 9783959771955 (doi:10.4230/LIPICS.ICALP.2021.107)

Georgakopoulos, A., Haslegrave, J., Sauerwald, T. and Sylvester, J. (2020) Choice and Bias in Random Walks. In: 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), Seattle, WA, USA, 12-14 Jan 2020, p. 76. ISBN 9783959771344 (doi:10.4230/LIPICS.ITCS.2020.76)

Riveria, N., Sauerwald, T., Stauffer, A. and Sylvester, J. (2019) The Dispersion Time of Random Walks on Finite Graphs. In: 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '19), Phoenix, AZ, USA, 22-24 Jun 2019, pp. 103-113. ISBN 9781450361842 (doi:10.1145/3323165.3323204)

This list was generated on Mon Sep 20 06:05:55 2021 BST.

Additional information

 Personal Website: j-sylvester.github.io/