Presenting ten expository surveys on the rapidly expanding area of probabilistic graph theory, this book is the sixth, and final, volume of Cambridge University Press's series on 'Topics in Graph Theory'. Comprising contributions by leading experts, with all refined for clarity and consistent terminology, this book provides a uniquely comprehensive treatment of the subject. The reader is presented with an extensive introductory chapter to provide background material, before being brought up to speed with several of the most exciting recent developments in the field. This book will be useful for graduate students and researchers in graph theory, combinatorics, and probability theory, and of interest to mathematicians in related fields wishing to learn the topic as quickly as possible.
Inhaltsverzeichnis
Foreword by Colin McDiarmid; Preface; Preliminaries Lowell W. Beineke, Colin McDiarmid and Robin J. Wilson; 1. Thresholds Jeff Kahn and Jinyoung Park; 2. Matchings and Hamiltonian cycles in random graphs Alan Frieze; 3. Modularity and random graphs Colin McDiarmid and Fiona Skerman; 4. Random graphs with given degree sequence Guillem Perarnau; 5. Random planar graphs and beyond Marc Noy; 6. Random graphs from a structured class Colin McDiarmid; 7. Nibble methods in graph theory Tom Kelly; 8. The hard-core model in graph theory Ewan Davies and Ross J. Kang; 9. Scaling limits of random graphs Louigi Addario-Berry and Christina Goldschmidt; 10. Graph-and-symbol communication T. Arthur Terlep and Mark R. Bell; Notes on contributors; Index.