Growing directed networks: stationary in-degree probability for arbitrary out-degree one

DOI10.1140/EPJB/E2008-00075-3zbMATH Open1189.90024arXiv0704.1847OpenAlexW1847413697WikidataQ105584181 ScholiaQ105584181MaRDI QIDQ978705FDOQ978705

Authors: Daniel Fraiman 

Publication date: 25 June 2010

Published in: The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)

Abstract: We compute the stationary in-degree probability, $P_{in}(k)$, for a growing network model with directed edges and arbitrary out-degree probability. In particular, under preferential linking, we find that if the nodes have a light tail (finite variance) out-degree distribution, then the corresponding in-degree one behaves as $k^{-3}$. Moreover, for an out-degree distribution with a scale invariant tail, $P_{out}(k)sim{k}^{-alpha}$, the corresponding in-degree distribution has exactly the same asymptotic behavior only if $2<alpha<3$ (infinite variance). Similar results are obtained when attractiveness is included. We also present some results on descriptive statistics measures %descriptive statistics such as the correlation between the number of in-going links, $D_{in}$, and outgoing links, $D_{out}$, and the conditional expectation of $D_{in}$ given $D_{out}$, and we calculate these measures for the WWW network. Finally, we present an application to the scientific publications network. The results presented here can explain the tail behavior of in/out-degree distribution observed in many real networks.

Full work available at URL: https://arxiv.org/abs/0704.1847

Recommendations

• Directed preferential attachment models: limiting degree distributions and their tails
• Nonstandard regular variation of in-degree and out-degree in the preferential attachment model
• Directed scale-free graphs
• Analytical results for the in-degree and out-degree distributions of directed random networks that grow by node duplication
• The degree distribution and the number of edges between nodes of given degrees in directed scale-free graphs

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Cites Work

• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Dynamics of directed graphs: The world-wide Web
• Bifurcations and patterns in compromise processes

Cited In (2)

• Analytical solution of a stochastic content-based network model
• Nonparametric statistics of dynamic networks with distinguishable nodes

This page was built for publication: Growing directed networks: stationary in-degree probability for arbitrary out-degree one

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q978705)