Finite particle systems and infection models

DOI10.1017/S0305004100060989MaRDI QIDQ3317877zbMATH OpenFDO

Authors Peter Donnelly, D. J. A. Welsh

Publication date 1983

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

zbMATH Keywords

voter modelprobabilities of absorptioninfection modelsopen questions and conjectures

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(25)

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

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)