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 条
  • [41] Probabilistic adaptations of point generation schemes in some global optimization algorithms
    Kaelo, P
    Ali, MM
    OPTIMIZATION METHODS & SOFTWARE, 2006, 21 (03): : 343 - 357
  • [42] Computational Complexity Analysis of Decision Tree Algorithms
    Sani, Habiba Muhammad
    Lei, Ci
    Neagu, Daniel
    ARTIFICIAL INTELLIGENCE XXXV (AI 2018), 2018, 11311 : 191 - 197
  • [43] Efficient Algorithms for Quantitative Attack Tree Analysis
    Budde, Carlos E.
    Stoelinga, Marieelle
    2021 IEEE 34TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2021), 2021, : 377 - 391
  • [44] A simulation framework for the analysis of multicast tree algorithms
    Alrabiah, T
    Znati, TF
    30TH ANNUAL SIMULATION SYMPOSIUM, PROCEEDINGS, 1997, : 196 - 205
  • [45] Design and Analysis of Distributed Tree Growing Algorithms
    de Miranda, Marcio Nunes
    Figueiredo, Daniel Ratton
    Luiz, Daniel Frazao
    Carvalho, Celso Barbosa
    Menasche, Daniel Sadoc
    IEEE ACCESS, 2022, 10 : 26580 - 26602
  • [46] EXACT ANALYSIS OF 3 TREE CONTRACTION ALGORITHMS
    PLANDOWSKI, W
    RYTTER, W
    SZYMACHA, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 370 - 379
  • [47] Linkage Tree Genetic Algorithms: Variants and Analysis
    Goldman, Brian W.
    Tauritz, Daniel R.
    PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2012, : 625 - 632
  • [48] ANALYSIS OF TREE ALGORITHMS FOR THE SIMULATION EVENT LIST
    KINGSTON, JH
    ACTA INFORMATICA, 1985, 22 (01) : 15 - 33
  • [49] Probabilistic Analysis of Sampling based Path Planning Algorithms
    Bera, Titas
    Bhat, M. Seetharama
    Ghose, D.
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INTELLIGENT CONTROL (ISIC), 2013, : 370 - 375
  • [50] PROBABILISTIC ROBUSTNESS ANALYSIS-RISKS, COMPLEXITY, AND ALGORITHMS
    Chen, Xinjia
    Zhou, Kemin
    Aravena, Jorge
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2008, 47 (05) : 2693 - 2723
12345