Skip to main content
SpringerLink
Log in

Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication

  • Regular Article
  • Published:
The European Physical Journal B Aims and scope Submit manuscript

Abstract

We present exact analytical results for the distribution of shortest path lengths (DSPL) in a directed network model that grows by node duplication. Such models are useful in the study of the structure and growth dynamics of gene regulatory networks and scientific citation networks. 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 and duplicates each outgoing link of the mother node with probability p. In addition, the daughter node forms a directed link to the mother node itself. Thus, the model is referred to as the corded directed-node-duplication (DND) model. In this network not all pairs of nodes are connected by directed paths, in spite of the fact that the corresponding undirected network consists of a single connected component. More specifically, in the large network limit only a diminishing fraction of pairs of nodes are connected by directed paths. To calculate the DSPL between those pairs of nodes that are connected by directed paths we derive a master equation for the time evolution of the probability Pt(L = ℓ), ℓ = 1, 2, … , where ℓ is the length of the shortest directed path. Solving the master equation, we obtain a closed form expression for Pt(L = ℓ). It is found that the DSPL at time t consists of a convolution of the initial DSPL P0(L = ℓ), with a Poisson distribution and a sum of Poisson distributions. The mean distance 𝔼t[L|L < ∞] between pairs of nodes which are connected by directed paths is found to depend logarithmically on the network size Nt. However, since in the large network limit the fraction of pairs of nodes that are connected by directed paths is diminishingly small, the corded DND network is not a small-world network, unlike the corresponding undirected network.

Graphical abstract

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Albert, A.-L. Barabási, Rev. Mod. Phys. 74, 47 (2002)

    Article  ADS  MathSciNet  Google Scholar 

  2. G. Caldarelli, Scale free networks: complex webs in nature and technology (Oxford University Press, 2007)

  3. S. Havlin, R. Cohen, Complex Networks: Structure, Robustness and Function (Cambridge University Press, 2010)

  4. M.E.J. Newman, Networks: an Introduction (Oxford University Press, 2010)

  5. E. Estrada, The Structure of Complex Networks: Theory and Applications (Oxford University Press, 2011)

  6. A. Barrat, M. Barthélemy, A. Vespignani, Dynamical Processes on Complex Networks (Cambridge University Press, 2012)

  7. S. Milgram, Psychol. Today 1, 61 (1967)

    Google Scholar 

  8. D. Watts, S. Strogatz, Nature 393, 440 (1998)

    Article  ADS  Google Scholar 

  9. F. Chung, L. Lu, Proc. Natl. Acad. Sci. USA 99, 15879 (2002)

    Article  ADS  MathSciNet  Google Scholar 

  10. F. Chung, L. Lu, Internet Math. 1, 91 (2004)

    Article  Google Scholar 

  11. A.-L. Barabási, R. Albert, Science 286, 509 (1999)

    Article  ADS  MathSciNet  Google Scholar 

  12. H. Jeong, B. Tombor, R. Albert, Z.N. Oltvai, A.-L. Barabási, Nature 407, 651 (2000)

    Article  ADS  Google Scholar 

  13. P.L. Krapivsky, S. Redner, F. Leyvraz, Phys. Rev. Lett. 85, 4629 (2000)

    Article  ADS  Google Scholar 

  14. P.L. Krapivsky, S. Redner, Phys. Rev. E 63, 066123 (2001)

    Article  ADS  Google Scholar 

  15. A. Vázquez, Phys. Rev. E 67, 056104 (2003)

    Article  ADS  Google Scholar 

  16. R. Cohen, S. Havlin, Phys. Rev. Lett. 90, 058701 (2003)

    Article  ADS  Google Scholar 

  17. L. Giot et al., Science 302, 1727 (2003)

    Article  ADS  Google Scholar 

  18. A. Maáyan, S.L. Jenkins, S. Neves, A. Hasseldine, E. Grace, B. Dubin-Thaler, N.J. Eungdamrong, G. Weng, P.T. Ram, J.J. Rice, A. Kershenbaum, G.A. Stolovitzky, R.D. Blitzer, R. Iyengar, Science 309, 1078 (2005)

    Article  ADS  Google Scholar 

  19. E.W. Dijkstra, Numerische Mathematik 1, 269 (1959)

    Article  MathSciNet  Google Scholar 

  20. D. Delling, P. Sanders, D. Schultes, D. Wagner, Engineering route planning algorithms, in Algorithmics of large and complex networks: design, analysis, and simulation, edited by J. Lerner, D. Wagner, K.A. Zweig (2009), p. 117

  21. R. Pastor-Satorras, C. Castellano, P. Van Mieghem, A. Vespignani, Rev. Mod. Phys. 87, 925 (2015)

    Article  ADS  Google Scholar 

  22. B. Bollobas, in Random Graphs, 2nd edn. (Academic Press, London, 2001)

  23. R. Durrett, Random Graph Dynamics (Cambridge University Press, Cambridge, 2007)

  24. A. Fronczak, P. Fronczak, J.A. Holyst, Phys. Rev. E 70, 056110 (2004)

    Article  ADS  Google Scholar 

  25. M.E.J. Newman, Proc. Natl. Acad. Sci. USA 98, 404 (2001)

    Article  ADS  MathSciNet  Google Scholar 

  26. A.K. Hartmann, M. Mézard, Phys. Rev. E 97, 032128 (2017)

    Article  ADS  Google Scholar 

  27. M.E.J. Newman, S.H. Strogatz, D.J. Watts, Phys. Rev. E 64, 026118 (2001)

    Article  ADS  Google Scholar 

  28. S.N. Dorogotsev, J.F.F. Mendes, A.N. Samukhin, Nucl. Phys. B 653, 307 (2003)

    Article  ADS  Google Scholar 

  29. V.D. Blondel, J.-L. Guillaume, J.M. Hendrickx, R.M. Jungers, Phys. Rev. E 76, 066101 (2007)

    Article  ADS  MathSciNet  Google Scholar 

  30. R. van der Hofstad, G. Hooghiemstra, D. Znamenski, Electron. J. Probab. 12, 703 (2007)

    Article  MathSciNet  Google Scholar 

  31. H. van der Esker, R. van der Hofstad, G. Hooghiemstra, J. Stat. Phys. 133, 169 (2008)

    Article  ADS  MathSciNet  Google Scholar 

  32. J. Shao, S.V. Buldyrev, R. Cohen, M. Kitsak, S. Havlin, H.E. Stanley, Europhys. Lett. 84, 48004 (2008)

    Article  ADS  Google Scholar 

  33. J. Shao, S.V. Buldyrev, L.A. Braunstein, S. Havlin, H.E. Stanley, Phys. Rev. E 80, 036105 (2009)

    Article  ADS  Google Scholar 

  34. E. Katzav, M. Nitzan, D. ben-Avraham, P.L. Krapivsky, R. Kühn, N. Ross, O. Biham, Europhys. Lett. 111, 26006 (2015)

    Article  ADS  Google Scholar 

  35. P. Erdős, A. Rényi, Publ. Math. (Debrecen) 6, 290 (1959)

    MathSciNet  Google Scholar 

  36. P. Erdős, A. Rényi, Publ. Math. Inst. Hung. Acad. Sci. 5, 17 (1960)

    Google Scholar 

  37. P. Erdős, A. Rényi, Bull. Inst. Int. Stat. 38, 343 (1961)

    Google Scholar 

  38. M. Nitzan, E. Katzav, R. Kühn, O. Biham, Phys. Rev. E 93, 062309 (2016)

    Article  ADS  Google Scholar 

  39. S. Melnik, J.P. Gleeson, arXiv:1604.05521

  40. M. Molloy, B. Reed, Random Struct. Algorithms 6, 161 (1995)

    Article  Google Scholar 

  41. M. Molloy, B. Reed, Combin. Probab. Comput. 7, 295 (1998)

    Article  MathSciNet  Google Scholar 

  42. A. Bhan, D.J. Galas, T.G. Dewey, Bioinformatics 18, 1486 (2002)

    Article  Google Scholar 

  43. J. Kim, P.L. Krapivsky, B. Kahng, S. Redner, Phys. Rev. E 66, 055101 (2002)

    Article  ADS  Google Scholar 

  44. F. Chung, L. Lu, T.G. Dewey, D.J. Galas, J. Comput. Biol. 10, 677 (2003)

    Article  Google Scholar 

  45. P.L. Krapivsky, S. Redner, Phys. Rev. E 71, 036118 (2005)

    Article  ADS  Google Scholar 

  46. I. Ispolatov, P.L. Krapivsky, A. Yuryev, Phys. Rev. E 71, 061911 (2005)

    Article  ADS  Google Scholar 

  47. I. Ispolatov, P.L. Krapivsky, I. Mazo, A. Yuryev, New J. Phys. 7, 145 (2005)

    Article  ADS  Google Scholar 

  48. G. Bebek, P. Berenbrink, C. Cooper, T. Friedetzky, J. Nadeau, S.C. Sahinalp, Theor. Comput. Sci. 369, 239 (2006)

    Article  Google Scholar 

  49. S. Li, K.P. Choi, T. Wu, Theor. Comput. Sci. 476, 94 (2013)

    Article  Google Scholar 

  50. R. Lambiotte, P.L. Krapivsky, U. Bhat, S. Redner, Phys. Rev. Lett. 117, 218301 (2016)

    Article  ADS  Google Scholar 

  51. U. Bhat, P.L. Krapivsky, R. Lambiotte, S. Redner, Phys. Rev. E 94, 062302 (2016)

    Article  ADS  Google Scholar 

  52. R. Toivonen, L. Kovanen, M. Kivelä, J.-P. Onnela, J. Saramäki, K. Kaski, Soc. Netw. 31, 240 (2009)

    Article  Google Scholar 

  53. M. Granovetter, Am. J. Sociol. 78, 1360 (1973)

    Article  Google Scholar 

  54. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, U. Alon, Science 298, 824 (2002)

    Article  ADS  Google Scholar 

  55. U. Alon, An Introduction to Systems Biology: Design Principles of Biological Circuits (Chapman and Hall/, 2006)

  56. C. Steinbock, O. Biham, E. Katzav, Phys. Rev. E 96, 032301 (2017)

    Article  ADS  Google Scholar 

  57. S. Ohno, Evolution by Gene Duplication (Springer-Verlag, New York, 1970)

  58. S.A. Teichmann, M.M. Babu, Nat. Genet. 36, 492 (2004)

    Article  Google Scholar 

  59. S. Redner, Eur. Phys. J. B 4, 131 (1998)

    Article  ADS  Google Scholar 

  60. S. Redner, Phys. Today 58, 49 (2005)

    Article  Google Scholar 

  61. F. Radicchi, S. Fortunato, C. Castellano, Proc. Natl. Acad. Sci. USA 105, 17268 (2008)

    Article  ADS  Google Scholar 

  62. M. Golosovsky, S. Solomon, Phys. Rev. Lett. 109, 098701 (2012)

    Article  ADS  Google Scholar 

  63. M. Golosovsky, S. Solomon, Phys. Rev. E 95, 012324 (2017)

    Article  ADS  Google Scholar 

  64. M. Golosovsky, Phys. Rev. E 96, 032306 (2017)

    Article  ADS  Google Scholar 

  65. G.J. Peterson, S. Pressé, K.A. Dill, Proc. Natl. Acad. Sci. USA 107, 16023 (2010)

    Article  ADS  Google Scholar 

  66. C. Steinbock, O. Biham, E. Katzav, arXiv:1807.01591

  67. R.T. Smythe, H. Mahmoud, Theory Probab. Math. Statist. 51, 1 (1995)

    Google Scholar 

  68. M. Drmota, B. Gittenberger, Random Struct. Algorithms 10, 421 (1997)

    Article  Google Scholar 

  69. M. Drmota, H.-K. Hwang, Adv. Appl. Probab. 37, 321 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Racah Institute of Physics, The Hebrew University, Jerusalem, 91904, Israel

    Chanania Steinbock, Ofer Biham & Eytan Katzav

Authors
  1. Chanania Steinbock
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ofer Biham
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eytan Katzav
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ofer Biham.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Steinbock, C., Biham, O. & Katzav, E. Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication. Eur. Phys. J. B 92, 130 (2019). https://doi.org/10.1140/epjb/e2019-100139-5

Download citation

  • Received:

  • Revised:

  • Published:

  • DOI: https://doi.org/10.1140/epjb/e2019-100139-5

Keywords

Search

Navigation