Computer Science ›› 2018, Vol. 45 ›› Issue (6A): 283-289.

• Network & Communication • Previous Articles     Next Articles

Total Communication and Efficiency Analysis of Large Scale Networks

YAN Jia-qi,CHEN Jun-hua,LENG Jing   

  1. School of Management Science and Engineering,Central University of Finance and Economics,Beijing 100081,China
  • Online:2018-06-20 Published:2018-08-03

Abstract: The centrality measure of nodes has always been a hot topic in complex network research.This paper focused on researching the concept of total communication through the sum of the functions of the network adjacency matrix.The main research includes matrix exponent and resolution,which have natural explanations on the path of the basic graph.The research proved that they can be calculated very quickly even in the case of large networks.In addition,this paper proposed the sum of the node communication as a valid measure of the network connection,which can measure the degree of communication between each node and other nodes in the network.A comparison has been made between the centrality measure of nodes and the related methods by using virtual network data and real data.The results show that the total communication capability can be used as a measure of connectivity for the overall measure of information flow on a given network,which has broad application prospects.

Key words: Centrality, Communication, Complex network, Network analysis

CLC Number: 

  • TP393
[1]CALDARELLI G.Scale-Free Networks[M].UK:Oxford University Press,2007.<br /> [2]CROFOOT M C,RUBENSTEIN D I,MAIYA A S,et al.Aggression,grooming and group-level cooperation in white-faced capuchins (Cebus capucinus):Insights from social networks[J].Amer.J.Primatol,2011,73(8):821.<br /> [3]ESTRADA E.The Structure of Complex Networks[M].UK: Oxford University Press,2011.<br /> [4]ESTRADA E,FOX M,HIGHAM D,et al.Network Science.Complexity in Nature and Technology[M].New York:Sprin-ger,2010.<br /> [5]ESTRADA E,HATANO N,BENZI M.The physics of communicability in complex networks[J].Physics Reports,2012,514(3):89-119.<br /> [6]LANGVILLE A N,MEYER C D.Google’s PageRank and Beyond:The Science of Search Engine Rankings[M].Princeton,NJ:Princeton University Press,2006.<br /> [7]NEWMAN M E J.The structure and function of complex networks[J].SIAM Review,2003,45(2):167-256.<br /> [8]SAVAS B,DHILLON I.Clustered low rank approximation of graphs in information science appli-cations[C]∥Proceedings of the 2011 SIAM Conference on Data Mining.2011:164-175.<br /> [9]BOCCALETTI S,LATORA V,MORENO Y,et al.Complex networks:Structure and dynamics[J].Physics Reports,2006,424(4/5):175-308.<br /> [10]BONACICH P.Power and centrality:a family of measures[J].America Journal of Sociology,1987,92:1170-1182.<br /> [11]BRANDES U,ERLEBACH T.Network Analysis:Methodological Foundations,Lecture Notes in Computer Science[M].New York:Springer,2005.<br /> [12]LANGVILLE A N,MEYER C D.A survey of eigenvector methods for Web information retrieval[J].SIAM Review,2005,47(1):135-161.<br /> [13]NEWMAN M E J.Networks:An Introduction[M].UK:Cam- bridge University Press,2010:174-175.<br /> [14]NEWMAN M E J,BARABSI A L,WATTS D J.The Structure and Dynamics of Networks[M].Princeton,NJ:Princeton University Press,2003.<br /> [15]BENZI M,ESTRADA E,KLYMKO C.Ranking hubs and authorities using matrix functions[J].Linear Algebra and its Applications,2013,438(5):2447-2474.<br /> [16]KATZ L.A new status index derived from socio-metric data analysis[J].Psychometrika,1953,18(11):39-43.<br /> [17]KLEINBERG J.Authoritative sources in a hyper-linked envi- ronment[J].Journal of ACM,1999,46(5):604-632.<br /> [18]LANGVILLE A N,MEYER C D.Who’s No.1? The Science of Rating and Ranking[M].Princeton,NJ:Princeton University Press,2012.<br /> [19]LEMPEL R,MORAN S.The stochastic approach for link-struc- ture analysis (SALSA) and the TKC effect[C]∥Proceedings of the Ninth International Conference on the World Wide Web.2000:387-401.<br /> [20]ESTRADA E,RODR GUEZ-VELZQUEZ J A.Subgraph centrality in complex networks[J].Physical Review E,2005(55):56-103.<br /> [21]ESTRADA E,HIGHAM D J.Network properties revealed through matrix functions[J].SIAM Review,2010,52(4):671-696.<br /> [22]BENZI M,BOITO P.Quadrature rule-based bounds for func- tions of adjacency matrices[J].Linear Algebra and its Applications,2010,433(3):637-652.<br /> [23]HIGHAM N J.Functions of Matrices:Theory and Computation[M].Philadelphia,PA,USA:Society for Industrial and Applied Mathematics,2008.<br /> [24]ESTRADA E,HATANO N.Communicability in complex networks[J].Physical Review E,2008,77(3):036111.<br /> [25]BONACICH P,LLOYD P.Eigenvector-like measures of centra- lity for asymmetric relations[J].Social Networks,2001,23(3):191-201.<br /> [26]BORGATTI S P,EVERETT M G.A graph-theoretic perspective on centrality[J].Social Networks,2006,28(4):466-484.<br /> [27]GRINDROD P,HIGHAM D.A matrix iteration for dynamic network summaries[J].SIAM Review,2013,55(1):118-128.<br /> [28]BARABSI A L,ALBERT R.Emergence of scaling in random networks[J].Science,1999,286(5439):509-512.
[1] GUO Peng-jun, ZHANG Jing-zhou, YANG Yuan-fan, YANG Shen-xiang. Study on Wireless Communication Network Architecture and Access Control Algorithm in Aircraft [J]. Computer Science, 2022, 49(9): 268-274.
[2] ZHENG Wen-ping, LIU Mei-lin, YANG Gui. Community Detection Algorithm Based on Node Stability and Neighbor Similarity [J]. Computer Science, 2022, 49(9): 83-91.
[3] JIAN Qi-rui, CHEN Ze-mao, WU Xiao-kang. Authentication and Key Agreement Protocol for UAV Communication [J]. Computer Science, 2022, 49(8): 306-313.
[4] JIANG Sheng-teng, ZHANG Yi-chi, LUO Peng, LIU Yue-ling, CAO Kuo, ZHAO Hai-tao, WEI Ji-bo. Analysis of Performance Metrics of Semantic Communication Systems [J]. Computer Science, 2022, 49(7): 236-241.
[5] HE Xi, HE Ke-tai, WANG Jin-shan, LIN Shen-wen, YANG Jing-lin, FENG Yu-chao. Analysis of Bitcoin Entity Transaction Patterns [J]. Computer Science, 2022, 49(6A): 502-507.
[6] YANG Bo, LI Yuan-biao. Complex Network Analysis on Curriculum System of Data Science and Big Data Technology [J]. Computer Science, 2022, 49(6A): 680-685.
[7] YE Yue-jin, LI Fang, CHEN De-xun, GUO Heng, CHEN Xin. Study on Preprocessing Algorithm for Partition Reconnection of Unstructured-grid Based on Domestic Many-core Architecture [J]. Computer Science, 2022, 49(6): 73-80.
[8] WANG Ben-yu, GU Yi-jun, PENG Shu-fan, ZHENG Di-wen. Community Detection Algorithm Based on Dynamic Distance and Stochastic Competitive Learning [J]. Computer Science, 2022, 49(5): 170-178.
[9] CHEN Shi-cong, YUAN De-yu, HUANG Shu-hua, YANG Ming. Node Label Classification Algorithm Based on Structural Depth Network Embedding Model [J]. Computer Science, 2022, 49(3): 105-112.
[10] ZHAO Xue-lei, JI Xin-sheng, LIU Shu-xin, LI Ying-le, LI Hai-tao. Link Prediction Method for Directed Networks Based on Path Connection Strength [J]. Computer Science, 2022, 49(2): 216-222.
[11] LI Jia-wen, GUO Bing-hui, YANG Xiao-bo, ZHENG Zhi-ming. Disease Genes Recognition Based on Information Propagation [J]. Computer Science, 2022, 49(1): 264-270.
[12] SHE Wei, HUO Li-juan, TIAN Zhao, LIU Wei, SONG Xuan. Blockchain Covert Communication Model for Plain Text Information Hiding [J]. Computer Science, 2022, 49(1): 345-352.
[13] WANG Jian, WANG Yu-cui, HUANG Meng-jie. False Information in Social Networks:Definition,Detection and Control [J]. Computer Science, 2021, 48(8): 263-277.
[14] WANG Ying-kai, WANG Qing-shan. Reinforcement Learning Based Energy Allocation Strategy for Multi-access Wireless Communications with Energy Harvesting [J]. Computer Science, 2021, 48(7): 333-339.
[15] TAN Qi, ZHANG Feng-li, WANG Ting, WANG Rui-jin, ZHOU Shi-jie. Social Network User Influence Evaluation Algorithm Integrating Structure Centrality [J]. Computer Science, 2021, 48(7): 124-129.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!