Sold Out
Book Categories |
Preface | v | |
1 | Preliminaries | 1 |
1.1 | Models of random graphs | 1 |
1.2 | Notes on notation and more | 6 |
1.3 | Monotonicity | 12 |
1.4 | Asymptotic equivalence | 14 |
1.5 | Thresholds | 18 |
1.6 | Sharp thresholds | 20 |
2 | Exponentially Small Probabilities | 25 |
2.1 | Independent summands | 26 |
2.2 | Binomial random subsets | 30 |
2.3 | Suen's inequality | 34 |
2.4 | Martingales | 37 |
2.5 | Talagrand's inequality | 39 |
2.6 | The upper tail | 48 |
3 | Small Subgraphs | 53 |
3.1 | The containment problem | 53 |
3.2 | Leading overlaps and the subgraph plot | 62 |
3.3 | Subgraph count at the threshold | 66 |
3.4 | The covering problem | 68 |
3.5 | Disjoint copies | 75 |
3.6 | Variations on the theme | 77 |
4 | Matchings | 81 |
4.1 | Perfect matchings | 82 |
4.2 | G-factors | 89 |
4.3 | Two open problems | 96 |
5 | The Phase Transition | 103 |
5.1 | The evolution of the random graph | 103 |
5.2 | The emergence of the giant component | 107 |
5.3 | The emergence of the giant: A closer look | 112 |
5.4 | The structure of the giant component | 121 |
5.5 | Near the critical period | 126 |
5.6 | Global properties and the symmetry rule | 128 |
5.7 | Dynamic properties | 134 |
6 | Asymptotic Distributions | 139 |
6.1 | The method of moments | 140 |
6.2 | Stein's method: The Poisson case | 152 |
6.3 | Stein's method: The normal case | 157 |
6.4 | Projections and decompositions | 162 |
6.5 | Further methods | 176 |
7 | The Chromatic Number | 179 |
7.1 | The stability number | 179 |
7.2 | The chromatic number: A greedy approach | 184 |
7.3 | The concentration of the chromatic number | 187 |
7.4 | The chromatic number of dense random graphs | 190 |
7.5 | The chromatic number of sparse random graphs | 192 |
7.6 | Vertex partition properties | 196 |
8 | Extremal and Ramsey Properties | 201 |
8.1 | Heuristics and results | 202 |
8.2 | Triangles: The first approach | 209 |
8.3 | The Szemeredi Regularity Lemma | 212 |
8.4 | A partition theorem for random graphs | 216 |
8.5 | Triangles: An approach with perspective | 222 |
9 | Random Regular Graphs | 233 |
9.1 | The configuration model | 235 |
9.2 | Small cycles | 236 |
9.3 | Hamilton cycles | 239 |
9.4 | Proofs | 247 |
9.5 | Contiguity of random regular graphs | 256 |
9.6 | A brief course in contiguity | 264 |
10 | Zero-One Laws | 271 |
10.1 | Preliminaries | 271 |
10.2 | Ehrenfeucht games and zero-one laws | 273 |
10.3 | Filling gaps | 285 |
10.4 | Sums of models | 292 |
10.5 | Separability and the speed of convergence | 301 |
References | 307 | |
Index of Notation | 327 | |
Index | 331 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionRandom Graphs
X
This Item is in Your InventoryRandom Graphs
X
You must be logged in to review the productsX
X
X
Add Random Graphs, A unified, modern treatment of the theory of random graphs-including recent results and techniques Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively a, Random Graphs to the inventory that you are selling on WonderClubX
X
Add Random Graphs, A unified, modern treatment of the theory of random graphs-including recent results and techniques Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively a, Random Graphs to your collection on WonderClub |