Social networks: Prestige, centrality, and influence (invited paper)

33Citations
Citations of this article
53Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We deliver a short overview of different centrality measures and influence concepts in social networks, and present the relation-algebraic approach to the concepts of power and influence. First, we briefly discuss four kinds of measures of centrality: the ones based on degree, closeness, betweenness, and the eigenvector-related measures. We consider centrality of a node and of a network. Moreover, we give a classification of the centrality measures based on a topology of network flows. Furthermore, we present a certain model of influence in a social network and discuss some applications of relation algebra and RelView to this model. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Rusinowska, A., Berghammer, R., De Swart, H., & Grabisch, M. (2011). Social networks: Prestige, centrality, and influence (invited paper). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6663 LNCS, pp. 22–39). https://doi.org/10.1007/978-3-642-21070-9_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free