Muutke küpsiste eelistusi

Unimodularity in Randomly Generated Graphs [Pehme köide]

  • Formaat: Paperback / softback, 211 pages, kõrgus x laius: 254x178 mm, kaal: 320 g
  • Sari: Contemporary Mathematics
  • Ilmumisaeg: 30-Nov-2018
  • Kirjastus: American Mathematical Society
  • ISBN-10: 147043914X
  • ISBN-13: 9781470439149
Teised raamatud teemal:
  • Formaat: Paperback / softback, 211 pages, kõrgus x laius: 254x178 mm, kaal: 320 g
  • Sari: Contemporary Mathematics
  • Ilmumisaeg: 30-Nov-2018
  • Kirjastus: American Mathematical Society
  • ISBN-10: 147043914X
  • ISBN-13: 9781470439149
Teised raamatud teemal:
This volume contains the proceedings of the AMS Special Session on Unimodularity in Randomly Generated Graphs, held from October 8-9, 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. The ``randomly generated graphs'', which include percolation graphs, random Erdos-Renyi graphs, and graphings of equivalence relations, are much easier to describe if they result as random objects in the context of unimodularity, with respect to either a vertex-transient ``host''-graph or a probability measure.

This volume tries to give an impression of the various fields in which the notion currently finds strong development and application: percolation theory, point processes, ergodic theory, and dynamical systems.
Preface ix
Monotonicity of average return probabilities for random walks in random environments
1(10)
Russell Lyons
Counterexamples for percolation on unimodular random graphs
11(18)
Omer Angel
Tom Hutchcroft
Invariant p-percolation on regular trees
29(4)
Itai Benjamini
Ori Gurel-Gurevich
Sparse graph limits along balls
33(6)
Itai Benjamini
Gabor Elek
Percolation and coarse conformal uniformization
39(4)
Itai Benjamini
Invariant tilings and unimodular decorations of Cayley graphs
43(20)
Adam Timar
Distributional lattices on Riemannian symmetric spaces
63(22)
Elliot Paquette
Eternal Family Trees and dynamics on unimodular random graphs
85(44)
Francois Baccelli
Mir-Omid Haji-Mirsadeghi
Ali Khezeli
Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders
129(26)
Vadim A. Kaimanovich
All properly ergodic Markov chains over a free group are orbit equivalent
155(20)
Lewis Bowen
Shift-coupling of random rooted graphs and networks
175
Ali Khezeli
Florian Sobieczky, Software Competence Center Hagenberg, Hagenberg in Muhlkreis, Austria.