Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
Relational methods in computer science
Relational methods in computer science
Realtion-Algebraic Analysis of Petri Nets with RELVIEW
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Theory and Applications of Relational Structures and Knowledge Instruments: Cost Action 274, Tarski: Revised Papers (Lecture Notes in Computer Science, 2929)
Social and Economic Networks
Generalizing and modifying the hoede-bakker index
TARSKI'02-05 Proceedings of the 2006 international conference on Theory and Applications of Relational Structures as Knowledge Instruments - Volume 2
Hi-index | 0.00 |
We deliver a short overview of different centrality measures and influence concepts in socialnetworks, 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-relatedmeasures.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 certainmodel of influence in a social network and discuss some applications of relation algebra and RelView to this model.