• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Probabilistic Methods in Combinatorial Analysis

Probabilistic Methods in Combinatorial Analysis

Hardcover

Series: Encyclopedia of Mathematics and Its Applications, Book 56

General MathematicsProbability & Statistics

ISBN10: 052145512X
ISBN13: 9780521455121
Publisher: Cambridge University Press
Published: May 15 1997
Pages: 260
Weight: 1.00
Height: 0.81 Width: 6.40 Depth: 9.47
Language: English
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.

1 different editions

Also available

Also in

Probability & Statistics