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

A new method to construct co-author networks

Author

Listed:
  • Liu, Jie
  • Li, Yunpeng
  • Ruan, Zichan
  • Fu, Guangyuan
  • Chen, Xiaowu
  • Sadiq, Rehan
  • Deng, Yong

Abstract

In this paper, we propose a new method to evaluate the importance of nodes in a given network. The proposed method is based on the PageRank algorithm. However, we have made necessary improvements to combine the importance of the node itself and that of its community status. First, we propose an improved method to better evaluate the real impact of a paper. The proposed method calibrates the real influence of a paper over time. Then we propose a scheme of evaluating the contribution of each author in a paper. We later develop a new method to combine the information of the author itself and the structure of the co-author network. We use the number of co-authorship to calculate the effective distance between two authors, and evaluate the strength of their influence to each other with the law of gravity. The strength of influence is used to build a new network of authors, which is a comprehensive topological representation of both the quality of the node and its role in network. Finally, we apply our method to the Erdos co-author community and AMiner Citation Network to identify the most influential authors.

Suggested Citation

  • Liu, Jie & Li, Yunpeng & Ruan, Zichan & Fu, Guangyuan & Chen, Xiaowu & Sadiq, Rehan & Deng, Yong, 2015. "A new method to construct co-author networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 29-39.
    • Handle: RePEc:eee:phsmap:v:419:y:2015:i:c:p:29-39
    DOI: 10.1016/j.physa.2014.10.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437114008449
    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.2014.10.006?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. 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.
    2. Abbasi, Alireza & Hossain, Liaquat & Leydesdorff, Loet, 2012. "Betweenness centrality as a driver of preferential attachment in the evolution of research collaboration networks," Journal of Informetrics, Elsevier, vol. 6(3), pages 403-412.
    3. Hou, Bonan & Yao, Yiping & Liao, Dongsheng, 2012. "Identifying all-around nodes for spreading dynamics in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(15), pages 4012-4017.
    4. Cai Gao & Xin Lan & Xiaoge Zhang & Yong Deng, 2013. "A Bio-Inspired Methodology of Identifying Influential Nodes in Complex Networks," PLOS ONE, Public Library of Science, vol. 8(6), pages 1-11, June.
    5. Liu, Jian-Guo & Ren, Zhuo-Ming & Guo, Qiang, 2013. "Ranking the spreading influence in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(18), pages 4154-4159.
    6. Xuan Zhen Liu & Hui Fang, 2012. "Fairly sharing the credit of multi-authored papers and its application in the modification of h-index and g-index," Scientometrics, Springer;Akadémiai Kiadó, vol. 91(1), pages 37-49, April.
    7. Chen, Duanbing & Lü, Linyuan & Shang, Ming-Sheng & Zhang, Yi-Cheng & Zhou, Tao, 2012. "Identifying influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1777-1787.
    8. Chen, P. & Xie, H. & Maslov, S. & Redner, S., 2007. "Finding scientific gems with Google’s PageRank algorithm," Journal of Informetrics, Elsevier, vol. 1(1), pages 8-15.
    9. Nils T. Hagen, 2010. "Harmonic publication and citation counting: sharing authorship credit equitably – not equally, geometrically or arithmetically," Scientometrics, Springer;Akadémiai Kiadó, vol. 84(3), pages 785-793, September.
    10. 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.
    11. Stephen P. Borgatti, 2006. "Identifying sets of key players in a social network," Computational and Mathematical Organization Theory, Springer, vol. 12(1), pages 21-34, April.
    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. Park, Alex & Lappas, Petros, 2017. "Evaluating demand charge reduction for commercial-scale solar PV coupled with battery storage," Renewable Energy, Elsevier, vol. 108(C), pages 523-532.
    2. Ricardo Lopes Andrade & Maísa Mendonça Silva & Leandro Chaves Rêgo, 2023. "A Scientometric and Social Network Analysis of the Literature on the Graph Model for Conflict Resolution," Group Decision and Negotiation, Springer, vol. 32(5), pages 1061-1082, October.
    3. Sheikhahmadi, Amir & Nematbakhsh, Mohammad Ali & Shokrollahi, Arman, 2015. "Improving detection of influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 833-845.
    4. Jun Zhang & Zhaolong Ning & Xiaomei Bai & Xiangjie Kong & Jinmeng Zhou & Feng Xia, 2017. "Exploring time factors in measuring the scientific impact of scholars," Scientometrics, Springer;Akadémiai Kiadó, vol. 112(3), pages 1301-1321, September.
    5. Hu, Jiantao & Du, Yuxian & Mo, Hongming & Wei, Daijun & Deng, Yong, 2016. "A modified weighted TOPSIS to identify influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 73-85.
    6. Noémi Gaskó & Rodica Ioana Lung & Mihai Alexandru Suciu, 2016. "A new network model for the study of scientific collaborations: Romanian computer science and mathematics co-authorship networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 108(2), pages 613-632, August.
    7. 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.

    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, Bo & Liu, Jie & Wei, Daijun & Gao, Cai & Deng, Yong, 2015. "Weighted k-shell decomposition for complex networks based on potential edge weights," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 420(C), pages 277-283.
    2. Hu, Jiantao & Du, Yuxian & Mo, Hongming & Wei, Daijun & Deng, Yong, 2016. "A modified weighted TOPSIS to identify influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 73-85.
    3. Du, Yuxian & Gao, Cai & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2014. "A new method of identifying influential nodes in complex networks based on TOPSIS," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 399(C), pages 57-69.
    4. Zhu, Hengmin & Yin, Xicheng & Ma, Jing & Hu, Wei, 2016. "Identifying the main paths of information diffusion in online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 320-328.
    5. 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.
    6. Ni, Chengzhang & Yang, Jun & Kong, Demei, 2020. "Sequential seeding strategy for social influence diffusion with improved entropy-based centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    7. Mahyar, Hamidreza & Hasheminezhad, Rouzbeh & Ghalebi K., Elahe & Nazemian, Ali & Grosu, Radu & Movaghar, Ali & Rabiee, Hamid R., 2018. "Compressive sensing of high betweenness centrality nodes in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 497(C), pages 166-184.
    8. Liu, Jun & Xiong, Qingyu & Shi, Weiren & Shi, Xin & Wang, Kai, 2016. "Evaluating the importance of nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 209-219.
    9. Gao, Shuai & Ma, Jun & Chen, Zhumin & Wang, Guanghui & Xing, Changming, 2014. "Ranking the spreading ability of nodes in complex networks based on local structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 403(C), pages 130-147.
    10. Zhai, Li & Yan, Xiangbin, 2022. "A directed collaboration network for exploring the order of scientific collaboration," Journal of Informetrics, Elsevier, vol. 16(4).
    11. Wang, Zhixiao & Zhao, Ya & Xi, Jingke & Du, Changjiang, 2016. "Fast ranking influential nodes in complex networks using a k-shell iteration factor," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 171-181.
    12. Huang, Wencheng & Li, Haoran & Yin, Yanhui & Zhang, Zhi & Xie, Anhao & Zhang, Yin & Cheng, Guo, 2024. "Node importance identification of unweighted urban rail transit network: An Adjacency Information Entropy based approach," Reliability Engineering and System Safety, Elsevier, vol. 242(C).
    13. Sheikhahmadi, Amir & Nematbakhsh, Mohammad Ali & Zareie, Ahmad, 2017. "Identification of influential users by neighbors in online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 517-534.
    14. Wu, Yanlei & Yang, Yang & Jiang, Fei & Jin, Shuyuan & Xu, Jin, 2014. "Coritivity-based influence maximization in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 416(C), pages 467-480.
    15. Yeruva, Sujatha & Devi, T. & Reddy, Y. Samtha, 2016. "Selection of influential spreaders in complex networks using Pareto Shell decomposition," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 133-144.
    16. 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.
    17. Singh, Priti & Chakraborty, Abhishek & Manoj, B.S., 2017. "Link Influence Entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 701-713.
    18. Ma, Ling-ling & Ma, Chuang & Zhang, Hai-Feng & Wang, Bing-Hong, 2016. "Identifying influential spreaders in complex networks based on gravity formula," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 451(C), pages 205-212.
    19. Liu, Yang & Wei, Bo & Du, Yuxian & Xiao, Fuyuan & Deng, Yong, 2016. "Identifying influential spreaders by weight degree centrality in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 86(C), pages 1-7.
    20. Sheikhahmadi, Amir & Nematbakhsh, Mohammad Ali & Shokrollahi, Arman, 2015. "Improving detection of influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 833-845.

    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:419:y:2015:i:c:p:29-39. 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.