Reaching consensus on a connected graph

DOI10.1017/jpr.2016.94zbMath1400.60053arXiv1511.05435OpenAlexW2225054234MaRDI QIDQ4684846

John Haslegrave, Mate Puljiz

Publication date: 26 September 2018

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.05435

zbMATH Keywords

voter modelrandom walkcoupon collectorstabilisation time

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (1)

Stochastic analysis of average-based distributed algorithms

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gambler's ruin problem in several dimensions
• On the gambler's ruin problem for a finite Markov chain
• The conditional gambler's ruin problem with ties allowed
• Distributed probabilistic polling and applications to proportionate agreement
• Gambler's ruin probability -- a general formula
• The gambler's ruin problem with delays
• Differentiable coarse graining
• Gambler’s Ruin: The Duration of Play
• The Double Dixie Cup Problem
• Finite particle systems and infection models
• Probability with Martingales
• The Computer Solves the Three Tower Problem
• On the N-tower problem and related problems
• Some New Aspects of the Coupon Collector's Problem
• A model for spatial conflict
• Coalescing Random Walks and Voting on Connected Graphs
• Three-handed gambler's ruin
• Foundations of Genetic Algorithms
• A matrix-analytic approach to the N-player ruin problem

This page was built for publication: Reaching consensus on a connected graph