東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Random graphs and complex networks.....

Hofstad, Remco van der.

Linked to FindBook

Google Book

Amazon

博客來

Random graphs and complex networks.. Volume 1

Record Type:	Electronic resources : Monograph/item
Title/Author:	Random graphs and complex networks./ Remco van der Hofstad.
Author:	Hofstad, Remco van der.
Published:	Cambridge :Cambridge University Press, : 2017.,
Description:	xvi, 321 p. :ill., digital ;24 cm.
Subject:	Random graphs. -
Online resource:	https://doi.org/10.1017/9781316779422
ISBN:	9781316779422

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

Random graphs and complex networks.Volume 1[electronic resource] /Remco van der Hofstad. - Cambridge :Cambridge University Press,2017. - xvi, 321 p. :ill., digital ;24 cm. - Cambridge series in statistical and probabilistic mathematics ;43. - Cambridge series on statistical and probabilistic mathematics ;43..

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: 9781316779422Subjects--Topical Terms:

731238
Random graphs.

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

Dewey Class. No.: 511.5

Random graphs and complex networks.. Volume 1
LDR:01782nmm a2200253 a 4500 001 2182985
003 UkCbUP
005 20170202144420.0
006 m d
007 cr nn 008maaau
008 191203s2017 enk o 1 0 eng d
020 $a 9781316779422 $q (electronic bk.)
020 $a 9781107172876 $q (paper)
035 $a CR9781316779422
040 $a UkCbUP $b eng $c UkCbUP $d GP
041 0 $a eng
050 4 $a QA166.17 $b .H64 2017
082 0 4 $a 511.5 $2 23
090 $a QA166.17 $b .H64 2017
100 1 $a Hofstad, Remco van der. $3 3270346
245 1 0 $a Random graphs and complex networks. $n Volume 1 $h [electronic resource] / $c Remco van der Hofstad.
260 $a Cambridge : $b Cambridge University Press, $c 2017.
300 $a xvi, 321 p. : $b ill., digital ; $c 24 cm.
490 1 $a Cambridge series in statistical and probabilistic mathematics ; $v 43
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 731238
830 0 $a Cambridge series on statistical and probabilistic mathematics ; $v 43. $3 3391837
856 4 0 $u https://doi.org/10.1017/9781316779422