Random Graphs and Complex Networks: Volume 1 (Cambridge Series in Statistical and Probabilistic Mathematics)
暫譯: 隨機圖與複雜網絡:第一卷(劍橋統計與概率數學系列)
Remco van der Hofstad
- 出版商: Cambridge
- 出版日期: 2016-12-24
- 售價: $2,700
- 貴賓價: 9.5 折 $2,565
- 語言: 英文
- 頁數: 236
- 裝訂: Hardcover
- ISBN: 110717287X
- ISBN-13: 9781107172876
海外代購書籍(需單獨結帳)
商品描述
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.
商品描述(中文翻譯)
這本嚴謹的網路科學入門書將隨機圖作為現實世界網路的模型。這些網路具有獨特的實證特性,並且出現了大量新的模型來捕捉這些特性。這本書經過十多年的課堂測試,將最近的進展置於統一的框架中,以便進行系統性的研究。該書設計為碩士級課程,學生可能只有基本的機率背景,內容涵蓋了隨機變數的收斂、機率界限、耦合、馬丁蓮(martingales)和分支過程等重要的前置知識。在這個基礎上,並受到許多現實世界網路的例子(包括互聯網、合作網路和萬維網)的啟發,該書專注於幾個重要的複雜網路模型,並探討關鍵特性,例如節點的連通性。大量的練習題讓學生能夠發展直覺並獲得使用這些模型的經驗。