A Set of Measures of Centrality Based on Betweenness Linton C. Freeman, 1977 Advisor : Professor Frank Y. S. Lin Presented by: Tuan-Chun Chen Presentation date: Mar. 13, 2012

Agenda Introduction Measuring point centrality Measuring graph centrality Applications

Agenda Introduction Measuring point centrality Measuring graph centrality Applications

Introduction Betweenness : A point in a communication network is central to the extent that it falls on the shortest path between pairs of other points. (Bavelas, 1948) Another viewpoint by Shimbel (1953): If we count all of the minimum paths which pass through a site, then we have a measure of the ‘stress’ which the site must undergo during the activity of the network.

Agenda Introduction Measuring point centrality Measuring graph centrality Applications

Measuring Point Centrality Shaw (1954) Unordered pair of points {p i, p j } {p i, p j } are Unreachable or there are one or more paths between them. pipi pjpj pkpk

Measuring Point Centrality A point falling between two others can facilitate, block, distort or falsify communication between the two. But if it falls on some but not the shortest path connecting a pair of points, its potential for control is more limited. pipi pjpj pkpk

Measuring Point Centrality Define “partial betweenness” If p i and p j are not reachable from each other, p k is not between them. let If p i and p j are reachable. g ij The number of geodesics linking p i and p j. g ij (p k )The number of geodesics linking p i and p j that contain p k.

Measuring Point Centrality p 2 and p 4 each have a probability of ½ of falling between p 1 and p 3. p2p2 p4p4 p3p3 p1p1

Measuring Point Centrality Determine overall centrality of a point: C B (p k )An index of the over all partial betweenness of point p k. nThe number of points in the graph.

Measuring Point Centrality Its magnitude depends upon two factors: 1) the arrangement of edges in the graph that define the location of p k with respect to geodesics linking pairs of points. 2) the number of points in the graph.

Measuring Point Centrality Problem ! ? Example: A graph containing 5 points, C B (p i )=6. A graph containing 25 points, C B (p j )=6. They have the same potential for control in absolute terms, but differ markedly in their relative potential for control.

Measuring Point Centrality Maximum Value: pipi pjpj pkpk phph nThe number of points in the graph.

Measuring Point Centrality The relative centrality of any point in a graph, expressed as a ratio : When C’ B (p k )=1, the graph is a star or a wheel.

Agenda Introduction Measuring point centrality Measuring graph centrality Applications

Measuring Graph Centrality A network is central to the degree that a single point can control its communication.(Measures of graph centrality based upon the dominance of one point.) C’ B (p k *)The largest centrality value associated with any point in the graph. C’ B (p i ) The centrality value of p i nThe number of points in the graph.

Agenda Introduction Measuring point centrality Measuring graph centrality Applications

Original application was in the study of communication in small groups. Speed, activity and efficiency in solving problems and personal satisfaction and leadership in small group setting(Leavitt 1951). Study of the diffusion of a technological innovation in the steel industry(Czepiel 1974) Examined the impact of centrality on urban growth(Pitts 1965). Discussing the design of organization(Beauchamp 1965)(Mackenzie 1966)

Applications Consider the relationship between point centrality and personal satisfaction in Leavitt’s(1951) study of small group problem solving. Each participant had a piece of information necessary for the solution of a problem. Each could communicate only with designated others. Leavitt measured point centrality as a function of the lengths of paths or the distance between points.

Applications

Thanks for your attention ！