Asymptotic properties of a leader election algorithm

DOI10.1239/JAP/1308662645MaRDI QIDQ3014993zbMATH OpenOpenAlexFDO

Authors Ravi Kalpathy, Hosam M. Mahmoud, Mark Daniel Ward

Publication date 8 July 2011

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

Full work available at URL https://semanticscholar.org/paper/6b64bcbd003d7be12b6478bfe37073b87b89bb46

zbMATH Keywords

analytic combinatoricscontraction methodfixed pointleader electionRice's methodWasserstein metric spaceweak convergence

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05) Central limit and other weak theorems (60F05) Analysis of algorithms (68W40)

Recommendations

• Analysis of an asymmetric leader election algorithm
• Asymptotic and numerical studies of the leader election algorithm
• Convergence of some leader election algorithms
• The asymmetric leader election algorithm: number of survivors near the end of the game
• On the distribution for the duration of a randomized leader election algorithm

Cites work

• A general limit theorem for recursive algorithms and combinatorial structures
• A limit theorem for “quicksort”
• A limit theory for random skip lists
• Advancing in the presence of a demon
• Analysis of an asymmetric leader election algorithm
• How to select a loser
• scientific article; zbMATH DE number 435515 (Why is no real title available?)
• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• scientific article; zbMATH DE number 140487 (Why is no real title available?)
• Mellin transforms and asymptotics: Finite differences and Rice's integrals
• Number of survivors in the presence of a demon
• On the distribution for the duration of a randomized leader election algorithm
• Recursive random variables with subgaussian distributions
• The contraction method for recursive algorithms

Cited in

(26)

• On the distribution for the duration of a randomized leader election algorithm
• Analysis of an asymmetric leader election algorithm
• Dimension of k-leaders
• Leader election in the presence of n-1 initial failures
• Analysis of fully distributed splitting and naming probabilistic procedures and applications
• Survivors in leader election algorithms
• On a leader election algorithm: truncated geometric case study
• Asymptotic analysis of a leader election algorithm
• scientific article; zbMATH DE number 1696668 (Why is no real title available?)
• Configuration symmetry and performance upper bound of one-dimensional cellular automata for the leader election problem
• Analysis of fully distributed splitting and naming probabilistic procedures and applications (extended abstract)
• Bivariate issues in leader election algorithms with Marshall-Olkin limit distribution
• Convergence of some leader election algorithms
• Asymptotic and numerical studies of the leader election algorithm
• From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader
• Exponential Separations in the Energy Complexity of Leader Election
• Perpetuities in fair leader election algorithms
• The asymmetric leader election algorithm: number of survivors near the end of the game
• Leader election: a Markov chain approach
• Perpetuities in fair leader election algorithms
• On the Complexity of Universal Leader Election
• Leader election in SINR model with arbitrary power control
• The asymmetric leader election algorithm: another approach
• A leader-election procedure using records
• Cost distribution of the Chang-Roberts leader election algorithm and related problems
• On distribution of the leadership time in counting votes and predicting winners

This page was built for publication: Asymptotic properties of a leader election algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3014993)