Abstract:
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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received 15 June 2001 and Received in final form 12 July 2001
Rights and permissions
About this article
Cite this article
Rodgers, G., Darby-Dowman, K. Properties of a growing random directed network. Eur. Phys. J. B 23, 267–271 (2001). https://doi.org/10.1007/s100510170076
Issue Date:
DOI: https://doi.org/10.1007/s100510170076