Random Graphs and Complex Networks: Volume 2

This book discusses the local structure of random graph models for real-world networks and the theory and implications of local convergence, a crucial technique in the analysis of sparse random graphs. It uses examples of real-world networks as motivation and includes exercises to develop intuition.

Format: Hardback
Length: 506 pages
Publication date: 08 February 2024
Publisher: Cambridge University Press

Complex networks play a pivotal role in capturing the intricate interconnectedness of the society we inhabit. This comprehensive two-volume book, the second installment in a series, delves into the local structure of random graph models, specifically tailored for real-world networks. It sheds light on determining the presence of giant components within these models and distinguishes between small-, medium-, and ultra-small worlds. Notably, this groundbreaking work is the first to comprehensively explore the theory and applications of local convergence, a vital technique in analyzing sparse random graphs. With its suitability for researchers and advanced courses at the PhD level, the book employs real-world networks, such as the Internet and citation networks, as motivating examples for the discussed models. Each chapter concludes with engaging exercises to strengthen intuition, making it an invaluable resource for scholars seeking to advance their understanding of network theory. The book concludes with an extensive discussion of related models and problems, showcasing modern approaches to network analysis, including community structure and directed models.

Weight: 1190g
ISBN-13: 9781107174009