Centrality in Social Networks
Published 1 January 1993
Vladimir Batagelj
Citations761
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
In the paper an introduction to main social networks centrality measures is given, a new view on these measures is proposed, based on relational algebra, which is implemented in computer programs CENTRAL and FLOWIND.
Abstract
In the paper an introduction to main social networks centrality measures is given. A new view on these measures is proposed, based on relational algebra . All described measures are implemented in computer programs CENTRAL and FLOWIND.
Keywords
Computer SciencePhysics and Astronomy
Social network analysis methods and applications
18,142 Citations2007Stanley Wasserman, Katherine Faust
Social NetworksCentrality in social networks conceptual clarification
16,883 Citations1978Linton C. Freeman
Three distinct intuitive conceptions of centrality are uncovered and existing measures are refined to embody these conceptions, one absolute and one relative measure of the centrality of positions in a network and one reflecting the degree of centralization of the entire network.
SociometryA Set of Measures of Centrality Based on Betweenness
10,249 Citations1977Linton C. Freeman
A family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced, used to index centrality in any large or small network of symmetrical relations, whether connected or unconnected.
American Journal of Physics<i>Numerical Recipes, The Art of Scientific Computing</i>
10,031 Citations1987William H. Press, Brian P. Flannery +3 more
An Easy Guide to Factor Analysis
3,265 Citations2014Paul Kline
The use and Abuse of Factor Analysis in Research References Index is illustrated with examples from Personality Tests and a comparison of the use and abuse of factor analysis in the context of clinical trials.
Journal of Mathematical SociologyFactoring and weighting approaches to status scores and clique identification
3,129 Citations1972Phillip Bonacich
The Journal of the Acoustical Society of AmericaCommunication Patterns in Task-Oriented Groups
2,037 Citations1950Alex Bavelas
Social NetworksCentrality in valued graphs: A measure of betweenness based on network flow
1,074 Citations1991Linton C. Freeman, Stephen P. Borgatti +1 more
A new measure of centrality, C, is introduced, based on the concept of network flows, which is defined for both valued and non-valued graphs and applicable to a wider variety of network datasets.
Social NetworksRethinking centrality: Methods and examples
987 Citations1989Karen Stephenson, Marvin Zelen
Algorithmic graph theory
830 Citations1985Alan Gibbons
Social NetworksSorting out centrality: An analysis of the performance of four centrality models in real and simulated networks
141 Citations1988John M. Bolland
Assessment of the performance of four centrality models under a variety of known and controlled situations and the robustness and sensitivity of each model under conditions of random and systematic variation introduced into this network.
KnowledgeAnalyzing the Structure of the Centrality-Productivity Literature Created Between 1948 and 1979
91 Citations1990Norman P. Hummon, Patrick Doreian +1 more
Journal of Mathematical SociologySemirings for social networks analysis
45 Citations1994Vladimir Batagelj
The closures of the matrix of a given signed graph over balance and cluster semirings can be used to decide whether the graph is balanced or clusterable.
Social NetworksMeasures of betweenness in non-symmetric networks
44 Citations1987Roger V. Gould
This paper shows that computation of absolute partial betweenness scores is unproblematic for non-symmetric networks as well, as long as ordered pairs of points are considered.
Communications of the ACMA more general algorithm for computing closed semiring costs between vertices of a directed graph
29 Citations1980John G. Fletcher
A generalization of an algorithm given by Aho, Hopcroft, and Ullman, originally derived from the work of Kleene and McNaughton and Yamada, used to compute the total cost of all paths between each pair of vertices in a directed graph when the cost of each edge is known.
Recall Versus Recognition : Comparison of the Two Alternative Procedures for Collecting Social Network Data
21 Citations1993Valentina Hlebec
An experiment in measuring the effect of two alternative methods for collecting social network data found that recall and recognition of the communication flow, identified between twelve members and advisers of the Student Government of the University in Ljubljana, were compared.
Journal of Mathematical ChemistryStudy of computation, relatedness and activity prediction of topological indices
4 Citations1991Irena Fabič-Petrač, Borka Jerman-Blažič +1 more
The paper describes the development and implementation of a computer program for computation of the most often used topological indices:n,n Inn,A,M1,M2,XR,F,x1,W,p,J,D(2),GDI,r, ĪDE, ĬwE.