论文信息 - Eigenvector centrality and structural zeroes and ones: When is a neighbor not a neighbor?

Eigenvector centrality and structural zeroes and ones: When is a neighbor not a neighbor?

Abstract There will be occasions in which a researcher wants to ignore some dyads in the computation of centrality in order to avoid biased or misleading results. This paper presents a principled way of computing eigenvector-like centrality scores when some dyads are not included in the calculations.

Phillip Bonacich | Paulette Lloyd | P. Bonacich | Paulette Lloyd

[1] Jan de Leeuw,et al. Block-relaxation Algorithms in Statistics , 1994 .

[2] Phillip Bonacich,et al. Simultaneous group and individual centralities , 1991 .

[3] Noah E. Friedkin,et al. Theoretical Foundations for Centrality Measures , 1991, American Journal of Sociology.

[4] P. Bonacich. TECHNIQUE FOR ANALYZING OVERLAPPING MEMBERSHIPS , 1972 .

[5] Jon Kleinberg,et al. Authoritative sources in a hyperlinked environment , 1999, SODA '98.

[6] Patrick Doreian,et al. A variable neighborhood search method for a two-mode blockmodeling problem in social network analysis , 2013, Network Science.

[7] Garry Robins,et al. Bayesian analysis for partially observed network data, missing ties, attributes and actors , 2013, Soc. Networks.

[8] P. Bonacich. Factoring and weighting approaches to status scores and clique identification , 1972 .

[9] Mark Newman,et al. Networks: An Introduction , 2010 .

[10] R. Breiger. The Duality of Persons and Groups , 1974 .

[11] Martin G. Everett,et al. Network analysis of 2-mode data , 1997 .

[12] Patrick Doreian,et al. Partitioning large signed two-mode networks: Problems and prospects , 2013, Soc. Networks.

[13] Mark Huisman,et al. Imputation of missing network data: Some simple procedures , 2009, J. Soc. Struct..