000 02263nam a22003618a 4500
001 CR9780511762550
003 UkCbUP
005 20171019111728.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 100506s2010||||enk s ||1 0|eng|d
020 _a9780511762550 (ebook)
020 _z9780521197984 (hardback)
020 _z9780521147354 (paperback)
040 _aUkCbUP
_cUkCbUP
_erda
050 0 0 _aQA166
_b.G75 2010
082 0 0 _a511.5
_222
100 1 _aGrimmett, Geoffrey,
_eauthor.
245 1 0 _aProbability on Graphs :
_bRandom Processes on Graphs and Lattices /
_cGeoffrey Grimmett.
264 1 _aCambridge :
_bCambridge University Press,
_c2010.
300 _a1 online resource (260 pages) :
_bdigital, PDF file(s).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 0 _aInstitute of Mathematical Statistics Textbooks ;
_vno. 1
500 _aTitle from publisher's bibliographic system (viewed on 09 Oct 2015).
520 _aThis introduction to some of the principal models in the theory of disordered systems leads the reader through the basics, to the very edge of contemporary research, with the minimum of technical fuss. Topics covered include random walk, percolation, self-avoiding walk, interacting particle systems, uniform spanning tree, random graphs, as well as the Ising, Potts, and random-cluster models for ferromagnetism, and the Lorentz model for motion in a random medium. Schramm–Löwner evolutions (SLE) arise in various contexts. The choice of topics is strongly motivated by modern applications and focuses on areas that merit further research. Special features include a simple account of Smirnov's proof of Cardy's formula for critical percolation, and a fairly full account of the theory of influence and sharp-thresholds. Accessible to a wide audience of mathematicians and physicists, this book can be used as a graduate course text. Each chapter ends with a range of exercises.
650 0 _aGraph theory
650 0 _aProbabilities
776 0 8 _iPrint version:
_z9780521197984
830 0 _aInstitute of Mathematical Statistics Textbooks ;
_vno. 1.
856 4 0 _uhttp://dx.doi.org/10.1017/CBO9780511762550
999 _c224337
_d224337