Dynamics of Multiple, Interacting and Concurrent Markov Chains

Project Information

DYNAMICMARCH

Grant agreement ID: 679660

DOI 10.3030/679660

Project closed

EC signature date 25 January 2016

Start date 1 May 2016

End date 30 April 2021

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost € 1 400 789,00

EU contribution € 1 400 789,00

Coordinated by

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

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Peer reviewed articles (1)

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

Author(s): John Sylvester
Published in: Journal of Graph Theory, Issue 96/1, 2021, Page(s) 44-84, ISSN 0364-9024
Publisher: John Wiley & Sons Inc.
DOI: 10.1002/jgt.22551

Conference proceedings (6)

Multiple Random Walks on Paths and Grids

Author(s): Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald
Published in: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Issue 66, 2017, Page(s) 44:1--44:14, ISSN 1868-8969
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.STACS.2017.44

Randomized Load Balancing on Networks with Stochastic Inputs

Author(s): Leran Cai, Thomas Sauerwald
Published in: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, Page(s) 139:1--139:14
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

The dispersion time of random walks on finite graphs

Author(s): Nicolas Rivera, Thomas Sauerwald, Alexandre Stauffer, John Sylvester
Published in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019
Publisher: ACM

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

Author(s): Varun Kanade, Frederik-Mallmann-Trenn, Thomas Sauerwald
Published in: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Publisher: ACM

Spread of Information and Diseases via Random Walks in Sparse Graphs

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

Multiple Random Walks on Graphs: Mixing Few to Cover Many

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

Non-peer reviewed articles (1)

Multiple Random Walks

Author(s): Thomas Sauerwald
Published in: Science & Technology 24, 2017, Page(s) 60-61, ISSN 1868-8969
Publisher: Pan European Networks