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

Automatic generation of adaptive network models based on similarity to the desired complex network

Author

Listed:
  • Attar, Niousha
  • Aliakbary, Sadegh
  • Nezhad, Zahra Hosseini

Abstract

Complex networks have become powerful mechanisms for studying a variety of real-world systems. Consequently, many human-designed network models are proposed that reproduce nontrivial properties of complex networks, such as long-tail degree distribution or high clustering coefficient. Therefore, we may utilize network models in order to generate graphs similar to desired networks. However, a desired network structure may deviate from emerging structure of any generative model, because no selected single model may support all the needed properties of the target graph and instead, each network model reflects a subset of the required features. In contrast to the classical approach of network modeling, an appropriate modern network model should adapt the desired features of the target network. In this paper, we propose an automatic approach for constructing network models that are adaptive to the desired network features. We employ Genetic Algorithms in order to evolve network models based on the characteristics of the target networks. The experimental evaluations show that our proposed framework, called NetMix, results network models that outperform state-of-the-art baseline models according to the compliance with the desired features of the target networks.

Suggested Citation

  • Attar, Niousha & Aliakbary, Sadegh & Nezhad, Zahra Hosseini, 2020. "Automatic generation of adaptive network models based on similarity to the desired complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
  • Handle: RePEc:eee:phsmap:v:545:y:2020:i:c:s037843711931876x
    DOI: 10.1016/j.physa.2019.123353
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843711931876X
    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.123353?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. 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.
    2. Seierstad, Cathrine & Opsahl, Tore, 2011. "For the few not the many? The effects of affirmative action on presence, prominence, and social capital of women directors in Norway," Scandinavian Journal of Management, Elsevier, vol. 27(1), pages 44-54, March.
    3. Aliakbary, Sadegh & Motallebi, Sadegh & Rashidian, Sina & Habibi, Jafar & Movaghar, Ali, 2015. "Noise-tolerant model selection and parameter estimation for complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 427(C), pages 100-112.
    4. Pablo M. Gleiser & Leon Danon, 2003. "Community Structure In Jazz," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 6(04), pages 565-573.
    5. Volchenkov, D & Blanchard, Ph, 2002. "An algorithm generating random graphs with power law degree distributions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 315(3), pages 677-690.
    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. Fanshun Zhang & Congdong Li & Cejun Cao & Zhiwei Zhang, 2022. "Random or preferential? Evolutionary mechanism of user behavior in co-creation community," Computational and Mathematical Organization Theory, Springer, vol. 28(2), pages 141-177, June.

    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. Natarajan Meghanathan, 2019. "Unit Disk Graph-Based Node Similarity Index for Complex Network Analysis," Complexity, Hindawi, vol. 2019, pages 1-22, March.
    2. Zhang, Wen-Yao & Wei, Zong-Wen & Wang, Bing-Hong & Han, Xiao-Pu, 2016. "Measuring mixing patterns in complex networks by Spearman rank correlation coefficient," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 451(C), pages 440-450.
    3. Zhang, Yun & Liu, Yongguo & Li, Jieting & Zhu, Jiajing & Yang, Changhong & Yang, Wen & Wen, Chuanbiao, 2020. "WOCDA: A whale optimization based community detection algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    4. Rezvanian, Alireza & Meybodi, Mohammad Reza, 2015. "Sampling social networks using shortest paths," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 424(C), pages 254-268.
    5. Joanna Tyrowicz & Siri Terjesen & Jakub Mazurek, 2017. "All on board? New evidence on board gender diversity from a large panel of firms," GRAPE Working Papers 5, GRAPE Group for Research in Applied Economics.
    6. Kong, Hanzhang & Kang, Qinma & Li, Wenquan & Liu, Chao & Kang, Yunfan & He, Hong, 2019. "A hybrid iterated carousel greedy algorithm for community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    7. Yuan, Quan & Liu, Binghui, 2021. "Community detection via an efficient nonconvex optimization approach based on modularity," Computational Statistics & Data Analysis, Elsevier, vol. 157(C).
    8. Xinyu Huang & Dongming Chen & Dongqi Wang & Tao Ren, 2020. "MINE: Identifying Top- k Vital Nodes in Complex Networks via Maximum Influential Neighbors Expansion," Mathematics, MDPI, vol. 8(9), pages 1-25, August.
    9. Antoine Rebérioux & Gwenaël Roudaut, 2016. "Gender Quota inside the Boardroom: Female Directors as New Key Players?," Working Papers hal-01297884, HAL.
    10. Fatemi, Samira & Salehi, Mostafa & Veisi, Hadi & Jalili, Mahdi, 2018. "A fuzzy logic based estimator for respondent driven sampling of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 42-51.
    11. Zhao, Shuying & Sun, Shaowei, 2023. "Identification of node centrality based on Laplacian energy of networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    12. Alice Klettner & Thomas Clarke & Martijn Boersma, 2016. "Strategic and Regulatory Approaches to Increasing Women in Leadership: Multilevel Targets and Mandatory Quotas as Levers for Cultural Change," Journal of Business Ethics, Springer, vol. 133(3), pages 395-419, February.
    13. Carl Åberg & Mariateresa Torchia, 2020. "Do boards of directors foster strategic change? A dynamic managerial capabilities perspective," Journal of Management & Governance, Springer;Accademia Italiana di Economia Aziendale (AIDEA), vol. 24(3), pages 655-684, September.
    14. Zhe Li & Xinyu Huang, 2023. "Identifying Influential Spreaders Using Local Information," Mathematics, MDPI, vol. 11(6), pages 1-14, March.
    15. Réal Labelle & Claude Francoeur & Faten Lakhal, 2015. "To Regulate Or Not To Regulate? Early Evidence on the Means Used Around the World to Promote Gender Diversity in the Boardroom," Gender, Work and Organization, Wiley Blackwell, vol. 22(4), pages 339-363, July.
    16. Chiara Pronzato & Paola Profeta & Valeria Ferraro & Giulia Ferrari, 2016. "Gender Quotas: Challenging the Boards, Performance, and the Stock Market," Working Papers id:11411, eSocialSciences.
    17. Liu, X. & Murata, T., 2010. "Advanced modularity-specialized label propagation algorithm for detecting communities in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(7), pages 1493-1500.
    18. Etienne Côme & Nicolas Jouvin & Pierre Latouche & Charles Bouveyron, 2021. "Hierarchical clustering with discrete latent variable models and the integrated classification likelihood," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 15(4), pages 957-986, December.
    19. Li, Hanwen & Shang, Qiuyan & Deng, Yong, 2021. "A generalized gravity model for influential spreaders identification in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 143(C).
    20. Namtirtha, Amrita & Dutta, Animesh & Dutta, Biswanath, 2018. "Identifying influential spreaders in complex networks based on kshell hybrid method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 499(C), pages 310-324.

    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:s037843711931876x. 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.