Convergence of Stochastic Processes
by D. Pollard
Publisher: Springer 1984
Number of pages: 223
An exposition od selected parts of empirical process theory, with related interesting facts about weak convergence, and applications to mathematical statistics. The high points of the book describe the combinatorial ideas needed to prove maximal inequalities for empirical processes indexed by classes of sets or classes of functions.
Home page url
Download or read it online for free here:
by Brenda Meery - CK-12.org
CK-12 Foundation's Basic Probability and Statistics– A Short Course is an introduction to theoretical probability and data organization. Students learn about events, conditions, random variables, and graphs and tables that allow them to manage 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 Pavel Bleher, Alexander Its - Cambridge University Press
The book covers broad areas such as topologic and combinatorial aspects of random matrix theory; scaling limits, universalities and phase transitions in matrix models; universalities for random polynomials; and applications to integrable systems.
by David Aldous, James Allen Fill - University of California, Berkeley
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; etc.