Nicht aus der Schweiz? Besuchen Sie lehmanns.de

Random Trees

An Interplay between Combinatorics and Probability

(Autor)

Buch | Hardcover
XVII, 458 Seiten
2008 | 2009
Springer Wien (Verlag)
978-3-211-75355-2 (ISBN)

Lese- und Medienproben

Random Trees - Michael Drmota
CHF 209,70 inkl. MwSt
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.

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.

Erscheint lt. Verlag 22.12.2008
Zusatzinfo XVII, 458 p.
Verlagsort Vienna
Sprache englisch
Maße 155 x 235 mm
Gewicht 1860 g
Themenwelt Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Schlagworte Algebra • algorithms • combinatorics • data structures • Graph • graph theory • Probability • Random trees • Stochastic Processes
ISBN-10 3-211-75355-9 / 3211753559
ISBN-13 978-3-211-75355-2 / 9783211753552
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich

von Jim Sizemore; John Paul Mueller

Buch | Softcover (2024)
Wiley-VCH (Verlag)
CHF 39,20
Eine Einführung in die faszinierende Welt des Zufalls

von Norbert Henze

Buch | Softcover (2024)
Springer Spektrum (Verlag)
CHF 55,95