Amazon cover image
Image from Amazon.com

Random trees: an interplay between combinatorics and probability

By: Material type: TextTextPublication details: Springer 2009 Wien ; LondonDescription: xi, 439p. Includes references and indexISBN:
  • 9783211999141
Subject(s): DDC classification:
  • 511.52 D7R2
Summary: Out of research related to (random) trees, several asymptotic and probabilistic techniques have been developed to describe characteristics of large trees in different settings. The aim here is to provide an introduction to various aspects of trees in random settings and a systematic treatment of the involved mathematical techniques. https://link.springer.com/book/10.1007/978-3-211-75357-6
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Item location Collection Shelving location Call number Status Date due Barcode
Books Vikram Sarabhai Library Rack 28-A / Slot 1357 (0 Floor, East Wing) Non-fiction General Stacks 511.52 D7R2 (Browse shelf(Opens below)) Available 204754

Table of contents
Machine generated contents note: 1.Classes of Random Trees
2.Generating Functions
3.Advanced Tree Counting
4.The Shape of Galton-Watson Trees and Polya Trees
5.The Vertical Profile of Trees
6.Recursive Trees and Binary Search Trees
7.Tries and Digital Search Trees
8.Recursive Algorithms and the Contraction Method
9.Planar Graphs.

Out of research related to (random) trees, several asymptotic and probabilistic techniques have been developed to describe characteristics of large trees in different settings. The aim here is to provide an introduction to various aspects of trees in random settings and a systematic treatment of the involved mathematical techniques.

https://link.springer.com/book/10.1007/978-3-211-75357-6

There are no comments on this title.

to post a comment.