Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Introduction to random graphs / Alan Frieze and Michal Karonski.

By: Contributor(s): Material type: TextTextPublication details: Cambridge : Cambridge University Press, 2016.Description: xvii, 464 pages : illustrations ; 24 cmISBN:
  • 9781107118508 (hardback)
Subject(s): DDC classification:
  • 511.5 23 F912
Contents:
Preface; Part I. Basic Models: 1. Random graphs; 2. Evolution; 3. Vertex degrees; 4. Connectivity; 5. Small subgraphs; 6. Spanning subgraphs; 7. Extreme characteristics; 8. Extremal properties; Part II. Basic Model Extensions: 9. Inhomogeneous graphs; 10. Fixed degree sequence; 11. Intersection graphs; 12. Digraphs; 13. Hypergraphs; Part III. Other Models: 14. Trees; 15. Mappings; 16. k-out; 17. Real-world networks; 18. Weighted graphs; 19. Brief notes on uncovered topics; Part IV. Tools and Methods: 20. Moments; 21. Inequalities; 22. Differential equations method; 23. Branching processes; 24. Entropy.
Summary: "From social networks such as Facebook, the World Wide Web and the Internet, to the complex interactions between proteins in the cells of our bodies, we constantly face the challenge of understanding the structure and development of networks. The theory of random graphs provides a framework for this understanding, and in this book the authors give a gentle introduction to the basic tools for understanding and applying the theory. Part I includes sufficient material, including exercises, for a one semester course at the advanced undergraduate or beginning graduate level. The reader is then well prepared for the more advanced topics in Parts II and III. A final part provides a quick introduction to the background material needed. All those interested in discrete mathematics, computer science or applied probability and their applications will find this an ideal introduction to the subject"--
Tags from this library: No tags from this library for this title. Log in to add tags.

Includes bibliographical references and indexes.

Preface;
Part I. Basic Models:
1. Random graphs;
2. Evolution;
3. Vertex degrees;
4. Connectivity;
5. Small subgraphs;
6. Spanning subgraphs;
7. Extreme characteristics;
8. Extremal properties;
Part II. Basic Model Extensions:
9. Inhomogeneous graphs;
10. Fixed degree sequence;
11. Intersection graphs;
12. Digraphs;
13. Hypergraphs;
Part III. Other Models:
14. Trees;
15. Mappings;
16. k-out;
17. Real-world networks;
18. Weighted graphs;
19. Brief notes on uncovered topics;
Part IV. Tools and Methods:
20. Moments;
21. Inequalities;
22. Differential equations method;
23. Branching processes;
24. Entropy.

"From social networks such as Facebook, the World Wide Web and the Internet, to the complex interactions between proteins in the cells of our bodies, we constantly face the challenge of understanding the structure and development of networks. The theory of random graphs provides a framework for this understanding, and in this book the authors give a gentle introduction to the basic tools for understanding and applying the theory. Part I includes sufficient material, including exercises, for a one semester course at the advanced undergraduate or beginning graduate level. The reader is then well prepared for the more advanced topics in Parts II and III. A final part provides a quick introduction to the background material needed. All those interested in discrete mathematics, computer science or applied probability and their applications will find this an ideal introduction to the subject"--

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in