Dynamics of Multiple, Interacting and Concurrent Markov Chains

Informazioni relative al progetto

DYNAMICMARCH

ID dell’accordo di sovvenzione: 679660

DOI 10.3030/679660

Progetto chiuso

Data della firma CE 25 Gennaio 2016

Data di avvio 1 Maggio 2016

Data di completamento 30 Aprile 2021

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale € 1 400 789,00

Contributo UE € 1 400 789,00

Coordinato da

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

Pubblicazioni

Peer reviewed articles (1)

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

Autori: John Sylvester
Pubblicato in: Journal of Graph Theory, Numero 96/1, 2021, Pagina/e 44-84, ISSN 0364-9024
Editore: John Wiley & Sons Inc.
DOI: 10.1002/jgt.22551

Conference proceedings (6)

Multiple Random Walks on Paths and Grids

Autori: Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald
Pubblicato in: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Numero 66, 2017, Pagina/e 44:1--44:14, ISSN 1868-8969
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.STACS.2017.44

Randomized Load Balancing on Networks with Stochastic Inputs

Autori: Leran Cai, Thomas Sauerwald
Pubblicato in: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, Pagina/e 139:1--139:14
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

The dispersion time of random walks on finite graphs

Autori: Nicolas Rivera, Thomas Sauerwald, Alexandre Stauffer, John Sylvester
Pubblicato in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019
Editore: ACM

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

Autori: Varun Kanade, Frederik-Mallmann-Trenn, Thomas Sauerwald
Pubblicato in: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Editore: ACM

Spread of Information and Diseases via Random Walks in Sparse Graphs

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

Multiple Random Walks on Graphs: Mixing Few to Cover Many

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

Non-peer reviewed articles (1)

Multiple Random Walks

Autori: Thomas Sauerwald
Pubblicato in: Science & Technology 24, 2017, Pagina/e 60-61, ISSN 1868-8969
Editore: Pan European Networks