Random Walks on Infinite Graphs and Groups
Random Walks on Infinite Graphs and Groups

Author: Wolfgang Woess

Publisher: Cambridge University Press

Published: 2000-02-13

Total Pages: 350

ISBN-13: 0521552923

DOWNLOAD EBOOK

The main theme of this book is the interplay between the behaviour of a class of stochastic processes (random walks) and discrete structure theory. The author considers Markov chains whose state space is equipped with the structure of an infinite, locally finite graph, or as a particular case, of a finitely generated group. The transition probabilities are assumed to be adapted to the underlying structure in some way that must be specified precisely in each case. From the probabilistic viewpoint, the question is what impact the particular type of structure has on various aspects of the behaviour of the random walk. Vice-versa, random walks may also be seen as useful tools for classifying, or at least describing the structure of graphs and groups. Links with spectral theory and discrete potential theory are also discussed. This book will be essential reading for all researchers working in stochastic process and related topics.

Random Walks on Reductive Groups
Random Walks on Reductive Groups

Author: Yves Benoist

Publisher: Springer

Published: 2016-10-20

Total Pages: 319

ISBN-13: 3319477218

DOWNLOAD EBOOK

The classical theory of random walks describes the asymptotic behavior of sums of independent identically distributed random real variables. This book explains the generalization of this theory to products of independent identically distributed random matrices with real coefficients. Under the assumption that the action of the matrices is semisimple – or, equivalently, that the Zariski closure of the group generated by these matrices is reductive - and under suitable moment assumptions, it is shown that the norm of the products of such random matrices satisfies a number of classical probabilistic laws. This book includes necessary background on the theory of reductive algebraic groups, probability theory and operator theory, thereby providing a modern introduction to the topic.

Groups, Graphs and Random Walks
Groups, Graphs and Random Walks

Author: Tullio Ceccherini-Silberstein

Publisher: Cambridge University Press

Published: 2017-06-29

Total Pages: 539

ISBN-13: 1316604403

DOWNLOAD EBOOK

An up-to-date, panoramic account of the theory of random walks on groups and graphs, outlining connections with various mathematical fields.

Topics in Groups and Geometry
Topics in Groups and Geometry

Author: Tullio Ceccherini-Silberstein

Publisher: Springer Nature

Published: 2022-01-01

Total Pages: 468

ISBN-13: 3030881091

DOWNLOAD EBOOK

This book provides a detailed exposition of a wide range of topics in geometric group theory, inspired by Gromov’s pivotal work in the 1980s. It includes classical theorems on nilpotent groups and solvable groups, a fundamental study of the growth of groups, a detailed look at asymptotic cones, and a discussion of related subjects including filters and ultrafilters, dimension theory, hyperbolic geometry, amenability, the Burnside problem, and random walks on groups. The results are unified under the common theme of Gromov’s theorem, namely that finitely generated groups of polynomial growth are virtually nilpotent. This beautiful result gave birth to a fascinating new area of research which is still active today. The purpose of the book is to collect these naturally related results together in one place, most of which are scattered throughout the literature, some of them appearing here in book form for the first time. In this way, the connections between these topics are revealed, providing a pleasant introduction to geometric group theory based on ideas surrounding Gromov's theorem. The book will be of interest to mature undergraduate and graduate students in mathematics who are familiar with basic group theory and topology, and who wish to learn more about geometric, analytic, and probabilistic aspects of infinite groups.

Probability on Graphs
Probability on Graphs

Author: Geoffrey Grimmett

Publisher: Cambridge University Press

Published: 2018-01-25

Total Pages: 279

ISBN-13: 1108542999

DOWNLOAD EBOOK

This introduction to some of the principal models in the theory of disordered systems leads the reader through the basics, to the very edge of contemporary research, with the minimum of technical fuss. Topics covered include random walk, percolation, self-avoiding walk, interacting particle systems, uniform spanning tree, random graphs, as well as the Ising, Potts, and random-cluster models for ferromagnetism, and the Lorentz model for motion in a random medium. This new edition features accounts of major recent progress, including the exact value of the connective constant of the hexagonal lattice, and the critical point of the random-cluster model on the square lattice. The choice of topics is strongly motivated by modern applications, and focuses on areas that merit further research. Accessible to a wide audience of mathematicians and physicists, this book can be used as a graduate course text. Each chapter ends with a range of exercises.

Probability on Trees and Networks
Probability on Trees and Networks

Author: Russell Lyons

Publisher: Cambridge University Press

Published: 2017-01-20

Total Pages: 1023

ISBN-13: 1316785335

DOWNLOAD EBOOK

Starting around the late 1950s, several research communities began relating the geometry of graphs to stochastic processes on these graphs. This book, twenty years in the making, ties together research in the field, encompassing work on percolation, isoperimetric inequalities, eigenvalues, transition probabilities, and random walks. Written by two leading researchers, the text emphasizes intuition, while giving complete proofs and more than 850 exercises. Many recent developments, in which the authors have played a leading role, are discussed, including percolation on trees and Cayley graphs, uniform spanning forests, the mass-transport technique, and connections on random walks on graphs to embedding in Hilbert space. This state-of-the-art account of probability on networks will be indispensable for graduate students and researchers alike.

Random Walks and Electric Networks
Random Walks and Electric Networks

Author: Peter G. Doyle

Publisher: American Mathematical Soc.

Published: 1984-12-31

Total Pages: 174

ISBN-13: 1614440220

DOWNLOAD EBOOK

Probability theory, like much of mathematics, is indebted to physics as a source of problems and intuition for solving these problems. Unfortunately, the level of abstraction of current mathematics often makes it difficult for anyone but an expert to appreciate this fact. Random Walks and electric networks looks at the interplay of physics and mathematics in terms of an example—the relation between elementary electric network theory and random walks —where the mathematics involved is at the college level.

Random Graph Dynamics
Random Graph Dynamics

Author: Rick Durrett

Publisher: Cambridge University Press

Published: 2010-05-31

Total Pages: 203

ISBN-13: 1139460889

DOWNLOAD EBOOK

The theory of random graphs began in the late 1950s in several papers by Erdos and Renyi. In the late twentieth century, the notion of six degrees of separation, meaning that any two people on the planet can be connected by a short chain of people who know each other, inspired Strogatz and Watts to define the small world random graph in which each site is connected to k close neighbors, but also has long-range connections. At a similar time, it was observed in human social and sexual networks and on the Internet that the number of neighbors of an individual or computer has a power law distribution. This inspired Barabasi and Albert to define the preferential attachment model, which has these properties. These two papers have led to an explosion of research. The purpose of this book is to use a wide variety of mathematical argument to obtain insights into the properties of these graphs. A unique feature is the interest in the dynamics of process taking place on the graph in addition to their geometric properties, such as connectedness and diameter.

Handbook of Dynamical Systems
Handbook of Dynamical Systems

Author: B. Fiedler

Publisher: Gulf Professional Publishing

Published: 2002-02-21

Total Pages: 1099

ISBN-13: 0080532845

DOWNLOAD EBOOK

This handbook is volume II in a series collecting mathematical state-of-the-art surveys in the field of dynamical systems. Much of this field has developed from interactions with other areas of science, and this volume shows how concepts of dynamical systems further the understanding of mathematical issues that arise in applications. Although modeling issues are addressed, the central theme is the mathematically rigorous investigation of the resulting differential equations and their dynamic behavior. However, the authors and editors have made an effort to ensure readability on a non-technical level for mathematicians from other fields and for other scientists and engineers. The eighteen surveys collected here do not aspire to encyclopedic completeness, but present selected paradigms. The surveys are grouped into those emphasizing finite-dimensional methods, numerics, topological methods, and partial differential equations. Application areas include the dynamics of neural networks, fluid flows, nonlinear optics, and many others.While the survey articles can be read independently, they deeply share recurrent themes from dynamical systems. Attractors, bifurcations, center manifolds, dimension reduction, ergodicity, homoclinicity, hyperbolicity, invariant and inertial manifolds, normal forms, recurrence, shift dynamics, stability, to namejust a few, are ubiquitous dynamical concepts throughout the articles.

Introduction to Random Graphs
Introduction to Random Graphs

Author: Alan Frieze

Publisher: Cambridge University Press

Published: 2016

Total Pages: 483

ISBN-13: 1107118506

DOWNLOAD EBOOK

The text covers random graphs from the basic to the advanced, including numerous exercises and recommendations for further reading.