國立虎尾科技大學 |

Random graphs and complex networks.. Volume 1 /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Random graphs and complex networks./ Remco van der Hofstad, Technische Universiteit Eindhoven.
作者:	Hofstad, Remco van der,
面頁冊數:	1 online resource (xvi, 321 pages) :digital, PDF file(s). :
附註:	Title from publisher's bibliographic system (viewed on 31 Jan 2017).
標題:	Random graphs. -
電子資源:	https://doi.org/10.1017/9781316779422
ISBN:	9781316779422 (ebook)

Random graphs and complex networks.. Volume 1 /
Hofstad, Remco van der,

Random graphs and complex networks.Volume 1 /Remco van der Hofstad, Technische Universiteit Eindhoven. - 1 online resource (xvi, 321 pages) :digital, PDF file(s). - Cambridge series in statistical and probabilistic mathematics ;43. - Cambridge series on statistical and probabilistic mathematics ;32..

Title from publisher's bibliographic system (viewed on 31 Jan 2017).

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.

ISBN: 9781316779422 (ebook)Subjects--Topical Terms:

580184
Random graphs.

LC Class. No.: QA166.17 / .H64 2017

Dewey Class. No.: 511/.5

Random graphs and complex networks.. Volume 1 /
LDR:02033nam a22002898i 4500 001 1125895
003 UkCbUP
005 20170202144420.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 240926s2017||||enk o ||1 0|eng|d
020 $a 9781316779422 (ebook)
020 $z 9781107172876 (hardback)
020 $z 9781316625064 (paperback)
035 $a CR9781316779422
040 $a UkCbUP $b eng $e rda $c UkCbUP
050 0 0 $a QA166.17 $b .H64 2017
082 0 0 $a 511/.5 $2 23
100 1 $a Hofstad, Remco van der, $e author. $3 1444400
245 1 0 $a Random graphs and complex networks. $n Volume 1 / $c Remco van der Hofstad, Technische Universiteit Eindhoven.
264 1 $a Cambridge : $b Cambridge University Press, $c 2017.
300 $a 1 online resource (xvi, 321 pages) : $b digital, PDF file(s).
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
490 1 $a Cambridge series in statistical and probabilistic mathematics ; $v 43
500 $a Title from publisher's bibliographic system (viewed on 31 Jan 2017).
520 $a 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.
650 0 $a Random graphs. $3 580184
830 0 $a Cambridge series on statistical and probabilistic mathematics ; $v 32. $3 1133567
856 4 0 $u https://doi.org/10.1017/9781316779422