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

Empirical comparison of network sampling: How to choose the most appropriate method?

Author

Listed:
  • Blagus, Neli
  • Šubelj, Lovro
  • Bajec, Marko

Abstract

In the past few years, the storage and the analysis of large-scale and fast evolving networks presents a great challenge. Therefore, a number of different techniques have been proposed for sampling large networks. Studies on network sampling primarily analyze the changes of network properties under the sampling. In general, network exploration techniques approximate the original networks more accurate than random node and link selection. Yet, link selection with additional subgraph induction step outperforms most other techniques. In this paper, we apply subgraph induction also to random walk and forest-fire sampling and evaluate the effects of subgraph induction on the sampling accuracy. We analyze different real-world networks and the changes of their properties introduced by sampling. The results reveal that the techniques with subgraph induction improve the performance of techniques without induction and create denser sample networks with larger average degree. Furthermore, the accuracy of sampling decrease consistently across various sampling techniques, when the sampled networks are smaller. Based on the results of the comparison, we introduce the scheme for selecting the most appropriate technique for network sampling. Overall, the breadth-first exploration sampling proves as the best performing technique.

Suggested Citation

  • Blagus, Neli & Šubelj, Lovro & Bajec, Marko, 2017. "Empirical comparison of network sampling: How to choose the most appropriate method?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 477(C), pages 136-148.
    • Handle: RePEc:eee:phsmap:v:477:y:2017:i:c:p:136-148
    DOI: 10.1016/j.physa.2017.02.048
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437117301681
    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.2017.02.048?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. 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.
    2. 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.
    3. Blagus, Neli & Šubelj, Lovro & Bajec, Marko, 2014. "Assessing the effectiveness of real-world network simplification," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 413(C), pages 134-146.
    4. Blagus, Neli & Šubelj, Lovro & Weiss, Gregor & Bajec, Marko, 2015. "Sampling promotes community structure in social and information networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 432(C), pages 206-215.
    Full references (including those not matched with items on IDEAS)

    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. Wang, Jing & Ma, Xiao-Jing & Xiang, Bing-Bing & Bao, Zhong-Kui & Zhang, Hai-Feng, 2022. "Maximizing influence in social networks by distinguishing the roles of seeds," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 604(C).
    2. Karimi, Fatemeh & Lotfi, Shahriar & Izadkhah, Habib, 2021. "Community-guided link prediction in multiplex networks," Journal of Informetrics, Elsevier, vol. 15(4).
    3. Chen, Ling-Jiao & Zhang, Zi-Ke & Liu, Jin-Hu & Gao, Jian & Zhou, Tao, 2017. "A vertex similarity index for better personalized recommendation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 607-615.
    4. Jiang, Lincheng & Zhao, Xiang & Ge, Bin & Xiao, Weidong & Ruan, Yirun, 2019. "An efficient algorithm for mining a set of influential spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 58-65.
    5. Dong-Rui Chen & Chuang Liu & Yi-Cheng Zhang & Zi-Ke Zhang, 2019. "Predicting Financial Extremes Based on Weighted Visual Graph of Major Stock Indices," Complexity, Hindawi, vol. 2019, pages 1-17, October.
    6. 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.
    7. 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.
    8. Xu, Hua & Wang, Minggang & Jiang, Shumin & Yang, Weiguo, 2020. "Carbon price forecasting with complex network and extreme learning machine," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    9. Andreas Spitz & Anna Gimmler & Thorsten Stoeck & Katharina Anna Zweig & Emőke-Ágnes Horvát, 2016. "Assessing Low-Intensity Relationships in Complex Networks," PLOS ONE, Public Library of Science, vol. 11(4), pages 1-17, April.
    10. Liu, Chuang & Zhou, Wei-Xing, 2012. "Heterogeneity in initial resource configurations improves a network-based hybrid recommendation algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(22), pages 5704-5711.
    11. Shenshen Bai & Longjie Li & Jianjun Cheng & Shijin Xu & Xiaoyun Chen, 2018. "Predicting Missing Links Based on a New Triangle Structure," Complexity, Hindawi, vol. 2018, pages 1-11, December.
    12. Bowen Yan & Steve Gregory, 2013. "Identifying Communities and Key Vertices by Reconstructing Networks from Samples," PLOS ONE, Public Library of Science, vol. 8(4), pages 1-14, April.
    13. Zhang, Rong & Ashuri, Baabak & Shyr, Yu & Deng, Yong, 2018. "Forecasting Construction Cost Index based on visibility graph: A network approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 493(C), pages 239-252.
    14. Xia, Yongxiang & Pang, Wenbo & Zhang, Xuejun, 2021. "Mining relationships between performance of link prediction algorithms and network structure," Chaos, Solitons & Fractals, Elsevier, vol. 153(P2).
    15. Zhou, Ming-Yang & Xiong, Wen-Man & Wu, Xiang-Yang & Zhang, Yu-Xia & Liao, Hao, 2018. "Overlapping influence inspires the selection of multiple spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 508(C), pages 76-83.
    16. Qiaoran Yang & Zhiliang Dong & Yichi Zhang & Man Li & Ziyi Liang & Chao Ding, 2021. "Who Will Establish New Trade Relations? Looking for Potential Relationship in International Nickel Trade," Sustainability, MDPI, vol. 13(21), pages 1-15, October.
    17. Weihua Lei & Luiz G. A. Alves & Luís A. Nunes Amaral, 2022. "Forecasting the evolution of fast-changing transportation networks using machine learning," Nature Communications, Nature, vol. 13(1), pages 1-12, December.
    18. Aslan, Serpil & Kaya, Buket & Kaya, Mehmet, 2019. "Predicting potential links by using strengthened projections in evolving bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 525(C), pages 998-1011.
    19. Leto Peel & Tiago P. Peixoto & Manlio De Domenico, 2022. "Statistical inference links data and theory in network science," Nature Communications, Nature, vol. 13(1), pages 1-15, December.
    20. Rafiee, Samira & Salavati, Chiman & Abdollahpouri, Alireza, 2020. "CNDP: Link prediction based on common neighbors degree penalization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).

    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:477:y:2017:i:c:p:136-148. 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.