Skip to main content
SpringerLink
Log in

Parallel Algorithms for Generating Random Networks with Given Degree Sequences

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

Abstract

Random networks are widely used for modeling and analyzing complex processes. Many mathematical models have been proposed to capture diverse real-world networks. One of the most important aspects of these models is degree distribution. Chung–Lu (CL) model is a random network model, which can produce networks with any given arbitrary degree distribution. The complex systems we deal with nowadays are growing larger and more diverse than ever. Generating random networks with any given degree distribution consisting of billions of nodes and edges or more has become a necessity, which requires efficient and parallel algorithms. We present an MPI-based distributed memory parallel algorithm for generating massive random networks using CL model, which takes \(O\left( \frac{m+n}{P}+P\right) \) time with high probability and O(n) space per processor, where n, m, and P are the number of nodes, edges and processors, respectively. The time efficiency is achieved by using a novel load-balancing algorithm. Our algorithms scale very well to a large number of processors and can generate massive power–law networks with one billion nodes and 250 billion edges in one minute using 1024 processors.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Barabási, A., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

  2. Barrett, C., Beckman, R., Khan, M., Kumar, V., Marathe, M., Stretz, P., Dutta, T., Lewis, B.: Generation and analysis of large synthetic social contact networks. In: Proc. of the Winter Sim. Conf., pp. 1003–1014 (2009)

  3. Batagelj, V., Brandes, U.: Efficient generation of large random networks. Phys. Rev. E 71(3), 036113 (2005)

    Article  Google Scholar 

  4. Carlson, J., Doyle, J.: Highly optimized tolerance: a mechanism for power laws in designed systems. Phys. Rev. E 60(2), 1412–1427 (1999)

    Article  Google Scholar 

  5. Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: A recursive model for graph mining. In: Fourth SIAM International Conference on Data Mining, vol. 4, 442–446 (2004)

  6. Chassin, D., Posse, C.: Evaluating North American electric grid reliability using the Barabasi–Albert network model. Phys. A 335(2), 667–677 (2005)

    Article  Google Scholar 

  7. Chung, F., Lu, L.: Connected components in random graphs with given expected degree sequences. Ann. Comb. 6(2), 125–145 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Erdös, P., Rényi, A.: On the evolution of random graphs. In: Publications of the Mathematical Institute of the Hungarian Academy of Sciences, vol. 5, pp. 17–61 (1960)

  9. Girvan, M., Newman, M.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99(12), 7821–7826 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Graph500: Graph 500. http://www.graph500.org/ (2010)

  11. Latora, V., Marchiori, M.: Vulnerability and protection of infrastructure networks. Phys. Rev. E 71(1), 015103 (2005)

    Article  Google Scholar 

  12. Leskovec, J.: Dynamics of Large Networks. Ph.D. thesis, Carnegie Mellon University (2008)

  13. Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: an approach to modeling networks. J. Mach. Learn. Res. 11, 985–1042 (2010)

    MathSciNet  MATH  Google Scholar 

  14. Leskovec, J., Faloutsos, C.: Scalable modeling of real graphs using Kronecker multiplication. In: Proceedings of the 24th International Conference on Machine Learning, pp. 497–504 (2007)

  15. Manne, F., Sorevik, T.: Optimal partitioning of sequences. J. Algorithms 19(2), 235–249 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  16. Miller, J., Hagberg, A.: Efficient generation of networks with given expected degrees. In: Proceedings of Algorithms and Models for the Web-Graph, vol. 6732, pp. 115–126 (2011)

  17. Olstad, B., Manne, F.: Efficient partitioning of sequences. IEEE Trans. Comput. 44(11), 1322–1326 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  18. Pinar, A., Aykanat, C.: Fast optimal load balancing algorithms for 1D partitioning. J. Parallel Distrib. Comput. 64(8), 974–996 (2004)

    Article  MATH  Google Scholar 

  19. Pinar, A., Seshadhri, C., Kolda, T.: The similarity between stochastic Kronecker and Chung-Lu graph models. In: Proceedings of the 12th International Conference of SDM, vol. 12, pp. 1071–1082 (2012)

  20. Robins, G., Pattison, P., Kalish, Y., Lusher, D.: An introduction to exponential random graph (p*) models for social networks social networks. Soc. Netw. 29(2), 173–191 (2007)

    Article  Google Scholar 

  21. Sanders, P., Träff, J.: Parallel prefix (scan) algorithms for MPI. In: Proceedings of the 13th Conference on Recent Advances in PVM and MPI, vol. 4192, pp. 49–57 (2006)

  22. Siganos, G., Faloutsos, M., Faloutsos, P., Faloutsos, C.: Power laws and the AS-level internet topology. IEEE/ACM Trans. Netw. 11(4), 514–524 (2003)

    Article  MATH  Google Scholar 

  23. Watts, D., Strogatz, S.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 409–410 (1998)

    Article  Google Scholar 

  24. Yang, J., Leskovec, J.: Patterns of temporal variation in online media. In: Proceedings of the 4th ACM International Conference on Web Search and Data Mining, pp. 177–186 (2011)

  25. Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: Proceedings of the ACM SIGKDD Workshop, pp. 1–8 (2012)

Download references

Acknowledgments

This work has been partially supported by DTRA Grant HDTRA1-11-1-0016, DTRA CNIMS Contract HDTRA1-11-D-0016-0001, NSF NetSE Grant CNS-1011769, NSF SDCI Grant OCI-1032677, and NSF DIBBs Grant ACI-1443054.

Author information

Authors and Affiliations

  1. Department of Computer Science, Virginia Bioinformatics Institute, Virginia Tech, Blacksburg, VA, 24061, USA

    Maksudul Alam

  2. Network Dynamics and Simulation Science Laboratory, Virginia Bioinformatics Institute, Virginia Tech, Blacksburg, VA, 24061, USA

    Maksudul Alam & Maleq Khan

Authors
  1. Maksudul Alam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maleq Khan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maksudul Alam.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Alam, M., Khan, M. Parallel Algorithms for Generating Random Networks with Given Degree Sequences. Int J Parallel Prog 45, 109–127 (2017). https://doi.org/10.1007/s10766-015-0389-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10766-015-0389-y

Keywords

Search

Navigation