Probabilistic Methods in Combinatorial Analysis

by Vladimir N. Sachkov, V. A. Vatutin (Translator)

Overview

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.

Product Details

ISBN-13:	9780521455121
Publisher:	Cambridge University Press
Publication date:	05/15/1997
Series:	Encyclopedia of Mathematics and its Applications , #56
Pages:	260
Product dimensions:	6.50(w) x 9.53(h) x 0.79(d)

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.