Fast approximation of centrality

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]  Piotr Indyk,et al.  Fast estimation of diameter and shortest paths (without matrix multiplication) , 1996, SODA '96.

[2]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[3]  Jie Wu,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .

[4]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[5]  Raimund Seidel,et al.  On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs , 1995, J. Comput. Syst. Sci..

[6]  P. Bonacich.  Factoring and weighting approaches to status scores and clique identification , 1972 .

[7]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[8]  Sridhar Radhakrishnan,et al.  Unified All-pairs Shortest Path Algorithms in the Chordal Hierarchy , 1997, Discret. Appl. Math..

[9]  Noga Alon,et al.  On the Exponent of the All Pairs Shortest Path Problem , 1991, J. Comput. Syst. Sci..

[10]  Alex Bavelas.  A Mathematical Model for Group Structures , 1948 .

[11]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[12]  Alistair Moffat,et al.  An All Pairs Shortest Path Algorithm with Expected Time O(n² log n) , 1987, SIAM J. Comput..

[13]  Alex Bavelas,et al.  Communication Patterns in Task‐Oriented Groups , 1950 .

[14]  Vladimir Batagelj,et al.  Centrality in Social Networks , 1993 .

[15]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[16]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[17]  Gideon Yuval,et al.  An Algorithm for Finding All Shortest Paths Using N^(2.81) Infinite-Precision Multiplications , 1976, Inf. Process. Lett..

[18]  C. Pandu Rangan,et al.  An optimal algorithm to solve the all-pair shortest path problem on interval graphs , 1992, Networks.

[19]  M. A. Beauchamp.  AN IMPROVED INDEX OF CENTRALITY. , 1965, Behavioral science.

[20]  Elsev Iek.  The algorithmic use of hypertree structure and maximum neighbourhood orderings , 2003 .

[21]  Alan M. Frieze,et al.  Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model , 1997, RANDOM.

[22]  Alan M. Frieze,et al.  The shortest-path problem for graphs with random arc-lengths , 1985, Discret. Appl. Math..

[23]  Uri Zwick,et al.  All pairs almost shortest paths , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[24]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[25]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[26]  Feodor F. Dragan,et al.  The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings , 1994, WG.

[27]  Kurt Mehlhorn,et al.  On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka , 1995, ESA.

[28]  Alistair Moffat,et al.  An all pairs shortest path algorithm with expected running time O(n 2logn) , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[29]  Noah E. Friedkin,et al.  Theoretical Foundations for Centrality Measures , 1991, American Journal of Sociology.

[30]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[31]  Der-Tsai Lee,et al.  Solving the all-pair shortest path query problem on interval and circular-arc graphs , 1998 .