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...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
1997
|
| Series: | Encyclopedia of mathematics and its applications
|
| Subjects: | |
| Online Access: | |
| Collection: | Cambridge Books Online - Collection details see MPG.ReNa |
Table of Contents:
- 1. Relevant elements of probability theory
- 2. Combinatorial properties of 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