Properties of a growing random directed network

摘要

We study a number of properties of a simple random growing directed network which can be used to model real directed networks such as the world-wide web and call graphs. We confirm numerically that the distributions of in- and out-degree are consistent with a power law, in agreement with previous analytical results and with empirical measurements from real graphs. We study the distribution and mean of the minimum path length, the high degree nodes, the appearance and size of the giant component and the topology of the nodes outside the giant component. These properties are compared with empirical studies of the world-wide web.