Reversible Markov Chains Random Walks On Graphs
โ Scribed by Aldous D., Fill J.A.
- Year
- 1995
- Tongue
- English
- Leaves
- 450
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Markov chains are among the basic and most important examples of random processes. This book is about time-homogeneous Markov chains that evolve with discrete time steps on a countable state space. A specific feature is the systematic use, on a relatively elementary level, of generating functions as
Markov chains are among the basic and most important examples of random processes. This book is about time-homogeneous Markov chains that evolve with discrete time steps on a countable state space. A specific feature is the systematic use, on a relatively elementary level, of generating functions as
This eminent work focuses on the interplay between the behavior of random walks and discrete structure theory. Wolfgang Woess considers Markov chains whose state space is equipped with the structure of an infinite, locally-finite graph, or of a finitely generated group. He assumes the transition pro