The Probabilistic Method, 3rd Edition
"Serious researchers in combinatorics or algorithm design will
wish to read the book in its entirety...the book may also be
enjoyed on a lighter level since the different chapters are largely
independent and so it is possible to pick out gems in one's own
—Formal Aspects of Computing
This Third Edition of The Probabilistic Method reflects the most recent developments in the field while maintaining the standard of excellence that established this book as the leading reference on probabilistic methods in combinatorics. Maintaining its clear writing style, illustrative examples, and practical exercises, this new edition emphasizes methodology, enabling readers to use probabilistic techniques for solving problems in such fields as theoretical computer science, mathematics, and statistical physics.
The book begins with a description of tools applied in probabilistic arguments, including basic techniques that use expectation and variance as well as the more recent applications of martingales and correlation inequalities. Next, the authors examine where probabilistic techniques have been applied successfully, exploring such topics as discrepancy and random graphs, circuit complexity, computational geometry, and derandomization of randomized algorithms. Sections labeled "The Probabilistic Lens" offer additional insights into the application of the probabilistic approach, and the appendix has been updated to include methodologies for finding lower bounds for Large Deviations.
The Third Edition also features:
A new chapter on graph property testing, which is a current topic that incorporates combinatorial, probabilistic, and algorithmic techniques
An elementary approach using probabilistic techniques to the powerful Szemerédi Regularity Lemma and its applications
New sections devoted to percolation and liar games
A new chapter that provides a modern treatment of the Erdös-Rényi phase transition in the Random Graph Process
Written by two leading authorities in the field, The Probabilistic Method, Third Edition is an ideal reference for researchers in combinatorics and algorithm design who would like to better understand the use of probabilistic methods. The book's numerous exercises and examples also make it an excellent textbook for graduate-level courses in mathematics and computer science.
PART I. METHODS.
1. The Basic Method.
1.1 The Probabilistic Method.
1.2 Graph Theory.
1.4 Combinatorial Number Theory.
1.5 Disjoint Pairs.
The Probabilistic Lens: The Erd" osKoRado Theorem.
2. Linearity of Expectation.
2.2 Splitting Graphs.
2.3 Two Quickies.
2.4 Balancing Vectors.
2.5 Unbalancing Lights.
2.6 Without Coin Flips.
The Probabilistic Lens: Brégman’s Theorem.
3.1 Ramsey Numbers.
3.2 Independent Sets.
3.3 Combinatorial Geometry.
3.6 Continuous Time.
The Probabilistic Lens: High Girth and High Chromatic Number.
4. The Second Moment.
4.2 Number Theory.
4.3 More Basics.
4.4 Random Graphs.
4.5 Clique Number.
4.6 Distinct Sums.
4.7 The Rödl Nibble.
The Probabilistic Lens: Hamiltonian Paths.
5. The Local Lemma.
5.1 The Lemma.
5.2 Property B and Multicolored Sets of Real Numbers.
5.3 Lower Bounds for Ramsey Numbers.
5.4 A Geometric Result.
5.5 The Linear Arboricity of Graphs.
5.6 Latin Transversals.
5.7 The Algorithmic Aspect.
The Probabilistic Lens: Directed Cycles.
6. Correlation Inequalities.
6.1 The Four Functions Theorem of Ahlswede.
6.2 The FKG Inequality.
6.3 Monotone Properties.
6.4 Linear Extensions of Partially Ordered Sets.
The Probabilistic Lens: Turán’s Theorem.
7. Martingales and Tight Concentration.
7.2 Large Deviations.
7.3 Chromatic Number.
7.4 Two General Settings.
7.5 Four Illustrations.
7.6 Talagrand’s Inequality.
7.7 Applications of Talagrand’s Inequality.
The Probabilistic Lens: Weierstrass Approximation Theorem.
8. The Poisson Paradigm.
8.1 The Janson Inequalities.
8.2 The Proofs.
8.3 Brun’s Sieve.
8.4 Large Deviations.
8.5 Counting Extensions.
8.6 Counting Representations.
8.7 Further Inequalities.
The Probabilistic Lens: Local Coloring.
9.1 The Quadratic Residue Tournaments.
9.2 Eigenvalues and Expanders.
9.3 Quasi Random Graphs.
The Probabilistic Lens: Random Walks.
PART II. TOPICS.
10 Random Graphs.
10.2 Clique Number.
10.3 Chromatic Number.
10.4 ZeroOne Laws.
The Probabilistic Lens: Counting Subgraphs.
11. The Erd" osR.
‘enyi Phase Transition.
11.1 An Overview.
11.2 Three Processes.
11.3 The GaltonWatson Branching Process.
11.4 Analysis of the Poisson Branching Process.
11.5 The Graph Branching Model.
11.6 The Graph and Poisson Processes Compared.
11.7 The Parametrization Explained.
11.8 The Subcritical Regions.
11.9 The Supercritical Regimes.
11.10 The Critical Window.
11.11 Analogies to Classical Percolation Theory.
The Probabilistic Lens: The Rich Get Richer.
12. Circuit Complexity.
12.1 Preliminaries 318.
12.2 Random Restrictions and BoundedDepth Circuits.
12.3 More on BoundedDepth Circuits.
12.4 Monotone Circuits.
The Probabilistic Lens: Maximal Antichains.
13.2 Six Standard Deviations Suffice.
13.3 Linear and Hereditary Discrepancy.
13.4 Lower Bounds.
13.5 The BeckFiala Theorem.
The Probabilistic Lens: Unbalancing Lights.
14.1 The Greatest Angle among Points in Euclidean Spaces.
14.2 Empty Triangles Determined by Points in the Plane.
14.3 Geometrical Realizations of Sign Matrices.
14.4 QNets and VCDimensions of Range Spaces.
14.5 Dual Shatter Functions and Discrepancy.
The Probabilistic Lens: Efficient Packing.
15. Codes, Games and Entropy.
15.2 Liar Game.
15.3 Tenure Game.
15.4 Balancing Vector Game.
15.5 Nonadaptive Algorithms.
15.6 Half Liar Game.
The Probabilistic Lens: An Extremal Graph.
16.1 The Method of Conditional Probabilities.
16.2 dWise Independent Random Variables in Small Sample Spaces.
The Probabilistic Lens: Crossing Numbers, Incidences, Sums and Products.
17. Graph Property Testing.
17.1 Property Testing.
17.2 Testing colorability.
17.3 Szemer ’edi’s Regularity Lemma.
17.4 Testing trianglefreeness.
17.5 Characterizing the testable graph properties.
The Probabilistic Lens: Tur?an Numbers and Dependent Random Choice.
Appendix A: Bounding of Large Deviations.
A.1 Chernoff Bounds.
A.2 Lower Bounds.
The Probabilistic Lens: Trianglefree Graphs Have Large Independence Numbers.
Appendix B: Paul Erd" os.
B.3 On Erd" os.
B.4 Uncle Paul.
JOEL H. SPENCER, PhD, is Professor of Mathematics and Computer Science at the Courant Institute of Mathematical Sciences at New York University and is the cofounder and coeditor of the journal Random Structures and Algorithms. Dr. Spencer has written over 150 published articles and is the coauthor of Ramsey Theory, Second Edition, also published by Wiley.
New chapter devoted to Graph Property Testing and the included sections are Graph Property Testing; Testing Colorability; Szemeredi's Regularity Lemma; Testing Triangle-Freeness; and Characterizing the Testable Graph Properties.
New sections have also been added on Percolation, Webgraphs, and Chernoff Bounds.
A substantial revision has been made to the Double Jump section.
The number of exercises included in the third edition has been almost doubled from that of the second edition, and hints and/or answers to some of the exercises are provided.
- This is the only book that is totally devoted to the probabilistic method, which is used to show the existence of combinatorial objects by studying appropriately defined random objects.
- This book explores probabilistic methods in an accessible way, and extensive exercises compliment the approach and style of the book.
- The number of exercises has been increased significantly with an eye towards use in graduate courses.
- Written by well-known authorities in the field, this book has an informal, clear, and precise style and approach.
- The entire manuscript has been reexamined and revised where necessary in order to reflect the recent developments in the field.