The Asymmetric Leader Election Algorithm: Another Approach
The Asymmetric Leader Election Algorithm: Another Approach
复制标题
非对称领导者选举算法：另一种方法
DOI：
10.1007/s00026-009-0004-2
复制
发表时间：
2009
影响因子：
0.5
通讯作者：
H. Prodinger
中科院分区：
文献类型：
--
作者：
G. Louchard;H. Prodinger
非对称领导人选举算法最近得到了相当多的关注。在这篇文章中，我们想要分析轮数的下列渐近性质：极限分布函数，简单自动的所有矩，p→0，p→1的渐近性质(其中p表示“Killing”概率)。这也带来了一些有趣的新身份。我们使用两个范例：首先，在某些骨灰盒模型中，当涉及到与固定数量的骨灰盒相关的随机变量时，我们具有骨灰盒行为的渐近独立性。接下来，我们使用一种很容易得到极值相关分布函数矩的渐近性的方法。
The asymmetric leader election algorithm has obtained quite a bit of attention lately. In this paper we want to analyze the following asymptotic properties of the number of rounds: Limiting distribution function, all moments in a simple automatic way, asymptotics for p → 0, p → 1 (where p denotes the “killing” probability). This also leads to a few interesting new identities. We use two paradigms: First, in some urn model, we have asymptotic independence of urns behaviour as far as random variables related to urns with a fixed number of balls are concerned. Next, we use a technique easily leading to the asymptotics of the moments of extremevalue related distribution functions.