Jump to ContentJump to Main Navigation
Evolution of NetworksFrom Biological Nets to the Internet and WWW$
Users without a subscription are not able to see the full content.

S.N. Dorogovtsev and J.F.F. Mendes

Print publication date: 2003

Print ISBN-13: 9780198515906

Published to Oxford Scholarship Online: January 2010

DOI: 10.1093/acprof:oso/9780198515906.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 21 November 2018

WHAT ARE NETWORKS?

WHAT ARE NETWORKS?

Chapter:
(p.6) 1 WHAT ARE NETWORKS?
Source:
Evolution of Networks
Author(s):

S. N. Dorogovtsev

J. F. F. Mendes

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198515906.003.0002

This chapter introduces the basic characteristics and notions of graph theory and the science of networks: degree, degree distribution, clustering coefficient, the average length of the shortest path between two nodes in a network, the size of a giant connected component, and others. The classical random graphs and their characteristics are introduced and explained. The contrasting types of degree distributions are discussed: namely, Poisson and scale-free distributions.

Keywords:   degree distribution, giant connected component, clustering coefficient, graph theory, Poisson distribution, scale-free distributions

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .