Leader election using random walks
zbMath1355.60057arXiv1607.08731MaRDI QIDQ2954460
Alexander Marynych, Gerold Alsmeyer, Zakhar Kabluchko
Publication date: 13 January 2017
Full work available at URL: https://arxiv.org/abs/1607.08731
random walksleader electionGalton-Watson branching processrandom sievestochastic fixed-point equationstable point processrestricted self-similarity
Central limit and other weak theorems (60F05) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Self-similar stochastic processes (60G18) Stable stochastic processes (60G52) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Coalescence in the recent past in rapidly growing populations
- Stability for random measures, point processes and discrete semigroups
- A leader-election procedure using records
- How to select a loser
- Strictly stable distributions on convex cones
- Semi-selfsimilar processes
- On the distribution for the duration of a randomized leader election algorithm
- Analysis of an asymmetric leader election algorithm
- On the multiplicity of the maximum in a discrete random sample
- Distances in random graphs with finite mean and infinite variance degrees
- Almost sure convergence in Markov branching processes with infinite mean
- The simple branching process: a note on convergence when the mean is infinite
- On the asymptotic behaviour of branching processes with infinite mean
- Inequalities for the $r$th Absolute Moment of a Sum of Random Variables, $1 \leqq r \leqq 2$
- Leader election: a Markov chain approach
- Moment Convergence of Sample Extremes
- The Galton-Watson process with infinite mean
- The simple branching process with infinite mean. I
This page was built for publication: Leader election using random walks
