Distribution of shortest path lengths in a class of node duplication network models

Chanania Steinbock, Ofer Biham, Eytan Katzav

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


We present analytical results for the distribution of shortest path lengths (DSPL) in a network growth model which evolves by node duplication (ND). The model captures essential properties of the structure and growth dynamics of social networks, acquaintance networks, and scientific citation networks, where duplication mechanisms play a major role. Starting from an initial seed network, at each time step a random node, referred to as a mother node, is selected for duplication. Its daughter node is added to the network, forming a link to the mother node, and with probability p to each one of its neighbors. The degree distribution of the resulting network turns out to follow a power-law distribution, thus the ND network is a scale-free network. To calculate the DSPL we derive a master equation for the time evolution of the probability Pt(L=ℓ), ℓ=1,2, where L is the distance between a pair of nodes and t is the time. Finding an exact analytical solution of the master equation, we obtain a closed form expression for Pt(L=ℓ). The mean distance (L)t and the diameter Δt are found to scale like lnt, namely, the ND network is a small-world network. The variance of the DSPL is also found to scale like lnt. Interestingly, the mean distance and the diameter exhibit properties of a small-world network, rather than the ultrasmall-world network behavior observed in other scale-free networks, in which (L)t∼lnlnt.

Original languageAmerican English
Article number032301
JournalPhysical Review E
Issue number3
StatePublished - 1 Sep 2017

Bibliographical note

Publisher Copyright:
© 2017 American Physical Society.


Dive into the research topics of 'Distribution of shortest path lengths in a class of node duplication network models'. Together they form a unique fingerprint.

Cite this