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 G. Jay Kerns
A textbook for an undergraduate course in probability and statistics. The prerequisites are two or three semesters of calculus and some linear algebra. Students attending the class include mathematics, engineering, and computer science majors.
by Albert Tarantola - SIAM
The first part deals with discrete inverse problems with a finite number of parameters, while the second part deals with general inverse problems. The book for scientists and applied mathematicians facing the interpretation of experimental data.
by Alexander K. Hartmann - arXiv
This is a practical introduction to randomness and data analysis, in particular in the context of computer simulations. At the beginning, the most basics concepts of probability are given, in particular discrete and continuous random variables.
by Cosma Rohilla Shalizi - Cambridge University Press
This is a draft textbook on data analysis methods, intended for a one-semester course for advance undergraduate students who have already taken classes in probability, mathematical statistics, and linear regression. It began as the lecture notes.