Leader election: a Markov chain approach

DOI10.14708/ma.v44i1.1141zbMath1370.60117arXiv1604.03047OpenAlexW2963882936MaRDI QIDQ5357641

Klass Hagemann, Rudolf Grübel

Publication date: 12 September 2017

Published in: Mathematica Applicanda (Search for Journal in Brave)

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

zbMATH Keywords

periodicityMarkov chainmaximaboundary theorygeometric distributiontail \(\sigma\)-fieldelection algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Boundary theory for Markov processes (60J50)

Related Items (2)

The size of the last merger and time reversal in \(\Lambda\)-coalescents ⋮ Leader election using random walks

This page was built for publication: Leader election: a Markov chain approach