It has been three decades since B. Bollobás’s monograph [Random graphs. London-Orlando etc.: Academic Press (1985; Zbl 0567.05042)] in the realm of random graphs appeared, and this new accessible, comprehensive work should take us through the next couple of decades. This book is written in an easy to understand format and should appeal to anyone with an interest in combinatorics, applied probability, or theoretical computer science. It offers readers an intuitive understanding of random graph theory, followed by a formal examination of fundamental underpinnings of classical random graphs and their variants and beyond as well as a methodological cookbook on the main tools used in the study of random graphs. This book is naturally divided into four parts, each comes with carefully chosen exercises and informative background notes. Part One is devoted to the theory of Erdős-Rényi random graphs describing extensive characteristics of the model. Part Two tackles models naturally extending the classical random graphs, and various more recent complex networks related models are investigated in depth in Part Three. Part Four reviews important tools and methods that are widely used nowadays in the study of random graph theory, including moment methods, concentration inequality, differential equations, branching process, etc.