Probabilistic methods in combinatorial analysis:

This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorem...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Sachkov, Vladimir Nikolaevich (VerfasserIn)
Format: Elektronisch E-Book
Sprache:English
Veröffentlicht: Cambridge Cambridge University Press 1997
Schriftenreihe:Encyclopedia of mathematics and its applications volume 56
Schlagworte:
Online-Zugang:BSB01
FHN01
Volltext
Zusammenfassung:This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorems. The basic objects under investigation are nonnegative matrices, partitions and mappings of finite sets, with special emphasis on permutations and graphs, and equivalence classes specified on sequences of finite length consisting of elements of partially ordered sets; these specify the probabilistic setting of Sachkov's general combinatorial scheme. The author pays special attention to using probabilistic methods to obtain asymptotic formulae that are difficult to derive using combinatorial methods. This was an important book, describing many ideas not previously available in English; the author has taken the chance to rewrite parts of the text and refresh the references where appropriate
Beschreibung:Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Beschreibung:1 online resource (x, 246 pages)
ISBN:9780511666193
DOI:10.1017/CBO9780511666193

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen