Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
Includes many exercises of varying difficulty levels
Investigates many open problems
Presents topics not covered by any other book
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).
Content Level »Research
Keywords »82B43,82B41,05C81,05C10,05C80 - Coarse geometry - Graphs - Percolation - Random walk - Unimodular random graph and sparse graph limits