Advertisement

Random walks, gaussian processes and list structures

  • G. Louchard
Probability On Trees
Part of the Lecture Notes in Computer Science book series (LNCS, volume 214)

Abstract

An asymptotic analysis of list structures properties leads to limiting Gaussian Markovian processes. Several costs functions are shown to have asymptotic Normal distributions.

Keywords

Cost Function Random Walk Priority Queue Dominant Term List Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    ABRAMOWITZ, M. and STEGUE, I.A. "Handbook of mathematical functions", 1965, Dover PublicationsGoogle Scholar
  2. [2]
    BILLINGSLEY, P. "Convergence of probability measures", 1968, WileyGoogle Scholar
  3. [3]
    CHUNG, K.L. "Excursions in Brownian Motion", Ark. Mat. 14, 1976, pp. 155–177Google Scholar
  4. [4]
    FELLER, W. "An introduction to probability theory and its applications", Vol.I, 1970, WileyGoogle Scholar
  5. [5]
    FELLER, W. "An introduction to probability theory and its applications", Vol.II, 1971, WileyGoogle Scholar
  6. [6]
    FLAJOLET, P. "Combinatorial aspects of continued fractions", Discr. Math. 32, 1980, pp. 125–161Google Scholar
  7. [7]
    FLAJOLET, P. "Analyse d'algorithmes de manipulation d'arbres et de fichiers", Cahiers du BURO, 1981Google Scholar
  8. [8]
    FLAJOLET, P. and ODLYZKO, A. "The average height of binary trees and other simple trees", J. Comp. Syst. Sc. 25, 2, 1982, pp. 171–213.Google Scholar
  9. [9]
    FLAJOLET, P., PUECH, C. and VUILLEMIN, J. "The analysis of simple list structures", to appear in Information Sc.: and Int. J.Google Scholar
  10. [10]
    FLAJOLET, P. and PRODINGER, H. "Register allocation for unary-binary trees", to appear in SIAM J. Comput.Google Scholar
  11. [11]
    GREENE, D.H. and KNUTH, D.E. "Hathematics for the analysis of algorithms", 1981, BirkhaüserGoogle Scholar
  12. [12]
    ITO, K. and Mc KEAN, H.P. Jr "Diffusion processes and their sample paths", Sec. Ed., 1976, Springer-VerlagGoogle Scholar
  13. [13]
    LOUCHARD, D., "The Brownian Motion: a neglected tool for the complexity analysis of sorted tables manipulations", RAIRO, Inf. Th. 17, 4, 1983, pp. 365–385Google Scholar
  14. [14]
    LOUCHARD, G. "Kac's formula, Levy's local time and Brownian excursion", J. Appl. Prob. 21, 1984, pp. 479–499.Google Scholar
  15. [15]
    LOUCHARD, G. "The Brownian excursion area: a numerical analysis", Comp. and Math. with Appl. 10, 6, 1984, pp. 413–417Google Scholar
  16. [16]
    LOUCHARD, G. "Brownian Motion and Algorithms Complexity", to appear in B.I.T.Google Scholar
  17. [17]
    LOUCHARD, G. "Random Walks, Gaussian Processes and List Structures", L.I.T. Technical Report No152Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • G. Louchard
    • 1
  1. 1.Laboratoire d'Informatique ThéoriqueUniversité Libre de BruxellesBrusselsBelgium

Personalised recommendations