A probabilistic analysis of some tree algorithms

被引：10
|
作者：
Mohamed, H [1 ]
Robert, P [1 ]
机构：
[1] INRIA, F-78153 Le Chesnay, France
来源：
ANNALS OF APPLIED PROBABILITY | 2005年 / 15卷 / 04期
关键词：
splitting algorithms; divide and conquer algorithms; unusual laws of large numbers; asymptotic oscillating behavior; data structures; tries; renewal theorem;
D O I：
10.1214/105051605000000494
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily without resorting to the usual complex analysis techniques. This approach gives a unified probabilistic treatment of these questions. It simplifies and extends some of the results known in this domain.
引用
收藏
页码：2445 / 2471
页数：27
相关论文
共 50 条
  • [1] PROBABILISTIC ANALYSIS OF SOME DISTRIBUTED ALGORITHMS
    LOUCHARD, G
    SCHOTT, R
    RANDOM STRUCTURES & ALGORITHMS, 1991, 2 (02) : 151 - 186
  • [2] PROBABILISTIC ANALYSIS OF SOME DISTRIBUTED ALGORITHMS
    LOUCHARD, G
    SCHOTT, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 431 : 239 - 253
  • [3] ON SOME CONDITIONING RESULTS IN THE PROBABILISTIC ANALYSIS OF ALGORITHMS
    MCDIARMID, C
    DISCRETE APPLIED MATHEMATICS, 1985, 10 (02) : 197 - 201
  • [4] PROBABILISTIC ANALYSIS OF ALGORITHMS FOR SOME COMBINATORIAL OPTIMIZATION PROBLEMS
    GAZMURI, PG
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1986, 87 : 113 - 126
  • [5] Evaluation of Fault Tree Analysis Algorithms for Probabilistic Risk Assessment: A Systematic Comparative Study
    Afshan, Nailah
    Bodda, Saran Srikanth
    Gupta, Abhinav
    Han, Kevin
    20TH INTERNATIONAL PROBABILISTIC WORKSHOP, IPW 2024, 2024, 494 : 137 - 146
  • [6] On Some Extremal and Probabilistic Questions for Tree Posets
    Patkos, Balazs
    Treglown, Andrew
    ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (01):
  • [7] Efficient Distributed Approximation Algorithms via Probabilistic Tree Embeddings
    Khan, Maleq
    Kuhn, Fabian
    Malkhi, Dahlia
    Pandurangan, Gopal
    Talwar, Kunal
    PODC'08: PROCEEDINGS OF THE 27TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2008, : 263 - +
  • [8] Efficient distributed approximation algorithms via probabilistic tree embeddings
    Khan, Maleq
    Kuhn, Fabian
    Malkhi, Dahlia
    Pandurangan, Gopal
    Talwar, Kunal
    DISTRIBUTED COMPUTING, 2012, 25 (03) : 189 - 205
  • [9] Efficient distributed approximation algorithms via probabilistic tree embeddings
    Maleq Khan
    Fabian Kuhn
    Dahlia Malkhi
    Gopal Pandurangan
    Kunal Talwar
    Distributed Computing, 2012, 25 : 189 - 205
  • [10] Analysis of contention tree algorithms
    Janssen, AJEM
    de Jong, MJM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (06) : 2163 - 2172
12345