000 02312cam a22003257i 4500
999 _c30729
_d30729
003 CUTN
005 20190905125241.0
008 161108t20162016enka b 001 0 eng d
020 _a1107076269
020 _a9781107076266
041 _aEnglish
042 _alccopycat
082 0 4 _a004.6
_223
_bLAS
100 1 _aBarabási, Albert-László.
245 1 0 _aNetwork science /
_cAlbert-László Barabási ; with Márton Pósfai, data analysis and simulations.
260 _aCambridge, United Kingdom :
_bCambridge University Press,
_c2016.
300 _axviii, 456 pages :
_billustrations (some colour) ;
_c25 cm
505 _t1Introduction
_t2.Graph theory
_t3.Random networks
_t4.The scale-free property
_t5.The Barabási--Albert model
_t6.Evolving networks
_t7.Degree correlation
_t8.Network robustness
_t9.Communities
_t10.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 _aPósfai, Márton.
942 _2ddc
_cBOOKS
504 _aIncludes bibliographical references (pages [436]-452) and index.
856 4 2 _3Contributor biographical information
_uhttps://www.loc.gov/catdir/enhancements/fy1701/2016439537-b.html
856 4 2 _3Publisher description
_uhttps://www.loc.gov/catdir/enhancements/fy1701/2016439537-d.html
856 4 1 _3Table of contents only
_uhttps://www.loc.gov/catdir/enhancements/fy1701/2016439537-t.html
906 _a7
_bcbc
_ccopycat
_d2
_encip
_f20
_gy-gencatlg