Networks surround us, from social networks to protein – protein interaction networks within the cells of our bodies. The theory of random graphs provides a necessary framework for understanding their structure and development. This text provides an accessible introduction to this rapidly expanding subject. It covers all the basic features of random graphs – component structure, matchings and Hamilton cycles, connectivity and chromatic number – before discussing models of real-world networks, including intersection graphs, preferential attachment graphs and small-world models. Based on the authors' own teaching experience, it can be used as a textbook for a one-semester course on random graphs and networks at advanced undergraduate or graduate level. The text includes numerous exercises, with a particular focus on developing students' skills in asymptotic analysis. More challenging problems are accompanied by hints or suggestions for further reading.

� propos des auteurs

Alan Frieze is Professor in the Department of Mathematical Sciences at Carnegie Mellon University. He has authored almost 400 publications in top journals and was a plenary speaker at the 2014 International Congress of Mathematicians.

Michał Karoński is Professor Emeritus in the Faculty of Mathematics and Computer Science at Adam Mickiewicz University, where he founded the Discrete Mathematics group. He served as Editor-in-Chief of 'Random Structures and Algorithms' for thirty years.

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.