This rigorous introduction to network science presents random graphs as models for real-world networks. Such networks have distinctive empirical properties and a wealth of new models have emerged to capture them. Classroom tested for over ten years, this text places recent advances in a unified fram...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Hofstad, Remco van der (VerfasserIn)
Format:	Elektronisch E-Book
Sprache:	English
Veröffentlicht:	Cambridge Cambridge University Press 2017
Schriftenreihe:	Cambridge series on statistical and probabilistic mathematics 43
Schlagworte:	Random graphs Netzwerk > Graphentheorie Zufallsgraph Graphentheorie Komplexes System
Online-Zugang:	BSB01 FHN01 Volltext
Zusammenfassung:	This rigorous introduction to network science presents random graphs as models for real-world networks. Such networks have distinctive empirical properties and a wealth of new models have emerged to capture them. Classroom tested for over ten years, this text places recent advances in a unified framework to enable systematic study. Designed for a master's-level course, where students may only have a basic background in probability, the text covers such important preliminaries as convergence of random variables, probabilistic bounds, coupling, martingales, and branching processes. Building on this base - and motivated by many examples of real-world networks, including the Internet, collaboration networks, and the World Wide Web - it focuses on several important models for complex networks and investigates key properties, such as the connectivity of nodes. Numerous exercises allow students to develop intuition and experience in working with the models
Beschreibung:	Title from publisher's bibliographic system (viewed on 31 Jan 2017)
Beschreibung:	1 online resource (xvi, 321 pages)
ISBN:	9781316779422
DOI:	10.1017/9781316779422