Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Exploration of the Critical Diameter in Networks

  • Conference paper
  • First Online:
Bio-inspired Computing – Theories and Applications (BIC-TA 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 681))

  • 972 Accesses

Abstract

Diameter is an important index measuring the connectivity and the transfer efficiency of networks. In the process of minimizing APL (Average Path Length) by adding edges, we find that APL begins to decline linearly when the number of added edges increases to a turning point and the network diameter decreases to 2. We define this point as the critical state. Furthermore, we put forward the new concept of critical diameter and explore its properties. Memetic Algorithm combined with advantages of genetic algorithm and local search has shown good performance in solving combinational explosion problems. We propose an algorithm based on memetic algorithm in this paper to transform the network diameter into the critical diameter. The experiment results show that our proposed algorithm can efficiently transform the diameter into critical diameter.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Watts, D., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(June), 440–442 (1998)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47–97 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Barabási, A.-L.: Scale-free networks: a decade and beyond. Science 325(5939), 412–413 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  6. Demaine, E.D., Zadimoghaddam, M.: Minimizing the diameter of a network using shortcut edges. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 420–431. Springer, Heidelberg (2010). doi:10.1007/978-3-642-13731-0_39

    Chapter  Google Scholar 

  7. Benini, L., De Micheli, G.: Networks on chips: a new SoC paradigm. Computer 35(1), 70–78 (2002)

    Article  Google Scholar 

  8. Peng, J., Xu, G.: Average path length for Sierpinski pentagon. Int. J. Adv. Comput. Technol. (2011)

    Google Scholar 

  9. Parhami, B., Yeh, C.H.: Why network diameter is still important (2000)

    Google Scholar 

  10. Imase, M., Itoh, M.: Design to minimize diameter on building-block network. IEEE Trans. Comput. C–30(6), 439–442 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Public Policy and Administration, Center for Administration Complexity Science, Xi’an Jiaotong University, Xi’an, 710049, China

    Haifeng Du, Jingjing Wang, Xiaochen He & Wei Du

Authors
  1. Haifeng Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jingjing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaochen He
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wei Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Haifeng Du .

Editor information

Editors and Affiliations

  1. Xidian University, Xi’an, China

    Maoguo Gong

  2. Huazhong University of Science and Technology, Wuhan, China

    Linqiang Pan

  3. China University of Petroleum, Qingdao, China

    Tao Song

  4. Faculty of Engineering, Computing and Science, Swinburne University of Technology Sarawak Campus, Kuching, China

    Gexiang Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Du, H., Wang, J., He, X., Du, W. (2016). Exploration of the Critical Diameter in Networks. In: Gong, M., Pan, L., Song, T., Zhang, G. (eds) Bio-inspired Computing – Theories and Applications. BIC-TA 2016. Communications in Computer and Information Science, vol 681. Springer, Singapore. https://doi.org/10.1007/978-981-10-3611-8_35

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3611-8_35

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3610-1

  • Online ISBN: 978-981-10-3611-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation