Perpetuities in Fair Leader Election Algorithms

DOI10.1239/aap/1396360110zbMath1291.60018OpenAlexW2068252799MaRDI QIDQ5415100

Ravi Kalpathy, Hosam M. Mahmoud

Publication date: 9 May 2014

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

Full work available at URL: https://projecteuclid.org/euclid.aap/1396360110

zbMATH Keywords

weak convergencefunctional equationfixed pointmetric spacerecurrencecontraction methodleader electionperpetuity

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Distributed systems (68M14)

Related Items (6)

Bivariate issues in leader election algorithms with Marshall-Olkin limit distribution ⋮ Survivors in leader election algorithms ⋮ On a leader election algorithm: truncated geometric case study ⋮ From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader ⋮ The asymmetric leader election algorithm: Number of survivors near the end of the game ⋮ A binomial splitting process in connection with corner parking problems

Cites Work

• Unnamed Item
• Unnamed Item
• The asymmetric leader election algorithm: another approach
• How to select a loser
• On distributional properties of perpetuities
• Distributional analysis of swaps in quick select
• Some asymptotic theory for the bootstrap
• On the distribution for the duration of a randomized leader election algorithm
• Analysis of an asymmetric leader election algorithm
• A general limit theorem for recursive algorithms and combinatorial structures
• The contraction method for recursive algorithms
• Number of survivors in the presence of a demon
• Asymptotic Properties of a Leader Election Algorithm
• Analysis of swaps in radix selection
• On a stochastic difference equation and a representation of non–negative infinitely divisible random variables
• Convergence of some leader election algorithms
• Comparisons in Hoare's Find Algorithm
• One-sided variations on interval trees
• Probability metrics and recursive algorithms
• A limit theorem for “quicksort”

This page was built for publication: Perpetuities in Fair Leader Election Algorithms