Random Trees [electronic resource] : An Interplay between Combinatorics and Probability /
Drmota, Michael.author.
Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. This book provides an introduction into various aspects of trees in random settings and a systematic treatment of the involved mathematical techniques.
Description based upon print version of record.
Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. This book provides an introduction into various aspects of trees in random settings and a systematic treatment of the involved mathematical techniques.
Includes bibliographical references (p. [445]- 454) and index.
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.
Discrete mathematics.
Algebra.
Probabilities.
Combinatorics.
Algorithms.
Data structures (Computer science).
Discrete Mathematics.
Algebra.
Probability Theory and Stochastic Processes.
Combinatorics.
Algorithms.
Data Structures.