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

An evolving network model with information filtering and mixed attachment mechanisms

Author

Listed:
  • Huang, Xikun
  • Lu, Ruqian

Abstract

In this paper, we propose an evolving network model with information filtering and mixed attachment mechanisms. We theoretically analyze the in-degree distribution of networks generated by the proposed model in two special cases, and prove that the in-degree distribution is power-law if the new coming vertex does not filter information. Otherwise, the in-degree distribution becomes complex which has a transition between exponential and power-law scaling. Numerical simulations are consistent with analytical results. In addition, we analyze how model parameters influence the topology of the network by means of numerical simulations, and compare values of various measures of networks generated by the proposed model with that of networks generated by uniform attachment model, Barabási–Albert model and copying model. It shows that our model can generate networks with more diverse topological features.

Suggested Citation

  • Huang, Xikun & Lu, Ruqian, 2020. "An evolving network model with information filtering and mixed attachment mechanisms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
  • Handle: RePEc:eee:phsmap:v:545:y:2020:i:c:s0378437119319107
    DOI: 10.1016/j.physa.2019.123421
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437119319107
    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.123421?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. Dorogovtsev, S.N. & Mendes, J.F.F., 2003. "Evolution of Networks: From Biological Nets to the Internet and WWW," OUP Catalogue, Oxford University Press, number 9780198515906.
    2. 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.
    3. Timoteo Carletti & Floriana Gargiulo & Renaud Lambiotte, 2015. "Preferential attachment with partial information," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 88(1), pages 1-5, January.
    4. A. Santiago & R. M. Benito, 2010. "Kernel nonlinearity in heterogeneous evolving networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 76(4), pages 557-564, August.
    5. 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.
    6. Shao, Zhi-Gang & Chen, Tao & Ai, Bao-quan, 2014. "Growing networks with temporal effect and mixed attachment mechanisms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 413(C), pages 147-152.
    7. Li, Xiang & Chen, Guanrong, 2003. "A local-world evolving network model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 328(1), pages 274-286.
    8. Pandey, Pradumn Kumar & Adhikari, Bibhas, 2015. "Context dependent preferential attachment model for complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 499-508.
    9. Štefančić, Hrvoje & Zlatić, Vinko, 2005. "Preferential attachment with information filtering—node degree probability distribution properties," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 350(2), pages 657-670.
    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. 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.
    2. Zhu, Hailin & Luo, Hong & Peng, Haipeng & Li, Lixiang & Luo, Qun, 2009. "Complex networks-based energy-efficient evolution model for wireless sensor networks," Chaos, Solitons & Fractals, Elsevier, vol. 41(4), pages 1828-1835.
    3. Luo, Xiaojuan & Hu, Yuhen & Zhu, Yu, 2014. "Topology evolution model for wireless multi-hop network based on socially inspired mechanism," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 416(C), pages 639-650.
    4. Chen, Hailiang & Chen, Bin & Ai, Chuan & Zhu, Mengna & Qiu, Xiaogang, 2022. "The evolving network model with community size and distance preferences," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 596(C).
    5. Pi, Xiaochen & Tang, Longkun & Chen, Xiangzhong, 2021. "A directed weighted scale-free network model with an adaptive evolution mechanism," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 572(C).
    6. 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.
    7. Dávid Csercsik & Sándor Imre, 2017. "Cooperation and coalitional stability in decentralized wireless networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 64(4), pages 571-584, April.
    8. Chung-Yuan Huang & Chuen-Tsai Sun & Hsun-Cheng Lin, 2005. "Influence of Local Information on Social Simulations in Small-World Network Models," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 8(4), pages 1-8.
    9. 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.
    10. 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.
    11. Yilmaz, Ergin, 2014. "Impacts of hybrid synapses on the noise-delayed decay in scale-free neural networks," Chaos, Solitons & Fractals, Elsevier, vol. 66(C), pages 1-8.
    12. Pongou, Roland & Tchuente, Guy & Tondji, Jean-Baptiste, 2021. "Optimally Targeting Interventions in Networks during a Pandemic: Theory and Evidence from the Networks of Nursing Homes in the United States," GLO Discussion Paper Series 957, Global Labor Organization (GLO).
    13. Zhang, Zhongzhi & Rong, Lili & Comellas, Francesc, 2006. "High-dimensional random Apollonian networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 364(C), pages 610-618.
    14. Hellmann, Tim & Staudigl, Mathias, 2014. "Evolution of social networks," European Journal of Operational Research, Elsevier, vol. 234(3), pages 583-596.
    15. Huang, Wei & Chen, Shengyong & Wang, Wanliang, 2014. "Navigation in spatial networks: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 132-154.
    16. Rendón de la Torre, Stephanie & Kalda, Jaan & Kitt, Robert & Engelbrecht, Jüri, 2016. "On the topologic structure of economic complex networks: Empirical evidence from large scale payment network of Estonia," Chaos, Solitons & Fractals, Elsevier, vol. 90(C), pages 18-27.
    17. Kashin Sugishita & Yasuo Asakura, 2021. "Vulnerability studies in the fields of transportation and complex networks: a citation network analysis," Public Transport, Springer, vol. 13(1), pages 1-34, March.
    18. Zheng, Xiaolong & Zeng, Daniel & Li, Huiqian & Wang, Feiyue, 2008. "Analyzing open-source software systems as complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(24), pages 6190-6200.
    19. Heath Henderson & Arnob Alam, 2022. "The structure of risk-sharing networks," Empirical Economics, Springer, vol. 62(2), pages 853-886, February.
    20. Matthew O. Jackson & Brian W. Rogers, 2005. "Search in the Formation of Large Networks: How Random are Socially Generated Networks?," Game Theory and Information 0503005, University Library of Munich, Germany.

    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:545:y:2020:i:c:s0378437119319107. 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.