Fig. 7
From: Structural inequalities emerging from a large wire transfers network
Giant component compared to average degree: we compared the monthly evolution of the ISP network (red crosses) with a series of a Erdős-Renyi random graphs with same number of vertices and edges (green squares). Each point (xi,yi) represents a monthly observation of the network ISP (or its relative ER graph) that exhibits a mean degree 〈k〉=xi and a percentage yi of nodes connected in its largest connected component. The ISP network (red) does not show phase transition, while Erdős-Renyi (green) graphs do just after 〈k〉=1. It should be noticed that each point of the random reference model is the result of the averages of 10 different ER graphs. However, the different realisations return very stable values; for example, the GCC emerges (i.e., size of the largest component exceeds 50% of total nodes) when mean degree is between 1.383 and 1.387