000			02128cam a22002657i 4500
001			19367756
003			OSt
005			20191122105240.0
008			161108t20162016enka b 001 0 eng d
010			_a 2016439537
020			_a9781107076266 (bpk
040			_cNCL _dLIN2019
082	0	4	_a004.6 _223 _bBAR-N 2016 9827
100	1		_aBarabasi, Albert-Laszlo.
245	1	0	_aNetwork science / _cAlbert-Laszlo Barabasi ; with Marton Posfai, data analysis and simulations.
264		1	_aCambridge, United Kingdom : _bCambridge University Press, _c2016.
264		4	_c©2016
300			_axviii, 456 pages : _billustrations (some colour) ; _c25 cm
505			_aChapter 1: Introduction------------------------------ Chapter 2: Graph Theory--------------------------- Chapter 3: Random Networks----------------------------- Chapter 4: The Scale-free Property----------------------------- Chapter 5: The Barabasi-Albert Model-------------------------- Chapter 6: Evolving Networks------------------------- Chapter 7: Degree Correlation----------------------- Chapter 1: Network Robustness--------------------------- Chapter 9: Communities-------------------------- Chapter 10: Spreading Phenomena-----------------------
520			_a"Networks are everywhere, from the Internet, to social networks, and the genetic networks that determine our biological existence. Illustrated throughout in full colour, this pioneering textbook, spanning a wide range of topics from physics to computer science, engineering, economics and the social sciences, introduces network science to an interdisciplinary audience. From the origins of the six degrees of separation to explaining why networks are robust to random failures, the author explores how viruses like Ebola and H1N1 spread, and why it is that our friends have more friends than we do. Using numerous real-world examples, this innovatively designed text includes clear delineation between undergraduate and graduate level material"--Page [4] of cover.
650		0	_aComputer networks.
650		0	_aInformation networks.
700	1		_aPosfai, Marton.
942			_2ddc _cBK
999			_c7514 _d7514