My Account | Home| Bulletin Board| Cart | Help
Close Session
IISER-KIndian Institute of Science Education & Research - Kolkata
Quick Search
Search Terms:
All Documents
Books
Newspapers
Periodicals
Articles
Theses
E-Books
Database : IISERK

Set Session Filters
Login to ask the library to add a book.
Active Filter Settings
No Active Filters
There are 0 titles in your cart.

Search History
Recommended Reading
first record | previous record | next record | last record
full | marc
Record 1 of 2
  Total Requests  0      Unsatisfied Requests  0
You searched IISERK - Subject: Air Pollution Prévision.
Request
Call Number 511/.6
Author Spencer, Joel H.
Title Ten lectures on the probabilistic method [electronic resource] / Joel Spencer.
Publication Philadelphia, Pa. : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), 1994.
Material Info. 1 electronic text (vi, 88 p.) : ill., digital file.
Series CBMS-NSF regional conference series in applied mathematics ; 64
Series CBMS-NSF regional conference series in applied mathematics ; 64.
Summary Note This update of the 1987 title of the same name is an examination of what is currently known about the probabilistic method, written by one of its principal developers. Based on the notes from Spencer's 1986 series of ten lectures, this new edition contains an additional lecture: The Janson inequalities. These inequalities allow accurate approximation of extremely small probabilities. A new algorithmic approach to the Lovasz Local Lemma, attributed to Jozsef Beck, has been added to Lecture 8, as well. Throughout the monograph, Spencer retains the informal style of his original lecture notes and emphasizes the methodology, shunning the more technical "best possible" results in favor of clearer exposition. The book is not encyclopedic--it contains only those examples that clearly display the methodology. The probabilistic method is a powerful tool in graph theory, combinatorics, and theoretical computer science. It allows one to prove the existence of objects with certain properties (e.g., colorings) by showing that an appropriately defined random object has positive probability of having those properties.
Notes Includes bibliographical references and index.
Notes The probabilistic method -- The deletion method and other refinements -- Random graphs I -- Large deviations and nonprobabilistic algorithms -- Discrepancy I -- Chaos from order -- Random graphs II -- The Lovasz local lemma -- Discrepancy II -- Six standard deviations suffice -- The Janson inequalities.
ISBN 9781611970074 (electronic bk.)
Subject Combinatorial analysis.
Subject Probabilities.
Subject Probabilistic method
Subject Deletion method
Subject Random graphs
Subject Lovász local lemma
Subject Standard deviations
Subject Janson inequalities
Added Entry Society for Industrial and Applied Mathematics.
Date Year, Month, Day:01405141
Link SIAM

Keyword Search

 Words: Search Type:
 
 

Database: IISERK

Any filter options that are chosen below will be combined with the Session Filters and applied to the search.
Nature of Contents Filters Format Filters

Including Excluding

Including Excluding
Language Filters Place of Publication Filters

Including Excluding

Including Excluding
Publication Date Context Date
  -     -  

Set Session Filters
Select below to return to the last:
Copyright © 2014 VTLS Inc. All rights reserved.
VTLS.com