Random graphs and complex networks

Research output: Book/ReportBookAcademic

84 Citations (Scopus)

Abstract

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.

LanguageEnglish
Place of PublicationCambridge
PublisherCambridge University Press
Number of pages321
ISBN (Print)978-1-107-17287-6
DOIs
StatePublished - 1 Jan 2017

Fingerprint

Random Graphs
Complex Networks
A.s. Convergence
Branching process
Martingale
Model
Exercise
Connectivity
Random variable
Cover
Vertex of a graph
Text

Cite this

van der Hofstad, R. W. (2017). Random graphs and complex networks. Cambridge: Cambridge University Press. DOI: 10.1017/9781316779422
van der Hofstad, R.W./ Random graphs and complex networks. Cambridge : Cambridge University Press, 2017. 321 p.
@book{9b3a4a214fb54d74bd21d2fdfa17b810,
title = "Random graphs and complex networks",
abstract = "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.",
author = "{van der Hofstad}, R.W.",
year = "2017",
month = "1",
day = "1",
doi = "10.1017/9781316779422",
language = "English",
isbn = "978-1-107-17287-6",
publisher = "Cambridge University Press",
address = "United Kingdom",

}

van der Hofstad, RW 2017, Random graphs and complex networks. Cambridge University Press, Cambridge. DOI: 10.1017/9781316779422

Random graphs and complex networks. / van der Hofstad, R.W.

Cambridge : Cambridge University Press, 2017. 321 p.

Research output: Book/ReportBookAcademic

TY - BOOK

T1 - Random graphs and complex networks

AU - van der Hofstad,R.W.

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85013140983&partnerID=8YFLogxK

U2 - 10.1017/9781316779422

DO - 10.1017/9781316779422

M3 - Book

SN - 978-1-107-17287-6

BT - Random graphs and complex networks

PB - Cambridge University Press

CY - Cambridge

ER -

van der Hofstad RW. Random graphs and complex networks. Cambridge: Cambridge University Press, 2017. 321 p. Available from, DOI: 10.1017/9781316779422