
The Probabilistic Method, 3rd Edition
by Noga Alon (Tel Aviv Univ., Israel); Joel H. Spencer (New York Univ. )-
This Item Qualifies for Free Shipping!*
*Excludes marketplace orders.
Rent Textbook
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
eTextbook
We're Sorry
Not Available
Summary
Table of Contents
Dedication | |
Preface | |
Acknowledgments | |
PART IMETHODS. | |
The Basic Method. | |
The Probabilistic Method | |
Graph Theory | |
Combinatorics | |
Combinatorial Number Theory | |
Disjoint Pairs | |
Exercises | |
The Probabilistic Lens: The Erd" osKoRado Theorem | |
Linearity of Expectation. | |
Basics | |
Splitting Graphs | |
Two Quickies | |
Balancing Vectors | |
Unbalancing Lights | |
Without Coin Flips | |
Exercises | |
The Probabilistic Lens: BrégmanÆs Theorem | |
Alterations. | |
Ramsey Numbers | |
Independent Sets | |
Combinatorial Geometry | |
Packing | |
Recoloring | |
Continuous Time | |
Exercises | |
The Probabilistic Lens: High Girth and High Chromatic Number | |
The Second Moment. | |
Basics | |
Number Theory | |
More Basics | |
Random Graphs | |
Clique Number | |
Distinct Sums | |
The Rödl Nibble | |
Exercises | |
The Probabilistic Lens: Hamiltonian Paths | |
The Local Lemma. | |
The Lemma | |
Property B and Multicolored Sets of Real Numbers | |
Lower Bounds for Ramsey Numbers | |
A Geometric Result | |
The Linear Arboricity of Graphs | |
Latin Transversals | |
The Algorithmic Aspect | |
Exercises | |
The Probabilistic Lens: Directed Cycles | |
Correlation Inequalities. | |
The Four Functions Theorem of Ahlswede and Daykin | |
The FKG Inequality | |
Monotone Properties | |
Linear Extensions of Partially Ordered Sets | |
Exercises | |
The Probabilistic Lens: TuránÆs Theorem | |
Martingales and Tight Concentration. | |
Definitions | |
Large Deviations | |
Chromatic Number | |
Two General Settings | |
Four Illustrations | |
TalagrandÆs Inequality | |
Applications of TalagrandÆs Inequality | |
KimVu | |
Exercises | |
The Probabilistic Lens: Weierstrass Approximation Theorem | |
The Poisson Paradigm. | |
The Janson Inequalities | |
The Proofs | |
BrunÆs Sieve | |
Large Deviations | |
Counting Extensions | |
Counting Representations | |
Further Inequalities | |
Exercises | |
The Probabilistic Lens: Local Coloring | |
Pseudorandomness. | |
The Quadratic Residue Tournaments | |
Eigenvalues and Expanders | |
Quasi Random Graphs | |
Exercises | |
The Probabilistic Lens: Random Walks | |
Topics. | |
Random Graphs | |
Subgraphs | |
Clique Number | |
Chromatic Number | |
ZeroOne Laws | |
Exercises | |
The Probabilistic Lens: Counting Subgraphs | |
The Erd" osRÆenyi Phase Transition | |
An Overview | |
Three Processes | |
The GaltonWatson Branching Process | |
Analysis of the Poisson Branching Process | |
The Graph Branching Model | |
The Graph and Poisson Processes Compared | |
The Parametrization Explained | |
The Subcritical Regions | |
The Supercritical Regimes | |
The Critical Window | |
Analogies to Classical Percolation Theory | |
Exercises | |
The Probabilistic Lens: The Rich Get Richer | |
Circuit Complexity. | |
Preliminaries 318 | |
Random Restrictions and BoundedDepth Circuits | |
More on BoundedDepth Circuits | |
Monotone Circuits | |
Formulae | |
Exercises | |
The Probabilistic Lens: Maximal Antichains | |
Discrepancy. | |
Basics | |
Six Standard Deviations Suffice | |
Linear and Hereditary Discrepancy | |
Lower Bounds | |
The BeckFiala Theorem | |
Exercises | |
The Probabilistic Lens: Unbalancing Lights | |
Geometry. | |
The Greatest Angle among Points in Euclidean Spaces | |
Empty Triangles Determined by Points in the Plane | |
Geometrical Realizations of Sign Matrices | |
QNets and VCDimensions of Range Spaces | |
Dual Shatter Functions and Discrepancy | |
Exercises | |
The Probabilistic Lens: Efficient Packing | |
Codes, Games and Entropy. | |
Codes | |
Liar Game | |
Tenure Game | |
Balancing Vector Game | |
Nonadaptive Algorithms | |
Half Liar Game | |
Entropy | |
Exercises | |
The Probabilistic Lens: An Extremal Graph | |
Derandomization. | |
The Method of Conditional Probabilities | |
dWise Independent Random Variables in Small Sample Spaces | |
Exercises | |
The Probabilistic Lens: Crossing Numbers, Incidences, Sums and Products | |
Graph Property Testing. | |
Property Testing | |
Testing colorability | |
Szemer æediÆs Regularity Lemma | |
Testing trianglefreeness | |
Characterizing the testable graph properties | |
Exercises | |
The Probabilistic Lens: Tur?an Numbers and Dependent Random Choice | |
Appendix A | |
Chernoff Bounds | |
Lower Bounds | |
Exercises | |
The Probabilistic Lens: Trianglefree Graphs Have Large Independence Numbers | |
Appendix B: Paul Erd" os | |
Papers | |
Conjectures | |
On Erd" os | |
Uncle Paul | |
References | |
Subject Index | |
Author Index | |
Table of Contents provided by Publisher. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.