Unimodularity in Randomly Generated Graphs

Florian Sobieczky

Nov 2018 · American Mathematical Soc.

Kitabu pepe

211

Kurasa

Ukadiriaji na maoni hayajahakikishwa Pata Maelezo Zaidi

Kuhusu kitabu pepe hiki

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 Erdős–Rényi 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.

Kuhusu mwandishi

Edited by Florian Sobieczky: Software Competence Center Hagenberg, Hagenberg in Mühlkreis, Austria

Kadiria kitabu pepe hiki

Tupe maoni yako.

Kusoma maelezo

Simu mahiri na kompyuta vibao

Sakinisha programu ya Vitabu vya Google Play kwa ajili ya Android na iPad au iPhone. Itasawazishwa kiotomatiki kwenye akaunti yako na kukuruhusu usome vitabu mtandaoni au nje ya mtandao popote ulipo.

Kompyuta za kupakata na kompyuta

Unaweza kusikiliza vitabu vilivyonunuliwa kwenye Google Play wakati unatumia kivinjari cha kompyuta yako.

Visomaji pepe na vifaa vingine

Ili usome kwenye vifaa vya wino pepe kama vile visomaji vya vitabu pepe vya Kobo, utahitaji kupakua faili kisha ulihamishie kwenye kifaa chako. Fuatilia maagizo ya kina ya Kituo cha Usaidizi ili uhamishe faili kwenye visomaji vya vitabu pepe vinavyotumika.

Ripoti maudhui yanayokiuka sera