Dynamics of Multiple, Interacting and Concurrent Markov Chains

Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs

Autorzy: John Sylvester
Opublikowane w: Journal of Graph Theory, Numer 96/1, 2021, Strona(/y) 44-84, ISSN 0364-9024
Wydawca: John Wiley & Sons Inc.
DOI: 10.1002/jgt.22551

Multiple Random Walks on Paths and Grids

Autorzy: Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald
Opublikowane w: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Numer 66, 2017, Strona(/y) 44:1--44:14, ISSN 1868-8969
Wydawca: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.STACS.2017.44

Randomized Load Balancing on Networks with Stochastic Inputs

Autorzy: Leran Cai, Thomas Sauerwald
Opublikowane w: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, Strona(/y) 139:1--139:14
Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

The dispersion time of random walks on finite graphs

Autorzy: Nicolas Rivera, Thomas Sauerwald, Alexandre Stauffer, John Sylvester
Opublikowane w: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019
Wydawca: ACM

On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract

Autorzy: Varun Kanade, Frederik-Mallmann-Trenn, Thomas Sauerwald
Opublikowane w: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Wydawca: ACM

Spread of Information and Diseases via Random Walks in Sparse Graphs

Autorzy: George Giakkoupis, Hayk Saribekyan, Thomas Sauerwald
Opublikowane w: 34th International Symposium on Distributed Computing (DISC 2020), 2020, ISBN 978-3-95977-168-9
Wydawca: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"

Multiple Random Walks on Graphs: Mixing Few to Cover Many

Autorzy: Nicolas Rivera, Thomas Sauerwald, John Sylvester
Opublikowane w: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 2021
Wydawca: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.icalp.2021.107

Multiple Random Walks

Autorzy: Thomas Sauerwald
Opublikowane w: Science & Technology 24, 2017, Strona(/y) 60-61, ISSN 1868-8969
Wydawca: Pan European Networks

Publikacje

Udostępnij tę stronę

Pobierz