9783211999141 - Random Trees: An Interplay between Combinatorics and Probability di Drmota, Michael (11 risultati)

Condizione: New. In.

Condizione: New. pp. 478.

Taschenbuch. Condizione: Neu. Random Trees | An Interplay between Combinatorics and Probability | Michael Drmota | Taschenbuch | xvii | Englisch | 2010 | Springer | EAN 9783211999141 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Condizione: new. Questo è un articolo print on demand.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 476 pp. Englisch.

Kartoniert / Broschiert. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Reference Book for asymptotic tree statisticsFoundations for the analysis of recursive algorithmsResearch monograph on the interplay between combinatorics and probability theoryClasses of Random Trees.- Generating Functions.- Advanc.

Condizione: New. Print on Demand pp. 478 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 476 pp. Englisch.

Condizione: New. PRINT ON DEMAND pp. 478.