000			a
999			_c29775 _d29775
008			191105b xxu||||| |||| 00| 0 eng d
020			_a9781107172876
082			_a511.5 _bHOF
100			_aHofstad, Remco van der
245			_aRandom graphs and complex networks
260			_bCambridge University Press _c2016 _aCambridge
300			_axvi, 321 p. _bill. _c26 cm.
365			_b44.99 _cGBP _d4148.08
490			_aCambridge series in statistical and probabilistic mathematics _v43
520			_aThis 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.
650			_aRandom graphs
650			_aNotations
650			_aNetwork statistic
650			_aGraph models
942			_2ddc _cBK