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: 2022 | 2021 | 2020 | 2019
Number of items: 10.

2022

Sylvester, J. (2022) The cover time of a (multiple) Markov chain with rational transition probabilities is rational. Statistics and Probability Letters, 187, 109534. (doi: 10.1016/j.spl.2022.109534)

Bocci, C., Capresi, C., Meeks, K. and Sylvester, J. (2022) A New Temporal Interpretation of Cluster Editing. In: 33rd International Workshop in Combinatorial Algorithms (IWOCA 2022), Trier, Germany, 07-09 Jun 2022, (Accepted for Publication)

Haslegrave, J., Sauerwald, T. and Sylvester, J. (2022) Time dependent biased random walks. ACM Transactions on Algorithms, 18(2), pp. 1-30. (doi: 10.1145/3498848)

Georgakopoulos, A., Haslegrave, J., Sauerwald, T. and Sylvester, J. (2022) The power of two choices for random walks. Combinatorics, Probability and Computing, 31(1), pp. 73-100. (doi: 10.1017/s0963548321000183)

Los, D., Sauerwald, T. and Sylvester, J. (2022) Balanced Allocations: Caching and Packing, Twinning and Thinning. In: 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 09-12 Jan 2022, pp. 1847-1874. ISBN 9781611977073 (doi: 10.1137/1.9781611977073.74)

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)

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)

Enright, J. , Lee, D. , Meeks, K. , Pettersson, W. and Sylvester, J. (2021) The complexity of finding optimal subgraphs to represent spatial correlation. In: Du, D.-Z., Du, D., Wu, C. and Xu, D. (eds.) Combinatorial Optimization and Applications. Series: Lecture Notes in Computer Science (13135). Springer, pp. 152-166. ISBN 9783030926809 (doi: 10.1007/978-3-030-92681-6_13)

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 Sun Jul 3 19:23:51 2022 BST.
Jump to: Articles | Book Sections | Conference Proceedings
Number of items: 10.

Articles

Sylvester, J. (2022) The cover time of a (multiple) Markov chain with rational transition probabilities is rational. Statistics and Probability Letters, 187, 109534. (doi: 10.1016/j.spl.2022.109534)

Haslegrave, J., Sauerwald, T. and Sylvester, J. (2022) Time dependent biased random walks. ACM Transactions on Algorithms, 18(2), pp. 1-30. (doi: 10.1145/3498848)

Georgakopoulos, A., Haslegrave, J., Sauerwald, T. and Sylvester, J. (2022) The power of two choices for random walks. Combinatorics, Probability and Computing, 31(1), pp. 73-100. (doi: 10.1017/s0963548321000183)

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)

Book Sections

Enright, J. , Lee, D. , Meeks, K. , Pettersson, W. and Sylvester, J. (2021) The complexity of finding optimal subgraphs to represent spatial correlation. In: Du, D.-Z., Du, D., Wu, C. and Xu, D. (eds.) Combinatorial Optimization and Applications. Series: Lecture Notes in Computer Science (13135). Springer, pp. 152-166. ISBN 9783030926809 (doi: 10.1007/978-3-030-92681-6_13)

Conference Proceedings

Bocci, C., Capresi, C., Meeks, K. and Sylvester, J. (2022) A New Temporal Interpretation of Cluster Editing. In: 33rd International Workshop in Combinatorial Algorithms (IWOCA 2022), Trier, Germany, 07-09 Jun 2022, (Accepted for Publication)

Los, D., Sauerwald, T. and Sylvester, J. (2022) Balanced Allocations: Caching and Packing, Twinning and Thinning. In: 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 09-12 Jan 2022, pp. 1847-1874. ISBN 9781611977073 (doi: 10.1137/1.9781611977073.74)

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 Sun Jul 3 19:23:51 2022 BST.

Additional information

 Personal Website: j-sylvester.github.io/