Theory and Practice of Discrete Interacting Agents Models

DOI10.1007/978-3-319-46376-6_19zbMath1396.68027OpenAlexW2548190871MaRDI QIDQ4686660

Joana M. Matos, Adrian Horia Dediu, Carlos Martín-Vide

Publication date: 4 October 2018

Published in: Emergent Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-46376-6_19

zbMATH Keywords

random walkcover timeactive particleinfected personwood chip

Mathematics Subject Classification ID

Distributed systems (68M14) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interacting particle systems as stochastic social dynamics
• Design of modern heuristics. Principles and application.
• Cover times for Brownian motion and random walks in two dimensions
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Faster rumor spreading with multiple calls
• Almost tight bounds for rumour spreading with conductance
• Tight bounds on information dissemination in sparse mobile networks
• Multiple Random Walks in Random Regular Graphs
• Multiple Random Walks and Interacting Particle Systems
• Percolation
• A tight upper bound on the cover time for random walks on graphs
• Random Geometric Graphs
• A tight lower bound on the cover time for random walks on graphs

This page was built for publication: Theory and Practice of Discrete Interacting Agents Models