
Random Trees
An Interplay between Combinatorics and Probability
Michael Drmota(Author)
Springer (Publisher)
Published on 22. December 2008
Book
Hardback
XVII, 458 pages
978-3-211-75355-2 (ISBN)
Description
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.
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.
More details
Edition
2009 ed.
Language
English
Place of publication
Vienna
Austria
Publishing group
Springer Wien
Target group
Professional and scholarly
Research
Illustrations
XVII, 458 p.
Dimensions
Height: 23.5 cm
Width: 15.5 cm
Weight
1860 gr
ISBN-13
978-3-211-75355-2 (9783211753552)
DOI
10.1007/978-3-211-75357-6
Schweitzer Classification
Other editions
Additional editions

Book
10/2010
Springer
€149.79
Shipment within 10-15 days

E-Book
04/2009
1st Edition
Springer
€139.09
Available for download
Content
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.