Dynamics of Multiple, Interacting and Concurrent Markov Chains

Información del proyecto

DYNAMICMARCH

Identificador del acuerdo de subvención: 679660

DOI 10.3030/679660

Proyecto cerrado

Fecha de la firma de la CE 25 Enero 2016

Fecha de inicio 1 Mayo 2016

Fecha de finalización 30 Abril 2021

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total € 1 400 789,00

Aportación de la UE € 1 400 789,00

Coordinado por

THE CHANCELLOR MASTERS AND SCHOLARS OF THE UNIVERSITY OF CAMBRIDGE
United Kingdom

Publicaciones

Peer reviewed articles (1)

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

Autores: John Sylvester
Publicado en: Journal of Graph Theory, Edición 96/1, 2021, Página(s) 44-84, ISSN 0364-9024
Editor: John Wiley & Sons Inc.
DOI: 10.1002/jgt.22551

Conference proceedings (6)

Multiple Random Walks on Paths and Grids

Autores: Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald
Publicado en: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Edición 66, 2017, Página(s) 44:1--44:14, ISSN 1868-8969
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.STACS.2017.44

Randomized Load Balancing on Networks with Stochastic Inputs

Autores: Leran Cai, Thomas Sauerwald
Publicado en: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, Página(s) 139:1--139:14
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

The dispersion time of random walks on finite graphs

Autores: Nicolas Rivera, Thomas Sauerwald, Alexandre Stauffer, John Sylvester
Publicado en: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019
Editor: ACM

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

Autores: Varun Kanade, Frederik-Mallmann-Trenn, Thomas Sauerwald
Publicado en: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Editor: ACM

Spread of Information and Diseases via Random Walks in Sparse Graphs

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

Multiple Random Walks on Graphs: Mixing Few to Cover Many

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

Non-peer reviewed articles (1)

Multiple Random Walks

Autores: Thomas Sauerwald
Publicado en: Science & Technology 24, 2017, Página(s) 60-61, ISSN 1868-8969
Editor: Pan European Networks