Random Trees

CHF 188.00
Auf Lager
SKU
QHPPHGE6M7U
Stock 1 Verfügbar
Geliefert zwischen Fr., 13.02.2026 und Mo., 16.02.2026

Details

The aim of this book is to provide a thorough introduction to various aspects of trees in random settings and a systematic treatment of the mathematical analysis techniques involved. It should serve as a reference book as well as a basis for future research.

Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During thelastyearsresearchrelatedto(random)treeshasbeenconstantlyincreasing and several asymptotic and probabilistic techniques have been developed in order to describe characteristics of interest of large trees in di?erent settings. Thepurposeofthisbookistoprovideathoroughintroductionintovarious aspects of trees in randomsettings anda systematic treatment ofthe involved mathematicaltechniques. It shouldserveasa referencebookaswellasa basis for future research. One major conceptual aspect is to connect combinatorial and probabilistic methods that range from counting techniques (generating functions, bijections) over asymptotic methods (singularity analysis, saddle point techniques) to various sophisticated techniques in asymptotic probab- ity (convergence of stochastic processes, martingales). However, the reading of the book requires just basic knowledge in combinatorics, complex analysis, functional analysis and probability theory of master degree level. It is also part of concept of the book to provide full proofs of the major results even if they are technically involved and lengthy.

Reference Book for asymptotic tree statistics Foundations for the analysis of recursive algorithms Research monograph on the interplay between combinatorics and probability theory Includes supplementary material: sn.pub/extras

Inhalt
Classes of Random Trees.- Generating Functions.- Advanced Tree Counting.- The Shape of Galton-Watson Trees and Pólya Trees.- The Vertical Profile of Trees.- Recursive Trees and Binary Search Trees.- Tries and Digital Search Trees.- Recursive Algorithms and the Contraction Method.- Planar Graphs.

Weitere Informationen

  • Allgemeine Informationen
    • GTIN 09783211753552
    • Sprache Englisch
    • Größe H237mm x B30mm x T162mm
    • Jahr 2008
    • EAN 9783211753552
    • Format Fester Einband
    • ISBN 978-3-211-75355-2
    • Titel Random Trees
    • Autor Michael Drmota
    • Untertitel An Interplay between Combinatorics and Probability
    • Gewicht 901g
    • Herausgeber Springer-Verlag KG
    • Anzahl Seiten 458
    • Lesemotiv Verstehen
    • Genre Mathematik

Bewertungen

Schreiben Sie eine Bewertung
Nur registrierte Benutzer können Bewertungen schreiben. Bitte loggen Sie sich ein oder erstellen Sie ein Konto.
Made with ♥ in Switzerland | ©2025 Avento by Gametime AG
Gametime AG | Hohlstrasse 216 | 8004 Zürich | Schweiz | UID: CHE-112.967.470
Kundenservice: customerservice@avento.shop | Tel: +41 44 248 38 38