Localization and centrality in networks

被引:217
作者
Martin, Travis [1 ]
Zhang, Xiao [2 ]
Newman, M. E. J. [2 ,3 ]
机构
[1] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA
[2] Univ Michigan, Dept Phys, Ann Arbor, MI 48109 USA
[3] Univ Michigan, Ctr Study Complex Syst, Ann Arbor, MI 48109 USA
基金
美国国家科学基金会;
关键词
RANDOM GRAPHS;
D O I
10.1103/PhysRevE.90.052808
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
Eigenvector centrality is a common measure of the importance of nodes in a network. Here we show that under common conditions the eigenvector centrality displays a localization transition that causes most of the weight of the centrality to concentrate on a small number of nodes in the network. In this regime the measure is no longer useful for distinguishing among the remaining nodes and its efficacy as a network metric is impaired. As a remedy, we propose an alternative centrality measure based on the nonbacktracking matrix, which gives results closely similar to the standard eigenvector centrality in dense networks where the latter is well behaved but avoids localization and gives useful results in regimes where the standard centrality fails.
引用
收藏
页数:7
相关论文
共 29 条
[1]   PSEUDO-LIKELIHOOD METHODS FOR COMMUNITY DETECTION IN LARGE SPARSE NETWORKS [J].
Amini, Arash A. ;
Chen, Aiyou ;
Bickel, Peter J. ;
Levina, Elizaveta .
ANNALS OF STATISTICS, 2013, 41 (04) :2097-2122
[2]  
[Anonymous], ARXIV11091355
[3]  
[Anonymous], 2005, P 11 ACM SIGKDD INT
[4]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[5]  
Batagelj V., 2002, Language Technologies, P135
[6]   The Eigenfactor™ Metrics [J].
Bergstrom, Carl T. ;
West, Jevin D. ;
Wiseman, Marc A. .
JOURNAL OF NEUROSCIENCE, 2008, 28 (45) :11433-11434
[7]   FACTORING AND WEIGHTING APPROACHES TO STATUS SCORES AND CLIQUE IDENTIFICATION [J].
BONACICH, P .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 1972, 2 (01) :113-120
[8]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117
[9]   Spectra of random graphs with given expected degrees [J].
Chung, F ;
Lu, LY ;
Vu, V .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2003, 100 (11) :6313-6318
[10]  
de Nooy W., 2011, Exploratory Social Network Analysis with Prajek, DOI DOI 10.1017/CBO9780511996368