IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v450y2016icp682-686.html
   My bibliography  Save this article

A method of characterizing network topology based on the breadth-first search tree

Author

Listed:
  • Zhou, Bin
  • He, Zhe
  • Wang, Nianxin
  • Wang, Bing-Hong

Abstract

A method based on the breadth-first search tree is proposed in this paper to characterize the hierarchical structure of network. In this method, a similarity coefficient is defined to quantitatively distinguish networks, and quantitatively measure the topology stability of the network generated by a model. The applications of the method are discussed in ER random network, WS small-world network and BA scale-free network. The method will be helpful for deeply describing network topology and provide a starting point for researching the topology similarity and isomorphism of networks.

Suggested Citation

  • Zhou, Bin & He, Zhe & Wang, Nianxin & Wang, Bing-Hong, 2016. "A method of characterizing network topology based on the breadth-first search tree," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 682-686.
    • Handle: RePEc:eee:phsmap:v:450:y:2016:i:c:p:682-686
    DOI: 10.1016/j.physa.2015.12.160
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437116000911
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2015.12.160?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    2. Chiara Orsini & Marija M. Dankulov & Pol Colomer-de-Simón & Almerima Jamakovic & Priya Mahadevan & Amin Vahdat & Kevin E. Bassler & Zoltán Toroczkai & Marián Boguñá & Guido Caldarelli & Santo Fortunat, 2015. "Quantifying randomness in real networks," Nature Communications, Nature, vol. 6(1), pages 1-10, December.
    3. Lü, Linyuan & Zhou, Tao, 2011. "Link prediction in complex networks: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(6), pages 1150-1170.
    4. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wang, Yaran & Shi, Kaiyu & Zheng, Xuejing & You, Shijun & Zhang, Huan & Zhu, Chengzhi & Li, Liang & Wei, Shen & Ding, Chao & Wang, Na, 2020. "Thermo-hydraulic coupled analysis of meshed district heating networks based on improved breadth first search method," Energy, Elsevier, vol. 205(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wei, Daijun & Deng, Xinyang & Zhang, Xiaoge & Deng, Yong & Mahadevan, Sankaran, 2013. "Identifying influential nodes in weighted networks based on evidence theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(10), pages 2564-2575.
    2. Laurienti, Paul J. & Joyce, Karen E. & Telesford, Qawi K. & Burdette, Jonathan H. & Hayasaka, Satoru, 2011. "Universal fractal scaling of self-organized networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3608-3613.
    3. L. Jarina Banu & P. Balasubramaniam, 2014. "Synchronisation of discrete-time complex networks with randomly occurring uncertainties, nonlinearities and time-delays," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(7), pages 1427-1450, July.
    4. Chen, Qinghua & Shi, Dinghua, 2004. "The modeling of scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 335(1), pages 240-248.
    5. Santiago, A. & Benito, R.M., 2008. "Connectivity degrees in the threshold preferential attachment model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(10), pages 2365-2376.
    6. Curado, Manuel & Rodriguez, Rocio & Tortosa, Leandro & Vicent, Jose F., 2022. "Anew centrality measure in dense networks based on two-way random walk betweenness," Applied Mathematics and Computation, Elsevier, vol. 412(C).
    7. Chen, Qinghua & Chen, Shenghui, 2007. "A highly clustered scale-free network evolved by random walking," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 383(2), pages 773-781.
    8. Salcedo-Sanz, S. & Cuadra, L., 2019. "Quasi scale-free geographically embedded networks over DLA-generated aggregates," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1286-1305.
    9. Ying Duan & Xiuwen Fu & Wenfeng Li & Yu Zhang & Giancarlo Fortino, 2017. "Evolution of Scale-Free Wireless Sensor Networks with Feature of Small-World Networks," Complexity, Hindawi, vol. 2017, pages 1-15, July.
    10. Gao, Cai & Wei, Daijun & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2013. "A modified evidential methodology of identifying influential nodes in weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(21), pages 5490-5500.
    11. Ikeda, N., 2007. "Network formed by traces of random walks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 379(2), pages 701-713.
    12. Ding, Jin & Lu, Yong-Zai & Chu, Jian, 2013. "Studies on controllability of directed networks with extremal optimization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(24), pages 6603-6615.
    13. Santiago, A. & Benito, R.M., 2009. "Robustness of heterogeneous complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(11), pages 2234-2242.
    14. Liu, Tao & Dimirovski, Georgi M. & Zhao, Jun, 2008. "Exponential synchronization of complex delayed dynamical networks with general topology," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(2), pages 643-652.
    15. Bian, Tian & Hu, Jiantao & Deng, Yong, 2017. "Identifying influential nodes in complex networks based on AHP," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 422-436.
    16. Eocman Lee & Jeho Lee & Jongseok Lee, 2006. "Reconsideration of the Winner-Take-All Hypothesis: Complex Networks and Local Bias," Management Science, INFORMS, vol. 52(12), pages 1838-1848, December.
    17. Li, Chunguang & Chen, Guanrong, 2004. "Synchronization in general complex dynamical networks with coupling delays," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 343(C), pages 263-278.
    18. Liu, Z.X. & Chen, Z.Q. & Yuan, Z.Z., 2007. "Pinning control of weighted general complex dynamical networks with time delay," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 375(1), pages 345-354.
    19. Wen, Guanghui & Duan, Zhisheng & Chen, Guanrong & Geng, Xianmin, 2011. "A weighted local-world evolving network model with aging nodes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(21), pages 4012-4026.
    20. Daniel Straulino & Mattie Landman & Neave O'Clery, 2020. "A bi-directional approach to comparing the modular structure of networks," Papers 2010.06568, arXiv.org.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:450:y:2016:i:c:p:682-686. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.