LARGE RANDOM GRAPHS The course consists of three parts: 1) The Erdos-Renyi random graph. Introduced in the 50's, this model is still widely investigated. Its discussion will provide the occasion to introduce some terminology and techniques for the study of large random structures. Furthermore it will provide a benchmark for comparison with more complex models. 2) Some models will be discussed depending on the interest of the audience (lattice percolation, preferential attachment, small world...) 3) Lovasz's theory of graph limits. In the last few years Lovasz and coworkers have developed an illuminating theory of graph limits (at least for dense graphs). We will present that theory, also in the more probabilistic formulation due to Diaconis and discuss some explicit example. The course will take 20 hrs and will be taught in English, unless everybody prefers Italian.