The probabilistic methods

By: Noga AlonContributor(s): Joel H. SpencerMaterial type: TextTextPublication details: New Jersey: John Wiley & Sons , 2016Description: 375 pISBN: 9781119061953LOC classification: QA164
Contents:
PART I METHODS 1 The Basic Method 2 Linearity of Expectation 3 Alterations 4 The Second Moment 5 The Local Lemma 6 Correlation Inequalities 7 Martingales and Tight Concentration 8 The Poisson Paradigm 9 Quasirandomness PART II TOPICS 10 Random Graphs 11 The Erd˝os–Rényi Phase Transition 12 Circuit Complexityc 13 Discrepancy 14 Geometry 15 Codes, Games, and Entropy 16 Derandomization 17 Graph Property Testing
Summary: Maintaining a standard of excellence that establishes The Probabilistic Method as the leading reference on probabilistic methods in combinatorics, the Fourth Edition continues to feature a clear writing style, illustrative examples, and illuminating exercises. The new edition includes numerous updates to reflect the most recent developments and advances in discrete mathematics and the connections to other areas in mathematics, theoretical computer science, and statistical physics. --- summary provided by publisher
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Collection Shelving location Call number Status Notes Date due Barcode Item holds
Book Book ICTS
Mathematic Rack No 4 QA164 (Browse shelf (Opens below)) Available Billno:IN 00963; Billdate: 2018-05-25 01188
Book Book ICTS
Mathematic Rack No 4 QA164 (Browse shelf (Opens below)) Available Billno:IN 002 168; Billdate: 2016-12-06 00476
Total holds: 0

PART I METHODS
1 The Basic Method
2 Linearity of Expectation
3 Alterations
4 The Second Moment
5 The Local Lemma
6 Correlation Inequalities
7 Martingales and Tight Concentration
8 The Poisson Paradigm
9 Quasirandomness

PART II TOPICS
10 Random Graphs
11 The Erd˝os–Rényi Phase Transition
12 Circuit Complexityc
13 Discrepancy
14 Geometry
15 Codes, Games, and Entropy
16 Derandomization
17 Graph Property Testing

Maintaining a standard of excellence that establishes The Probabilistic Method as the leading reference on probabilistic methods in combinatorics, the Fourth Edition continues to feature a clear writing style, illustrative examples, and illuminating exercises. The new edition includes numerous updates to reflect the most recent developments and advances in discrete mathematics and the connections to other areas in mathematics, theoretical computer science, and statistical physics. --- summary provided by publisher

There are no comments on this title.

to post a comment.