Reversible Markov Chains and Random Walks on Graphs
by David Aldous, James Allen Fill
Publisher: University of California, Berkeley 2014
Number of pages: 516
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:
by Cosma Rohilla Shalizi
Contents: Probability (Probability Calculus, Random Variables, Discrete and Continuous Distributions); Statistics (Handling of Data, Sampling, Estimation, Hypothesis Testing); Stochastic Processes (Markov Processes, Continuous-Time Processes).
by Noel Corngold - Caltech
The book introduces students to the ideas and attitudes that underlie the statistical modeling of physical, chemical, biological systems. The text contains material the author have tried to convey to an audience composed mostly of graduate students.
by Klaus Bichteler - University of Texas
Written for graduate students of mathematics, physics, electrical engineering, and finance. The students are expected to know the basics of point set topology up to Tychonoff's theorem, general integration theory, and some functional analysis.
by D. A. Levin, Y. Peres, E. L. Wilmer - American Mathematical Society
An introduction to the modern approach to the theory of Markov chains. The main goal of this approach is to determine the rate of convergence of a Markov chain to the stationary distribution as a function of the size and geometry of the state space.