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

Solving the speed and accuracy of box-covering problem in complex networks

Author

Listed:
  • Liao, Hao
  • Wu, Xingtong
  • Wang, Bing-Hong
  • Wu, Xiangyang
  • Zhou, Mingyang

Abstract

The box-covering method that covers a network with a minimum number of boxes is critical to demonstrate network fractals and the re-normalization analysis of complex networks. Moreover, one is able to investigate the network structure by analyzing the re-normalization flow or categorizing networks into several universal classes. A number of compelling methods are not well adapted to the large-scale networks due to high time complexity, or low accuracy. In this paper, we introduce a hybrid method that has high accuracy and low time consumption based the maximum-excluded-mass-burning (MEMB) method and the random sequential (RS) method. Our method combines the characteristics of the MEMB method that search as fewer boxes as possible with the high efficiency of the RS method by selecting a few unimportant central nodes, especially for large-scale networks. We also optimize the storage mechanism of the method so that the excluded mass of nodes can be updated efficiently. Experiments in the real networks with different structures demonstrate that the improvement of our method can be substantial. Our method reduces the time consumption of the MEMB method by more than 40% with only 10% more boxes than the MEMB method.

Suggested Citation

  • Liao, Hao & Wu, Xingtong & Wang, Bing-Hong & Wu, Xiangyang & Zhou, Mingyang, 2019. "Solving the speed and accuracy of box-covering problem in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 954-963.
    • Handle: RePEc:eee:phsmap:v:523:y:2019:i:c:p:954-963
    DOI: 10.1016/j.physa.2019.04.242
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437119306156
    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.2019.04.242?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. Andre A. Moreira & Jose S. Andrade Jr. & Hans J. Herrmann & Joseph O. Indekeu, "undated". "How to make a fragile network robust and vice versa," Working Papers CCSS-09-001, ETH Zurich, Chair of Systems Design.
    2. van Beers, Wim C.M. & Kleijnen, Jack P.C., 2008. "Customized sequential designs for random simulation experiments: Kriging metamodeling and bootstrapping," European Journal of Operational Research, Elsevier, vol. 186(3), pages 1099-1113, May.
    3. Zhou, Wei-Xing & Jiang, Zhi-Qiang & Sornette, Didier, 2007. "Exploring self-similarity of complex cellular networks: The edge-covering method with simulated annealing and log-periodic sampling," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 375(2), pages 741-752.
    4. Chaoming Song & Shlomo Havlin & Hernán A. Makse, 2005. "Self-similarity of complex networks," Nature, Nature, vol. 433(7024), pages 392-395, January.
    5. Réka Albert & Hawoong Jeong & Albert-László Barabási, 1999. "Diameter of the World-Wide Web," Nature, Nature, vol. 401(6749), pages 130-131, September.
    6. Wolsey, L.A., 1982. "An analysis of the greedy algorithm for the submodular set covering problem," LIDAM Reprints CORE 519, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Pavón-Domínguez, Pablo & Moreno-Pulido, Soledad, 2022. "Sandbox fixed-mass algorithm for multifractal unweighted complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 156(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. Blagus, Neli & Šubelj, Lovro & Bajec, Marko, 2012. "Self-similar scaling of density in complex real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2794-2802.
    2. Havlin, Shlomo & Stanley, H. Eugene & Bashan, Amir & Gao, Jianxi & Kenett, Dror Y., 2015. "Percolation of interdependent network of networks," Chaos, Solitons & Fractals, Elsevier, vol. 72(C), pages 4-19.
    3. Duan, Shuyu & Wen, Tao & Jiang, Wen, 2019. "A new information dimension of complex network based on Rényi entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 529-542.
    4. Xie, Wen-Jie & Zhou, Wei-Xing, 2011. "Horizontal visibility graphs transformed from fractional Brownian motions: Topological properties versus the Hurst index," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3592-3601.
    5. Zeng, Zhi-Jian & Xie, Chi & Yan, Xin-Guo & Hu, Jue & Mao, Zhou, 2016. "Are stock market networks non-fractal? Evidence from New York Stock Exchange," Finance Research Letters, Elsevier, vol. 17(C), pages 97-102.
    6. Liu, Chuang & Zhou, Wei-Xing & Yuan, Wei-Kang, 2010. "Statistical properties of visibility graph of energy dissipation rates in three-dimensional fully developed turbulence," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(13), pages 2675-2681.
    7. Shen, Yi & Pei, Wenjiang & Wang, Kai & Li, Tao & Wang, Shaoping, 2008. "Recursive filtration method for detecting community structure in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(26), pages 6663-6670.
    8. Pierpaolo Andriani & Bill McKelvey, 2007. "Beyond Gaussian averages: redirecting international business and management research toward extreme events and power laws," Journal of International Business Studies, Palgrave Macmillan;Academy of International Business, vol. 38(7), pages 1212-1230, December.
    9. B. Zhang & J. Wang & W. Zhang & G. C. Wang, 2020. "Nonlinear Scaling Behavior of Visible Volatility Duration for Financial Statistical Physics Dynamics," Computational Economics, Springer;Society for Computational Economics, vol. 56(2), pages 373-389, August.
    10. Zhou, Yuan-Wu & Liu, Jin-Long & Yu, Zu-Guo & Zhao, Zhi-Qin & Anh, Vo, 2014. "Fractal and complex network analyses of protein molecular dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 416(C), pages 21-32.
    11. Ikeda, Nobutoshi, 2019. "Growth model for fractal scale-free networks generated by a random walk," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 424-434.
    12. Beiró, Mariano G. & Busch, Jorge R. & Grynberg, Sebastian P. & Alvarez-Hamelin, J. Ignacio, 2013. "Obtaining communities with a fitness growth process," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(9), pages 2278-2293.
    13. Ikeda, Nobutoshi, 2021. "Stratified structure of fractal scale-free networks generated by local rules," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 583(C).
    14. Chen, Jin & Le, Anbo & Wang, Qin & Xi, Lifeng, 2016. "A small-world and scale-free network generated by Sierpinski Pentagon," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 449(C), pages 126-135.
    15. Pavón-Domínguez, Pablo & Moreno-Pulido, Soledad, 2020. "A Fixed-Mass multifractal approach for unweighted complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 541(C).
    16. Yonghong Jin & Qi Zhang & Lifei Shan & Sai-Ping Li, 2015. "Characteristics of Venture Capital Network and Its Correlation with Regional Economy: Evidence from China," PLOS ONE, Public Library of Science, vol. 10(9), pages 1-20, September.
    17. Carletti, Timoteo & Righi, Simone, 2010. "Weighted Fractal Networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(10), pages 2134-2142.
    18. Nie, Chun-Xiao & Song, Fu-Tie, 2018. "Analyzing the stock market based on the structure of kNN network," Chaos, Solitons & Fractals, Elsevier, vol. 113(C), pages 148-159.
    19. Mohd-Zaid, Fairul & Kabban, Christine M. Schubert & Deckro, Richard F. & White, Edward D., 2017. "Parameter specification for the degree distribution of simulated Barabási–Albert graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 141-152.
    20. He, He & Yang, Bo & Hu, Xiaoming, 2016. "Exploring community structure in networks by consensus dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 342-353.

    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:523:y:2019:i:c:p:954-963. 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.