First steps towards networks

Sergey N. Dorogovtsev

in Lectures on Complex Networks

Published in print February 2010 | ISBN: 9780199548927
Published online May 2010 | e-ISBN: 9780191720574 | DOI:

Series: Oxford Master Series in Physics

First steps towards networks

Show Summary Details


This chapter introduces the basic notions of graph theory and discusses the starting point of network science, namely the Konigsberg bridge problem. A few examples of different graphs, lattices, and fractals are considered. These are used to explain the notions of a node degree, the shortest path length, clustering and so on. Milgram's experiment is also considered, and the notion of a random network is explained. A fundamental difference between small worlds and lattices and fractals, is discussed.

Keywords: graph theory; random networks; degree; degree distribution; clustering; trees

Chapter.  4291 words.  Illustrated.

Subjects: Mathematical and Statistical Physics

Full text: subscription required

How to subscribe Recommend to my Librarian

Buy this work at Oxford University Press »

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.