Threshold graphs as models of real-world networks

Abstract

A good number of real-world networks share similar properties with the class of threshold graphs. It is the general aim of this dissertation to examine intrinsic properties of real-world networks and compare them with those of threshold graphs. We measure the degree to which a real-world network can be represented by a threshold graph. We analyse graphs modelling different scenarios, comprising of world relations within a text graph, a friendship network and a network of criminals.