NLU Meghalaya Library

Online Public Access Catalogue (OPAC)

Amazon cover image
Image from Amazon.com

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

By: Material type: TextTextSeries: Cambridge series on statistical and probabilistic mathematics ; 43.Publisher: Cambridge : Cambridge University Press, 2017Description: 1 online resource (xvi, 321 pages) : digital, PDF file(s)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9781316779422 (ebook)
Subject(s): DDC classification:
  • 511/.5 23
LOC classification:
  • QA166.17 .H64 2017
Online resources: Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode
eBooks eBooks Central Library Statistics & Probability Available EB0908

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.

There are no comments on this title.

to post a comment.
© 2022- NLU Meghalaya. All Rights Reserved. || Implemented and Customized by
OPAC Visitors

Powered by Koha