Coarse Geometry and Randomness [electronic resource] :École d’Été de Probabilités de Saint-Flour XLI – 2011 /Material type: BookSeries: Lecture Notes in Mathematics: 2100Publisher: Cham : Springer International Publishing : 2013.Description: VII, 129 p. 6 illus., 3 illus. in color. online resource.ISBN: 9783319025766.Subject(s): Mathematics | Geometry | Mathematical physics | Materials | Mathematics | Geometry | Graph Theory | Mathematical Methods in Physics | Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences | Continuum Mechanics and Mechanics of MaterialsDDC classification: 516 Online resources: Click here to access online
|Item type||Current location||Call number||Status||Date due||Barcode|
Central Library, IISER Bhopal
OPAC URL: http://webopac.iiserb.ac.in/
|516 (Browse shelf)||Not for loan|
Isoperimetry and expansions in graphs -- Several metric notions -- The hyperbolic plane and hyperbolic graphs -- More on the structure of vertex transitive graphs -- Percolation on graphs -- Local limits of graphs -- Random planar geometry -- Growth and isoperimetric profile of planar graphs -- Critical percolation on non-amenable groups -- Uniqueness of the infinite percolation cluster -- Percolation perturbations -- Percolation on expanders -- Harmonic functions on graphs -- Nonamenable Liouville graphs.
These lecture notes study the interplay between randomness and geometry of graphs. The first part of the notes reviews several basic geometric concepts, before moving on to examine the manifestation of the underlying geometry in the behavior of random processes, mostly percolation and random walk. The study of the geometry of infinite vertex transitive graphs, and of Cayley graphs in particular, is fairly well developed. One goal of these notes is to point to some random metric spaces modeled by graphs that turn out to be somewhat exotic, that is, they admit a combination of properties not encountered in the vertex transitive world. These include percolation clusters on vertex transitive graphs, critical clusters, local and scaling limits of graphs, long range percolation, CCCP graphs obtained by contracting percolation clusters on graphs, and stationary random graphs, including the uniform infinite planar triangulation (UIPT) and the stochastic hyperbolic planar quadrangulation (SHIQ).