Abstract:
Social studies researchers use graphs to model group activities in social networks. An important property in this context is the centrality of a vertex: the inverse of the average distance to each other vertex. We describe a randomized approximation algorithm for centrality in weighted graphs. For graphs exhibiting the small world phenomenon, our method estimates the centrality of all vertices with high probability within a (1 + #) factor in near-linear time. 1 Introduction In social network analysis, the vertices of a graph represent agents in a group and the edges represent relationships, such as communication or friendship. The idea of applying graph theory to analyze the connection between the structural centrality and group process was introduced by Bavelas [4]. Various measurement of centrality [7, 14, 15] have been proposed for analyzing communication activity, control, or independence within a social network. We are particularly interested in closeness centrality [5, 6, 24]...
Citations
|
781
|
Probability inequalities for sums of bounded random variables
– Hoeffding
- 1963
|
|
538
|
Matrix multiplication via arithmetic progressions
– Coppersmith, Winograd
- 1990
|
|
412
|
Fibonacci heaps and their uses in improved network optimization algorithms
– Fredman, Tarjan
- 1987
|
|
401
|
The Small World Problem
– Milgram
- 1967
|
|
182
|
Algorithm 97: shortest path
– Floyd
- 1962
|
|
129
|
Centrality in social networks conceptual clarification
– Freeman
- 1978
|
|
89
|
Efficient algorithms for shortest paths in sparse networks
– Johnson
- 1977
|
|
50
|
On the exponent of the all pairs shortest path problem
– Alon, Galil, et al.
- 1997
|
|
48
|
Fast estimation of diameter and shortest paths (without matrix multiplication
– Aingworth, Chekuri, et al.
- 1999
|
|
45
|
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs
– Seidel
- 1995
|
|
37
|
Factoring and weighting approaches to status scores and clique identification
– Bonacich
- 1972
|
|
31
|
The shortest path problem for graphs with random arc-lengths
– Frieze, Grimmett
- 1985
|
|
31
|
An all pairs shortest path algorithm with expected time O(n 2 log n
– Moffat, Takaoka
- 1987
|
|
23
|
The algorithmic use of hypertree structure and maximum neighborhood orderings
– adt, Chepoi, et al.
|
|
14
|
Theoretical foundations for centrality measures
– Friedkin
- 1991
|
|
13
|
Communication patterns in task oriented groups
– Bavelas
- 1950
|
|
13
|
An algorithm for finding all shortest paths using N 2.81 infinite-precision multiplications
– Yuval
- 1976
|
|
12
|
On the all-pairs shortest-path algorithm of Moffat and Takaoka, Random Structures Algorithms 10
– Mehlhorn, Priebe
- 1997
|
|
10
|
Average-case complexity of shortest-paths problems in the vertex-potential model, Random Structures Algorithms 16
– Cooper, Frieze, et al.
- 2000
|
|
10
|
The centrality index of a graph. Psychometrika 31(4
– Sabidussi
- 1966
|
|
9
|
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
– Atallah, Chen, et al.
- 1993
|
|
9
|
An improved index of centrality
– Beauchamp
- 1965
|
|
6
|
Solving the all-pair shortest path query problem on interval and circular-arc graphs
– Chen, Lee, et al.
- 1998
|
|
6
|
An Optimal algorithm to solve the all-pair shortest path problem on interval graphs
– Ravi, Marathe, et al.
- 1992
|
|
5
|
Unified all-pairs shortest path algorithms in the chordal hierarchy
– Han, Sekharan, et al.
- 1997
|
|
4
|
A mathematical model for group structure. Human Organizations
– Bavelas
- 1948
|
