Skip to content
Register Sign in Wishlist

Probabilistic Methods in Combinatorial Analysis

£42.99

Part of Encyclopedia of Mathematics and its Applications

  • Date Published: February 2011
  • availability: Available
  • format: Paperback
  • isbn: 9780521172776

£ 42.99
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback, eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • Never available before in English
    • Unified and simple approach
    • Lots of results given explicitly so useful as reference
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: February 2011
    • format: Paperback
    • isbn: 9780521172776
    • length: 258 pages
    • dimensions: 234 x 156 x 14 mm
    • weight: 0.37kg
    • availability: Available
  • 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.

  • Author

    Vladimir N. Sachkov

    Translator

    V. A. Vatutin

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon
×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×