Using Networks to Measure Influence and Impact

Article Preview

Abstract:

The co-author networks are important type of social network. In this paper, we establishes the Erdös co-author network and proves that the Erdös co-author network is a complex network which has three main properties, including small world, scale-free and clustering properties. Besides, this article gives the calculation formulas for degree centrality, closeness centrality and betweenness centrality of a network. According to the calculation result we give a ranking order for authors within Erdös co-author network.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2668-2671

Citation:

Online since:

May 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] https: /files. oakland. edu/users/grossman/enp/Erdos1. html. (2014. 2. 14).

Google Scholar

[2] Tu, Y. Centrality characteristics analysis of urban rail network. in Intelligent Rail Transportation (ICIRT), 2013 IEEE International Conference on. IEEE. (2013).

DOI: 10.1109/icirt.2013.6696309

Google Scholar

[3] Snijders, T.A., Statistical models for social networks. Annual Review of Sociology, 37: pp.131-153. (2011).

Google Scholar

[4] Ji, X. M., Li, C. L., and Xu, H. Y., Research on Citation Network Analysis Based on Power Index. Library and Information Service, 24: pp.111-115. (2009).

Google Scholar

[5] Wen-jun, S. and J. Ai-xian. The collaboration network in China's management science. in Management Science and Engineering, ICMSE IEEE. (2009).

Google Scholar

[6] Qu, B. Q., Research cooperation behavior and reflection of internet academic forums—take emuch as example. Science and Technology Management Research, 2010(010): pp.215-218.

Google Scholar

[7] Yang, G and Wang, D. Z., Science Journal Citation Complex Network Model. Computer and Digital Engineering, 2010. 1(38No): p.11.

Google Scholar

[8] Ma, H., S. Chen, and D. Wang. Research of PageRank Algorithm Based on Transition Probability. In Web Information Systems and Mining (WISM), 2010 International Conference on. 2010. IEEE.

DOI: 10.1109/wism.2010.63

Google Scholar