Random Graphs and Complex Networks
by Remco van der Hofstad
Publisher: Eindhoven University of Technology 2010
Number of pages: 363
These lecture notes are intended to be used for master courses, where the students have a limited prior knowledge of special topics in probability. Therefore, we have included many of the preliminaries, such as convergence of random variables, probabilistic bounds, coupling, martingales and branching processes. These notes are aimed to be self-contained, and to give the readers an insight in the history of the field of random graphs.
Home page url
Download or read it online for free here:
by C. M. Grinstead, J. L. Snell - American Mathematical Society
The textbook for an introductory course in probability for students of mathematics, physics, engineering, social sciences, and computer science. It presents a thorough treatment of techniques necessary for a good understanding of the subject.
by Russell Lyons, Yuval Peres - Cambridge University Press
This book is concerned with certain aspects of discrete probability on infinite graphs that are currently in vigorous development. Of course, finite graphs are analyzed as well, but usually with the aim of understanding infinite graphs and networks.
by Robert M. Gray - Springer
A self-contained treatment of the theory of probability, random processes. It is intended to lay theoretical foundations for measure and integration theory, and to develop the long term time average behavior of measurements made on random processes.
by A. A. Cournot - arXiv.org
I aim to make accessible the rules of the calculus of probability to those, unacquainted with the higher chapters of mathematics. The reading of my book will not require any other knowledge except elementary algebra, or even algebraic notation.