# MA3H2 Content

Content:

Let us briefly explain the mathematical setting. Percolation is a simple probabilistic model which exhibits a phase transition. The simplest version of percolation takes place on $\mathbb{Z} ^2$ , which we view as a graph with edges between neighbouring vertices. All edges of $\mathbb{Z}^2$ are, independently of each other, chosen to be open with probability $p$ and closed with probability $1-p$ . A basic question in this model is What is the probability that there exists an open path from the origin to the exterior of the square $S_n=[-n,n]^2$?' A limit as $n\to\infty$of the question raised above is What is the probability that there exists an open path from $0$to infinity?' This probability is called the percolation probability and is denoted by $\theta(p)$ . Clearly $\theta(0)=0$ and $\theta(1)=1$, since there are no open edges at all when $p=0$ and all edges are open when $p=1$ . For some models there is a $0<p_{c}<1$ such that the global behaviour of the system is quite different for $p<p_{c}$ and for $p>p_{c}$. Such a sharp transition in global behaviour of a system at some parameter value is called a phase transition or a critical phenomenon, and the parameter value at which the transition takes place is called a critical value.

Books:

We will not follow a particular book.

H.O. Georgii: Stochastics: introduction to probability theory and statistics, de Gruyter (2008). [basic introduction to stochastics and Markov chains (discrete time)]

J. Norris: Markov chains, Cambridge University Press [standard reference treating the topic with mathematical rigor and clarity, and emphasizing numerous applications to a wide range of subjects]

G. Grimmett, D. Stirzaker: Probability and Random Processes, OUP Oxford (2001) [chapter 6 on Markov chains]

G. Grimmett: Probability on Graphs, Cambridge University Press (2010). [Available Online, contains a nice introduction to processes on graphs and percolation]

B. Bollabás, O. Riordan: Percolation, Cambridge University Press (2006). [a modern treatment of percolation. The introduction and the chapter on basic techniques are relevant for the lecture]

G. Grimmett: Percolation, 2nd ed., Springer (1999). [the standard reference on percolation. It contains much more than covered in the lecture. The first two chapters are relevant for the lecture]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8967617,"math_prob":0.9912114,"size":2191,"snap":"2021-43-2021-49","text_gpt3_token_len":472,"char_repetition_ratio":0.11934157,"word_repetition_ratio":0.052173913,"special_character_ratio":0.20675491,"punctuation_ratio":0.13316584,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99951375,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-11-29T23:12:05Z\",\"WARC-Record-ID\":\"<urn:uuid:6e553afe-1149-43ce-b9cf-4ab7d02f6e1c>\",\"Content-Length\":\"33894\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:089fc346-b7c7-4d6a-9de8-c27bdd93eba5>\",\"WARC-Concurrent-To\":\"<urn:uuid:d41263cd-ec75-4c9e-bbcd-c86947f6f67d>\",\"WARC-IP-Address\":\"137.205.28.41\",\"WARC-Target-URI\":\"https://warwick.ac.uk/fac/sci/maths/currentstudents/ughandbook/content/ma3h2/\",\"WARC-Payload-Digest\":\"sha1:72YYDDHTCGL7OZUY62WW5VTEQQFGVU6R\",\"WARC-Block-Digest\":\"sha1:VS4HDKWN23A7HI3ROF3IOFNLPXLV4FQY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964358847.80_warc_CC-MAIN-20211129225145-20211130015145-00089.warc.gz\"}"}