308,15 €
342,39 €
-10% with code: EXTRA
Random Trees
Random Trees
308,15
342,39 €
  • We will send in 10–14 business days.
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 tr…
  • Publisher:
  • Year: 2008
  • Pages: 458
  • ISBN-10: 3211753559
  • ISBN-13: 9783211753552
  • Format: 16 x 23.9 x 3.6 cm, hardcover
  • Language: English
  • SAVE -10% with code: EXTRA

Random Trees (e-book) (used book) | Michael Drmota | bookbook.eu

Reviews

(4.00 Goodreads rating)

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.

EXTRA 10 % discount with code: EXTRA

308,15
342,39 €
We will send in 10–14 business days.

The promotion ends in 19d.17:46:32

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 3,42 Book Euros!?
  • Author: Michael Drmota
  • Publisher:
  • Year: 2008
  • Pages: 458
  • ISBN-10: 3211753559
  • ISBN-13: 9783211753552
  • Format: 16 x 23.9 x 3.6 cm, hardcover
  • Language: English English

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.

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)