Finite particle systems and infection models

DOI10.1017/S0305004100060989zbMATH Open0534.60095MaRDI QIDQ3317877FDOQ3317877

Authors: Peter Donnelly, D. J. A. Welsh 

Publication date: 1983

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1350307
• Coalescing random walks and voter model consensus times on the torus in \({\mathbb{Z}}^ d\)
• Ergodic behaviour of ``signed voter models
• The infection time of graphs
• Spread of epidemics and rumours with mobile agents

zbMATH Keywords

voter modelprobabilities of absorptioninfection modelsopen questions and conjectures

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites Work

• Additive and cancellative interacting particle systems
• Asymptotics for interacting particle systems onZ d
• Title not available (Why is that?)
• Ergodic theorems for weakly interacting infinite systems and the voter model
• A model for spatial conflict
• Title not available (Why is that?)
• The Differential Equations of Birth-and-Death Processes, and the Stieltjes Moment Problem
• Additive set-valued Markov processes and graphical methods
• Nearest-neighbor Markov interaction processes on multidimensional lattices
• Clustering and dispersion rates for some interacting particle systems of \(Z^1\)
• THE RANDOM WALK [IN CONTINUOUS TIME] AND ITS APPLICATION TO THE THEORY OF QUEUES
• An introduction to infinite particle systems
• Some aspects of the non-asymptotic behaviour of a two-dimensional invasion process

Cited In (25)

• Discordant edges for the voter model on regular random graphs
• Global information from local observations of the noisy voter model on a graph
• A randomised heuristical algorithm for estimating the chromatic number of a graph
• Competing first passage percolation on random regular graphs
• Random walks and diffusion on networks
• A Random Recolouring Method for Graphs and Hypergraphs
• Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs
• On the long term behavior of some finite particle systems
• Directionality of contact networks suppresses selection pressure in evolutionary dynamics
• Local majorities, coalitions and monopolies in graphs: A review
• Analysis of node2vec random walks on networks
• Meeting, coalescence and consensus time on random directed graphs
• Meeting times for independent Markov chains
• Fixation dynamics on multilayer networks
• Reaching consensus on a connected graph
• On an interacting particle system modeling an epidemic
• Probabilistic consensus via polling and majority rules
• A randomised 3-colouring algorithm
• Biased opinion dynamics: when the devil is in the details
• Phase transition of the \(k\)-majority dynamics in biased communication models
• A note on maximizing the spread of influence in social networks
• Discordant voting protocols for cyclically linked agents
• Distributed probabilistic polling and applications to proportionate agreement
• Voting protocols on the star graph
• Clustering as a dual problem to colouring

This page was built for publication: Finite particle systems and infection models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3317877)