Progress in High-Dimensional Percolation and Random Graphs, Softcover reprint of the original 1st ed. 2017 CRM Short Courses Series

This text presents an engaging exposition of the active field of high-dimensional percolation that will likely provide an impetus for future work. With over 90 exercises designed to enhance the reader?s understanding of the material, as well as many open problems, the book is aimed at graduate students and researchers who wish to enter the world of this rich topic.  The text may also be useful in advanced courses and seminars, as well as for reference and individual study.

Part I, consisting of 3 chapters, presents a general introduction to percolation, stating the main results, defining the central objects, and proving its main properties. No prior knowledge of percolation is assumed. Part II, consisting of Chapters 4?9, discusses mean-field critical behavior by describing the two main techniques used, namely, differential inequalities and the lace expansion. In Parts I and II, all results are proved, making this the first self-contained text discussing high-dime

Preface.- 1. Introduction and motivation.- 2. Fixing ideas: Percolation on a tree and branching random walk.- 3. Uniqueness of the phase transition.- 4. Critical exponents and the triangle condition.- 5. Proof of triangle condition.- 6. The derivation of the lace expansion via inclusion-exclusion.- 7. Diagrammatic estimates for the lace expansion.- 8. Bootstrap analysis of the lace expansion.- 9. Proof that δ = 2 and β = 1 under the triangle condition.- 10. The non-backtracking lace expansion.- 11. Further critical exponents.- 12. Kesten's incipient infinite cluster.- 13. Finite-size scaling and random graphs.- 14. Random walks on percolation clusters.- 15. Related results.- 16. Further open problems.- Bibliography.

Markus Heydenreich is a professor of Applied Mathematics at Ludwig-Maximilians-Universität München. Professor Heydenreich works in Probability theory, he investigates random spatial structures.

Remco van der Hofstad is a professor in Mathematics at Eindhoven University of Technology and scientific director of Eurandom. He received the Prix Henri Poincaré 2003 jointly with Gordon Slade and the Rollo Davidson Prize in 2007. He works on high-dimensional statistical physics,  random graphs as models for complex networks, and applications of probability to related fields such as electrical engineering, computer science and chemistry.