切換：
- 簡略
- 詳細(MARC)
- ISBD
-
Random graphs and complex networks.Volume 1
正題名/作者 ： Random graphs and complex networks./ Remco van der Hofstad.
出版者 ： Cambridge :Cambridge University Press,2017.
面頁冊數 ： xvi, 321 p. :ill., digital ;24 cm.
標題 ： Random graphs. -
電子資源 ： 線上閱讀(Cambridge)
ISBN ： 9781316779422$q(electronic bk.)
ISBN ： 9781107172876$q(paper)
LEADER 01748cmm 2200217 a 450
001 306077
003 UkCbUP
005 20170202144420.0
008 160321s2017 enk o 1 0 eng d
020 $a9781316779422$q(electronic bk.)
020 $a9781107172876$q(paper)
035 $a00358416
041 0 $aeng
050 4$aQA166.17$b.H64 2017
082 04$a511.5$223
090 $aE-BOOK/511.5///UE040709
100 1 $aHofstad, Remco van der.$3497120
245 10$aRandom graphs and complex networks.$nVolume 1$h[electronic resource] /$cRemco van der Hofstad.
260 $aCambridge :$bCambridge University Press,$c2017.
300 $axvi, 321 p. :$bill., digital ;$c24 cm.
490 1 $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 0$aRandom graphs.$3155748
830 0$aCambridge series on statistical and probabilistic mathematics ;$v43.$3549842
856 40$uhttps://erm.library.ntpu.edu.tw/login?url=https://doi.org/10.1017/9781316779422$z線上閱讀(Cambridge)
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: 9781316779422$q(electronic bk.)Subjects--Topical Terms:
155748
Random graphs.
LC Class. No.: QA166.17 / .H64 2017
Dewey Class. No.: 511.5
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: 9781316779422$q(electronic bk.)Subjects--Topical Terms:
155748
Random graphs.
LC Class. No.: QA166.17 / .H64 2017
Dewey Class. No.: 511.5
- 館藏(1)
- 心得(0)
- 標籤
- 相同喜好的讀者(0)
- 相關資料(0)
發表心得