Dr John Sylvester

Lecturer Computer Science

+44 (0)151 795 4255 Ext. 4255
Work email John.Sylvester@liverpool.ac.uk
Personal Websitehttps://j-sylvester.github.io/

Publications

Selected Publications

Balanced Allocations: Caching and Packing, Twinning and Thinning (Chapter - 2022)
Time Dependent Biased Random Walks (Journal article - 2022)
A New Temporal Interpretation of Cluster Editing (Chapter - 2022)
Balanced Allocations with Heterogeneous Bins: The Power of Memory (Conference Paper - 2023)

Filter the publication list

Filter list by type

Show all
Journal article
Conference paper
Chapter
Other

2024

The Power of Filling in Balanced Allocations (Journal article)

Los, D., Sauerwald, T., & Sylvester, J. (2024). The Power of Filling in Balanced Allocations. SIAM Journal on Discrete Mathematics, 38(1), 529-565. doi:10.1137/23m1552231

DOI: 10.1137/23m1552231

Rumors with changing credibility (Conference Paper)

Out, C., Rivera, N., Sauerwald, T., & Sylvester, J. (2024). Rumors with changing credibility. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 287. doi:10.4230/LIPIcs.ITCS.2024.86

DOI: 10.4230/LIPIcs.ITCS.2024.86

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes (Conference Paper)

Bonnet, E., Duron, J., Sylvester, J., Zamaraev, V., & Zhukovskii, M. (2024). Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. In Unknown Conference (pp. 1147-1165). Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611977912.44

DOI: 10.1137/1.9781611977912.44

2023

Rumors with Changing Credibility (Preprint)

Tight bounds on adjacency labels for monotone graph classes (Preprint)

Cops and Robbers on Multi-Layer Graphs (Conference Paper)

Jessica, E., William, P., Kitty, M., & Sylvester, J. (2023). Cops and Robbers on Multi-Layer Graphs. In International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2023). doi:10.1007/978-3-031-43380-1_23

DOI: 10.1007/978-3-031-43380-1_23

Mean-Biased Processes for Balanced Allocations (Preprint)

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes (Preprint)

Cops and Robbers on Multi-Layer Graphs (Preprint)

Multiple random walks on graphs: mixing few to cover many (Journal article)

Rivera, N., Sauerwald, T., & Sylvester, J. (2023). Multiple random walks on graphs: mixing few to cover many. COMBINATORICS PROBABILITY & COMPUTING. doi:10.1017/S0963548322000372

DOI: 10.1017/s0963548322000372

Balanced Allocations with Heterogeneous Bins: The Power of Memory (Conference Paper)

Los, D., Sauerwald, T., & Sylvester, J. (2023). Balanced Allocations with Heterogeneous Bins: The Power of Memory. In Unknown Conference (pp. 4448-4477). Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611977554.ch169

DOI: 10.1137/1.9781611977554.ch169

Bounds on the Twin-Width of Product Graphs (Journal article)

Pettersson, W., & Sylvester, J. (2023). Bounds on the Twin-Width of Product Graphs. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 25(1). Retrieved from https://www.webofscience.com/

DOI: 10.46298/dmtcs.10091

Tangled Paths: A Random Graph Model from Mallows Permutations (Conference Paper)

Enright, J., Meeks, K., Pettersson, W., & Sylvester, J. (2023). Tangled Paths: A Random Graph Model from Mallows Permutations. In Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. Masaryk University Press. doi:10.5817/cz.muni.eurocomb23-057

DOI: 10.5817/cz.muni.eurocomb23-057

Tight bounds on adjacency labels for monotone graph classes. (Preprint)

2022

Cover and Hitting Times of Hyperbolic Random Graphs (Conference Paper)

Kiwi, M., Schepers, M., & Sylvester, J. (2022). Cover and Hitting Times of Hyperbolic Random Graphs. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 245. doi:10.4230/LIPIcs.APPROX/RANDOM.2022.30

DOI: 10.4230/LIPIcs.APPROX/RANDOM.2022.30

The cover time of a (multiple) Markov chain with rational transition probabilities is rational (Journal article)

Sylvester, J. (2022). The cover time of a (multiple) Markov chain with rational transition probabilities is rational. STATISTICS & PROBABILITY LETTERS, 187. doi:10.1016/j.spl.2022.109534

DOI: 10.1016/j.spl.2022.109534

Time Dependent Biased Random Walks (Journal article)

Haslegrave, J., Sauerwald, T., & Sylvester, J. (2022). Time Dependent Biased Random Walks. ACM TRANSACTIONS ON ALGORITHMS, 18(2). doi:10.1145/3498848

DOI: 10.1145/3498848

The Power of Filling in Balanced Allocations (Preprint)

Bounds on the Twin-Width of Product Graphs (Preprint)

A New Temporal Interpretation of Cluster Editing (Chapter)

Bocci, C., Capresi, C., Meeks, K., & Sylvester, J. (2022). A New Temporal Interpretation of Cluster Editing. In Unknown Book (Vol. 13270, pp. 214-227). doi:10.1007/978-3-031-06678-8_16

DOI: 10.1007/978-3-031-06678-8_16

Balanced Allocations: Caching and Packing, Twinning and Thinning (Chapter)

Los, D., Sauerwald, T., & Sylvester, J. (2022). Balanced Allocations: Caching and Packing, Twinning and Thinning. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 1847-1874). Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611977073.74

DOI: 10.1137/1.9781611977073.74

The power of two choices for random walks (Journal article)

Georgakopoulos, A., Haslegrave, J., Sauerwald, T., & Sylvester, J. (2022). The power of two choices for random walks. COMBINATORICS PROBABILITY & COMPUTING, 31(1), 73-100. doi:10.1017/S0963548321000183

DOI: 10.1017/S0963548321000183

2021

Tangled Paths: A Random Graph Model from Mallows Permutations (Preprint)

Multiple random walks on graphs: Mixing few to cover many (Conference Paper)

Rivera, N., Sauerwald, T., & Sylvester, J. (2021). Multiple random walks on graphs: Mixing few to cover many. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 198. doi:10.4230/LIPIcs.ICALP.2021.107

DOI: 10.4230/LIPIcs.ICALP.2021.107

Random walk hitting times and effective resistance in sparsely connected Erdos-Renyi random graphs (Journal article)

Sylvester, J. (2021). Random walk hitting times and effective resistance in sparsely connected Erdos-Renyi random graphs. JOURNAL OF GRAPH THEORY, 96(1), 44-84. doi:10.1002/jgt.22551

DOI: 10.1002/jgt.22551

The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation (Chapter)

Enright, J., Lee, D., Meeks, K., Pettersson, W., & Sylvester, J. (2021). The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation. In Unknown Book (Vol. 13135, pp. 152-166). doi:10.1007/978-3-030-92681-6_13

DOI: 10.1007/978-3-030-92681-6_13

2020

Choice and bias in random walks (Conference Paper)

Georgakopoulos, A., Haslegrave, J., Sauerwald, T., & Sylvester, J. (2020). Choice and bias in random walks. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 151. doi:10.4230/LIPIcs.ITCS.2020.76

DOI: 10.4230/LIPIcs.ITCS.2020.76

2019

The Dispersion Time of RandomWalks on Finite Graphs (Conference Paper)

Rivera, N., Sauerwald, T., Stauffer, A., & Sylvester, J. (2019). The Dispersion Time of RandomWalks on Finite Graphs. In SPAA'19: PROCEEDINGS OF THE 31ST ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURESS, 2019 (pp. 103-113). doi:10.1145/3323165.3323204

DOI: 10.1145/3323165.3323204