Probabilistic Methods in Combinatorial Analysis
Probabilistic Methods in Combinatorial Analysis
V. A. Vatutin
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact [email protected] providing details of the course you are teaching.
This work explores the role of probabilistic methods for solving combinatorial problems. The subjects studied 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 define 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 important book describes many ideas not previously available in English and will be of interest to graduate students and professionals in mathematics and probability theory.
- Never available before in English
- Unified and simple approach
- Lots of results given explicitly so useful as reference
Product details
March 2011Adobe eBook Reader
9780511884887
0 pages
0kg
This ISBN is for an eBook version which is distributed on our behalf by a third party.
Table of Contents
- Preface
- Preface to the English edition
- Introduction
- 1. Relevant elements from probability theory
- 2. Combinatorial properties or random nonnegative matrices
- 3. Probabilistic problems in the general combinatorial scheme
- 4. Random partitions of sets
- 5. Random permutations
- 6. Random graphs and random mappings
- Bibliography
- Index.
