ScholarLens Back to search
2003•Oxford University Press eBooksRequires access

WHAT ARE NETWORKS?

Sergey N. Dorogovtsev, José F. F. Mendes

Open publisher page 0 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Clustering coefficient, Degree distribution, Giant component, Random graph, Poisson distribution, Degree (music), Average path length, Scale-free network

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
WHAT ARE NETWORKS? — Research Paper | ScholarLens