Some new results on the eigenvector centrality

Journal of Mathematical Sociology

Volumn 31, Issue 3, 2007, Pages 237-248

  Grassi, Rosanna ^a   Stefani, Silvana ^a   Torriero, Anna ^b  

^a UNIVERSITY OF MILANO BICOCCA   (Italy)

^b UNIVERSITÀ CATTOLICA DEL SACRO CUORE   (Italy)

Author keywords

Centrality measures; Degree; Eigenvector; Graphs; Social networks; Spectral radius

Indexed keywords

EID: 34250308326     PISSN: 0022250X     EISSN: 15455882     Source Type: Journal    
DOI: 10.1080/00222500701373251     Document Type: Article

References (14)

1. Berman, A. & Plemmons R. J. (1979). Non Negative Matrices in the Mathematical Social Sciences, New York: Academic Press.
2. Bonacich, P. (1972). Technique for analyzing overlapping membership. In H. L. Costner, (ed.), Sociological Methodology (pp. 176-185). San Francisco: Jossey-Bass.
3. Borgatti, S. P. (2005). Centrality and network flow. Social Networks, 27, 55-71.
4. Cvetković, D. M., Doob, M., & Sachs, H. (1995). Spectra of Graphs, 3rd edition. Barth Heidelberg, Leipzig: Verlag.
5. Mukherjee, A. K. & Datta, K. K. (1989). Two new graph theoretical methods for the generation of eigenvectors of chemical graph. Proceedings of the Indian Academy of Sciences (Chemical Sciences), 101, 499-617.
6. Freeman, L. C. (1979). Centrality in social networks: conceptual clarifications. Social networks, 1, 215-239.
7. Gomez, D., Gonzalez-Araguena, E., Manuel, C., Owen, G., Del Pozo, M., & Tejada, J. (2003). Centrality and power in social networks: A game theoretic approach. Mathematical Social Science, 46, 27-54.
8. Grassi, R. (2004). Relevant inequalities in graph connectivity. Archives of Inequalities and Applications, 183-198.
9. Hanneman, R. A. & Riddle M. (2005). Introduction to Social Networks Methods. Riverside, CA: University of Carolina, Riverside. Online textbook available at http://faculty.ucr/edu/~hanneman.
10. Papendieck, B. & Recht, P. (2000). On maximal entries in the principal eigenvector of graphs. Linear Algebra and its Applications, 310, 129-138.
11. Schwenk, A. J. & Wilson, R. J. (1978). On the eigenvalues of a graph. In L. W. Beineke & R. J. Wilson, (eds.), Selected Topics in Graph Theory (pp. 307-336). London: Academic Press.
12. Varga, R. S. (2000). Matrix iterative analysis, Springer Verlag, 2nd ed. New York.
13. Wasserman, S. & Faust, K. (1997). Social Network Analysis, Structural Analysis in the Social Sciences, vol. 8. Cambridge: Cambridge University Press.
14. Zhao, S. & Hong, Y. (2002). On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix. Linear Algebra and its Applications, 340, 245-252.