Nine lectures on random graphs
These lectures cover some of the same ground as the author's two previous books ``Ten lectures on the probabilistic method (1987; Zbl 0703.05046) and ``The probabilistic method (1992; Zbl 0767.05001). The focus is on tools and tricks for analysis. The exposition is terse but clear and chock-full of insight. The examples used to illustrate the main ideas come from random graphs with two exceptions. One lecture is devoted to applications of these ideas to number theory and is accurately referred to as an interlude. The last lecture, devoted to the Lovász local lemma, also avoids random graphs. For the entire collection see [Zbl 0778.00027].
- Limiting behavior of 3-color excitable media on arbitrary graphs
- scientific article; zbMATH DE number 4152425 (Why is no real title available?)
- scientific article; zbMATH DE number 3950534 (Why is no real title available?)
- scientific article; zbMATH DE number 1028237 (Why is no real title available?)
- Randomly colouring graphs (a combinatorial view)
- Lectures on random geometric graphs
- Threshold for monotone symmetric properties through a logarithmic Sobolev inequality
This page was built for publication: Nine lectures on random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142398)