diff db38123..d214c92 percolation_nonuniqueness_nonamenable_v2.txt
diff --git a/percolation_nonuniqueness_nonamenable_v2.txt b/percolation_nonuniqueness_nonamenable_v2.txt index 7ddb7df..b2129e9 100644 --- a/percolation_nonuniqueness_nonamenable_v2.txt +++ b/percolation_nonuniqueness_nonamenable_v2.txt @@ -28,22 +28,7 @@ The two main results, in one sentence each: The rest of this file explains what that means and why it is true. - . . . TABLE OF CONTENTS . . . - - 0. Prologue: what is percolation? - 1. The two theorems, stated. - 2. Graphs, thresholds, quasi-transitivity, amenability. - 3. Basic probability tools used everywhere. - 4. The overall strategy in one page. - 5. Good clusters survive deletion. - 6. Local endpoint maps (the amplification engine). - 7. Critical moments of the cluster size. - 8. The triangle trace stays subpower. - 9. Corridors and deformation. - 10. Finding paths with escapes at both ends. - 11. The final contradiction. - 12. Consequences and where to go next. - 13. Glossary and index. + ==================================================================