Percolation on Expanders
This section is devoted to percolation on finite graphs. More precisely we will try to understand percolation on a sequence of finite graphs, whose number of vertices tends to infinity. Detailed proofs of the material appearing in this section and additional extensions can be found at [ABS04].
KeywordsLong Range Boolean Function Monotone Function Random Graph Detailed Proof
- [DS13]J. Ding, A. Sly, Distances in critical long range percolation. arXiv preprint arXiv:1303.3995 (2013)Google Scholar
- [Gri99]G. Grimmett, Percolation. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 321, 2nd edn. (Springer, Berlin, 1999)Google Scholar
- [HLW06]S. Hoory, N. Linial, A. Wigderson, Expander graphs and their applications. Bull. Am. Math. Soc. (N.S.) 43(4), 439–561 (2006) (electronic)Google Scholar