Ceccherini-Silberstein / Salvatori / Sava-Huss | Groups, Graphs and Random Walks | Buch | 978-1-316-60440-3 | www2.sack.de

Buch, Englisch, Band 436, 536 Seiten, Format (B × H): 152 mm x 229 mm, Gewicht: 864 g

Reihe: London Mathematical Society Lecture Note Series

Ceccherini-Silberstein / Salvatori / Sava-Huss

Groups, Graphs and Random Walks


Erscheinungsjahr 2019
ISBN: 978-1-316-60440-3
Verlag: Cambridge University Press

Buch, Englisch, Band 436, 536 Seiten, Format (B × H): 152 mm x 229 mm, Gewicht: 864 g

Reihe: London Mathematical Society Lecture Note Series

ISBN: 978-1-316-60440-3
Verlag: Cambridge University Press


An accessible and panoramic account of the theory of random walks on groups and graphs, stressing the strong connections of the theory with other branches of mathematics, including geometric and combinatorial group theory, potential analysis, and theoretical computer science. This volume brings together original surveys and research-expository papers from renowned and leading experts, many of whom spoke at the workshop 'Groups, Graphs and Random Walks' celebrating the sixtieth birthday of Wolfgang Woess in Cortona, Italy. Topics include: growth and amenability of groups; Schrödinger operators and symbolic dynamics; ergodic theorems; Thompson's group F; Poisson boundaries; probability theory on buildings and groups of Lie type; structure trees for edge cuts in networks; and mathematical crystallography. In what is currently a fast-growing area of mathematics, this book provides an up-to-date and valuable reference for both researchers and graduate students, from which future research activities will undoubtedly stem.

Ceccherini-Silberstein / Salvatori / Sava-Huss Groups, Graphs and Random Walks jetzt bestellen!

Weitere Infos & Material


1. Growth of groups and wreath products Laurent Bartholdi; 2. Random walks on some countable groups Alexander Bendikov and Laurent Saloff-Coste; 3. The cost of distinguishing graphs Debra Boutin and Wilfried Imrich; 4. A construction of the measurable Poisson boundary – from discrete to continuous groups Sara Brofferio; 5. Structure trees, networks and almost invariant sets Martin J. Dunwoody; 6. Amenability of trees Behrang Forghani and Keivan Mallahi-Karai; 7. Group-walk random groups Agelos Georgakopoulos; 8. Ends of branching random walks on planar hyperbolic Cayley graphs Lorenz A. Gilch and Sebastian Müller; 9. Amenability and ergodic properties of topological groups – from Bogolyubov onwards Rostislav Grigorchuk and Pierre de la Harpe; 10. Schreier graphs of Grigorchuk's group and a subshift associated to a non-primitive substitution Rostislav Grigorchuk, Daniel Lenz and Tatiana Nagnibeda; 11. Thompson's group F is not Liouville Vadim A. Kaimanovich; 12. A proof of the subadditive ergodic theorem Anders Karlsson; 13. Boundaries of Zn-free groups Andrei Malyutin, Tatiana Nagnibeda and Denis Serbin; 14. Buildings, groups of Lie type, and random walks James Parkinson; 15. On some random walks driven by spread-out measures Laurent Saloff-Coste and Tianyi Zheng; 16. Topics in mathematical crystallography Toshikazu Sunada.


Sava-Huss, Ecaterina
Ecaterina Sava-Huss is a visiting assistant professor in the Department of Mathematics at Cornell University, New York.

Salvatori, Maura
Maura Salvatori is an associate professor in the Department of Mathematics at Università degli Studi di Milano, Italy.

Ceccherini-Silberstein, Tullio
Tullio Ceccherini-Silberstein is a professor in the Department of Engineering at Università del Sannio (Benevento), Italy.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.