Logo

Reversible Markov Chains and Random Walks on Graphs

Reversible Markov Chains and Random Walks on Graphs
by

Publisher: University of California, Berkeley
Number of pages: 516

Description:
From the table of contents: General Markov Chains; Reversible Markov Chains; Hitting and Convergence Time, and Flow Rate, Parameters for Reversible Markov Chains; Special Graphs and Trees; Cover Times; Symmetric Graphs and Chains; Advanced L2 Techniques for Bounding Mixing Times; Some Graph Theory and Randomized Algorithms; Continuous State, Infinite State and Random Environment; Interacting Particles on Finite Graphs; Markov Chain Monte Carlo.

Home page url

Download or read it online for free here:
Download link
(1.8MB, PDF)

Similar books

Book cover: Design of Comparative ExperimentsDesign of Comparative Experiments
by - Cambridge University Press
This book develops a coherent framework for thinking about factors that affect experiments and their relationships, including the use of Hasse diagrams. The book is ideal for advanced undergraduate and beginning graduate courses.
(26066 views)
Book cover: Markov Chains and Stochastic StabilityMarkov Chains and Stochastic Stability
by - Springer
The book on the theory of general state space Markov chains, and its application to time series analysis, operations research and systems and control theory. An advanced graduate text and a monograph treating the stability of Markov chains.
(24023 views)
Book cover: Lectures on Probability, Statistics and EconometricsLectures on Probability, Statistics and Econometrics
by - statlect.com
This e-book is organized as a website that provides access to a series of lectures on fundamentals of probability, statistics and econometrics, as well as to a number of exercises on the same topics. The level is intermediate.
(17144 views)
Book cover: Convergence of Stochastic ProcessesConvergence of Stochastic Processes
by - Springer
Selected parts of empirical process theory, with applications to mathematical statistics. The book describes the combinatorial ideas needed to prove maximal inequalities for empirical processes indexed by classes of sets or classes of functions.
(18338 views)