Probabilistic Methods in Combinatorial Analysis

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.

Author: V. N. Sachkov,V. N. Sachov,V. Sachkov
Publisher: Cambridge University Press
Published: 05/15/1997
Pages: 260
Binding Type: Hardcover
Weight: 1.00lbs
Size: 9.47h x 6.40w x 0.81d
ISBN: 9780521455121

This title is not returnable