Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. A survey of multivar ...
Article

A survey of multivariate aspects of the contraction method

Ralph Neininger (1), Ludger Rüschendorf (2)
(1) FB Informatik und Mathematik
(2) Mathematisches Institut [Freiburg]
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2006
Last modified on
March 31, 2025
Volume 8
vol. 8
DOI
10.46298/dmtcs.369
License
https://about.hal.science/hal-authorisation-v1
Indicators
923
Views
864
Downloads

A survey of multivariate aspects of the contraction method

Ralph Neininger (1), Ludger Rüschendorf (2)
(1) FB Informatik und Mathematik
(2) Mathematisches Institut [Freiburg]
Abstract
We survey multivariate limit theorems in the framework of the contraction method for recursive sequences as arising in the analysis of algorithms, random trees or branching processes. We compare and improve various general conditions under which limit laws can be obtained, state related open problems and give applications to the analysis of algorithms and branching recurrences.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Cited by

Source: OpenCitations

  • Smoothing Equations for Large Pólya Urns

    Journal of Theoretical Probability

    Authors : Brigitte Chauvin, Cécile Mailler ORCID, Nicolas Pouyanne

    Journal reference : Volume 28, 2013, pp. 923-957

    DOI : 10.1007/s10959-013-0530-z

  • Dependence between path-length and size in random digital trees

    Journal of Applied Probability

    Authors : Michael Fuchs ORCID, Hsien-Kuei Hwang ORCID

    Journal reference : Volume 54, 2017, pp. 1125-1143

    DOI : 10.1017/jpr.2017.56

  • On the silhouette of binary search trees

    The Annals of Applied Probability

    Authors : Rudolf Grübel

    Journal reference : Volume 19, 2009, pp.

    DOI : 10.1214/08-aap593

  • Weighted height of random trees

    Acta Informatica

    Authors : N. Broutin, L. Devroye ORCID, E. McLeish

    Journal reference : Volume 45, 2008, pp. 237-277

    DOI : 10.1007/s00236-008-0069-0

  • On 2-protected nodes in random digital trees

    Theoretical Computer Science

    Authors : M. Fuchs ORCID, C.-K. Lee, G.-R. Yu ORCID

    Journal reference : Volume 622, 2016, pp. 111-122

    DOI : 10.1016/j.tcs.2016.02.007
Preview
Loading PDF preview...