An Analysis of Email-Eu-Core Network

A. Bharali¹

Section:Research Paper, Product Type: Isroset-Journal
Vol.5 , Issue.4 , pp.100-104, Aug-2018

CrossRef-DOI:   https://doi.org/10.26438/ijsrmss/v5i4.100104

Online published on Aug 31, 2018

Copyright © A. Bharali . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

1359 Views    519 Downloads    159 Downloads

Abstract :
In this paper a complex network approach is adopted to analyze the Email-Eu-Core Network. This communication network displays small-world (SW) properties with an average path length of 2.0834 and a clustering coefficient of 0.372, and it also exhibits assortative mixing on degree of nodes, that means the high-degree nodes in the network tend to have connections with high-degree nodes. Being an assortative network, it does percolate more easily but less robust to targeted node removal. A study of the robustness of Email-Eu-Core network is also carried out for random and targeted node failures.

Key-Words / Index Term :
Network measures, Complex Network, Email-Eu Network, Small-world, Assortative mixing, Scale-free Network.

References :
[1] Albert, R., Jeong, H., & Barabasi, A., (2000) Error and attack tolerance of complex networks. Nature, 406, 378-382.
[2] Barabasi A., Albert R., (1999) Emergence of Scaling in Random Networks. Science, 286, 509-512.
[3] Ellens W., et. al., (2013) Graph Measures and Network Robustness. arXiv preprint arXiv:1311.5064.
[4] Gribble, S., (2001), Robustness in complex systems. Proceedings of the 8th Workshop on Hot Topics in Operation Systems (HotOS-VIII).
[5] Faust, K., (2006) Comparing Social Networks: Size, Density, and Local Structure. Metodolo˜ski zvezki, 3(2), 185-216.
[6] Fruchterman, ThomasM. J., Reingold, EdwardM., (1991) Graph Drawing by Force-Directed
Placement. Journal of Software-Practice and Experience, 21 (11), 1129-1164.
[7] Hossain M., et. al., (2013) Australian Airport Network Robustness Analysis: A Complex Network Approach. Proceedings of Australasian Transport Research Forum, 1-21.
[8] Latora, V., et. al., (2001) Efficient Behavior of Small-World Networks. Phys. Rev. Lett., 87: 198701.
[9] Leskovec, J., Krevil, A., SNAP Datasets: Large Network Dataset Collection. http://snap.stanford.edu/data.
[10] Newman, M. E. J., (2002) Assortative mixing in networks. Phys. Rev. E, 89(20): 208701.
[11] Newman, M. E. J., (2003) Mixing patterns in networks. Phys. Rev. E, 67(2): 026126.
[12] Newman, M. E. J., (2003) The structure and function of complex networks. SIAM Rev., 45(2), 167-256.
[13] Wang, X., et. al., (2003) Complex networks: small-world, scale-free and beyond. IEEE Circuits and Systems Magazine, 3(1), 6-20.
[14] Watts, D.J., Strogatz, S.H., (1998) Collective dynamics of ’small-world’ networks. Nature, 393, 440-442.
[15] Wu, J., et. al., (2013) Analysis of Communication Network Performance From a Complex Network Perspective. IEEE Transactions on Circuits and Systems I: Regular Papers, 60(12), 3303-3316.
[16] Wu, J., (2014) Study of Communication Network Performance From A Complex Network Perspective. A Doctoral Thesis (The Hong Kong Polytechnic University), http://ira.lib.polyu.edu.hk/handle/10397/7429.
[17] Xia, J., et. al., (2008) Attack Vulnerability of Complex Communication Networks. IEEE Transactions on Circuits and Systems II: Express Briefs, 55(1), 65-69.
[18] Yin, H., et. al., (2017) Local Higher-order Graph Clustering. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.