Description

Book Synopsis
Contains the proceedings of the AMS Special Session on Unimodularity in Randomly Generated Graphs, held in 2016, in Denver, Colorado. Unimodularity, a term initially used in locally compact topological groups, is one of the main examples in which the generalization from groups to graphs is successful.

Table of Contents
  • R. Lyons, Monotonicity of average return probabilities for random walks in random environments
  • O. Angel and T. Hutchcroft, Counterexamples for percolation on unimodular random graphs
  • I. Benjamini and O. Gurel-Gurevich, Invariant $\rho$-percolation on regular trees
  • I. Benjamini and G. Elek, Sparse graph limits along balls
  • I. Benjamini, Percolation and coarse conformal uniformization
  • A. Timar, Invariant tilings and unimodular decorations of Cayley graphs
  • E. Paquette, Distributional lattices on Riemannian symmetric spaces
  • F. Baccelli, M.-O. Haji-Mirsadeghi, and A. Khezeli, Eternal Family Trees and dynamics on unimodular random graphs
  • V. A. Kaimanovich, Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders
  • L. Bowen, All properly ergodic Markov chains over a free group are orbit equivalent
  • A. Khezeli, Shift-coupling of random rooted graphs and networks.

    Unimodularity in Randomly Generated Graphs

      Product form

      £102.60

      Includes FREE delivery

      RRP £114.00 – you save £11.40 (10%)

      Order before 4pm tomorrow for delivery by Sat 20 Jun 2026.

      A Paperback by Florian Sobieczky

      1 in stock


        View other formats and editions of Unimodularity in Randomly Generated Graphs by Florian Sobieczky

        Publisher: MP-AMM American Mathematical
        Publication Date: 11/30/2018 12:00:00 AM
        ISBN13: 9781470439149, 978-1470439149
        ISBN10: 147043914X

        Description

        Book Synopsis
        Contains the proceedings of the AMS Special Session on Unimodularity in Randomly Generated Graphs, held in 2016, in Denver, Colorado. Unimodularity, a term initially used in locally compact topological groups, is one of the main examples in which the generalization from groups to graphs is successful.

        Table of Contents
        • R. Lyons, Monotonicity of average return probabilities for random walks in random environments
        • O. Angel and T. Hutchcroft, Counterexamples for percolation on unimodular random graphs
        • I. Benjamini and O. Gurel-Gurevich, Invariant $\rho$-percolation on regular trees
        • I. Benjamini and G. Elek, Sparse graph limits along balls
        • I. Benjamini, Percolation and coarse conformal uniformization
        • A. Timar, Invariant tilings and unimodular decorations of Cayley graphs
        • E. Paquette, Distributional lattices on Riemannian symmetric spaces
        • F. Baccelli, M.-O. Haji-Mirsadeghi, and A. Khezeli, Eternal Family Trees and dynamics on unimodular random graphs
        • V. A. Kaimanovich, Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders
        • L. Bowen, All properly ergodic Markov chains over a free group are orbit equivalent
        • A. Khezeli, Shift-coupling of random rooted graphs and networks.

          Recently viewed products

          © 2026 Book Curl

            • American Express
            • Apple Pay
            • Diners Club
            • Discover
            • Google Pay
            • Maestro
            • Mastercard
            • PayPal
            • Shop Pay
            • Union Pay
            • Visa

            Login

            Forgot your password?

            Don't have an account yet?
            Create account