CSE 713: Seminar on Random Graphs

History/Overview/Survey Articles

N. Alon, Problems and results in extremal combinatorics, I, Discrete Math., in press.
N. Alon, Algebraic and probabilistic methods in Discrete Mathematics, in: "Visions in Mathematics, Towards 2000", (N. Alon et. al. eds.), Birkhäuser, 2000, pp. 455-470.
N. Alon, Spectral techniques in graph algorithms, Lecture Notes in Computer Science 1380 (C. L. Lucchesi and A. V. Moura, Eds.), Sringer, Berlin, 1998, 206-215.
N. Alon, Randomness and pseudo-randomness in Discrete Mathematics, Proc. of the 2 European Congress of Mathematics, Progress in Mathematics 168 (1998), 1-14.
Noam Nisan and Amnon Ta-Shma. Extracting Randomness: A Survey and New Constructions. JCSS 1999
Amnon Ta-Shma's Dissertation, Refining Randomness Hebrew University 1996
Peter G. Doyle and J. Laurie Snell Random Walks and Electric Networks. A probably more up-to-date version is here

Representative books on Random Graphs, Probability Theory and applications

Bella Bolobas, Random Graphs (2nd ed.), Cambridge University Press, Studies in Advanced Mathematics, #73, September 2001.
Alon, Noga; Spencer, Joel H. The probabilistic method. Second edition. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, New York, 2000. xviii+301 pp. ISBN: 0-471-37046-0
Molloy, Michael; Reed, Bruce Graph colouring and the probabilistic method. Algorithms and Combinatorics, 23. Springer-Verlag, Berlin, 2002. xiv+326 pp. ISBN: 3-540-42139-4
Kallenberg, O. Foundations of Modern Probability. New York: Springer-Verlag, 1997.
Kemeny, J. G. and Snell, J. L. Finite Markov Chains. New York: Springer-Verlag, 1976.
Gamerman, D. Markov Chain Monte Carlo: Stochastic Simulation for Bayesian Inference. Boca Raton, FL: CRC Press, 1997.
W. R. Gilks, D. J. Spiegelhalter, Sylvia Richardson, Markov Chain Monte Carlo in Practice, CRC Press, Feb 1996.
Rajeev Motwani, Prabhakar Raghavan, Randomized Algorithms, Cambridge University Press, June 1995.

Some free books