Your Waterstones card is changing, introducing...
TELL ME MORE
Probabilistic Methods in Combinatorial Analysis - Encyclopedia of Mathematics and Its Applications 56 (Hardback)
  • Probabilistic Methods in Combinatorial Analysis - Encyclopedia of Mathematics and Its Applications 56 (Hardback)
zoom

Probabilistic Methods in Combinatorial Analysis - Encyclopedia of Mathematics and Its Applications 56 (Hardback)

(author), (translator)
£103.00
Hardback 260 Pages / Published: 15/05/1997
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket
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 theorems. The basic objects under investigation 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 specify 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 was an important book, describing many ideas not previously available in English; the author has taken the chance to rewrite parts of the text and refresh the references where appropriate.

Publisher: Cambridge University Press
ISBN: 9780521455121
Number of pages: 260
Weight: 540 g
Dimensions: 234 x 156 x 21 mm

You may also be interested in...

Combinatorial Optimization
Added to basket
Introduction to Graph Theory
Added to basket
Problems in Probability
Added to basket
Discrete Mathematics
Added to basket
A Combinatorial Introduction to Topology
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.