Unimodularity in Randomly Generated Graphs

Häftad, Engelska, 2018

1 929 kr

Beställningsvara. Skickas inom 5-8 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2018-11-30
Mått178 x 254 x undefined mm
Vikt320 g
FormatHäftad
SpråkEngelska
SerieContemporary Mathematics
Antal sidor211
FörlagAmerican Mathematical Society
ISBN9781470439149

Tillhör följande kategorier

Matematisk statistik inom Naturvetenskap och teknik

R. Lyons, Monotonicity of average return probabilities for random walks in random environmentsO. Angel and T. Hutchcroft, Counterexamples for percolation on unimodular random graphsI. Benjamini and O. Gurel-Gurevich, Invariant $\rho$-percolation on regular treesI. Benjamini and G. Elek, Sparse graph limits along ballsI. Benjamini, Percolation and coarse conformal uniformizationA. Timar, Invariant tilings and unimodular decorations of Cayley graphsE. Paquette, Distributional lattices on Riemannian symmetric spacesF. Baccelli, M.-O. Haji-Mirsadeghi, and A. Khezeli, Eternal Family Trees and dynamics on unimodular random graphsV. A. Kaimanovich, Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spidersL. Bowen, All properly ergodic Markov chains over a free group are orbit equivalentA. Khezeli, Shift-coupling of random rooted graphs and networks.