This Article 
 Bibliographic References 
 Add to: 
Communicating Centrality in Policy Network Drawings
April-June 2003 (vol. 9 no. 2)
pp. 241-253

Abstract—We introduce a network visualization technique that supports an analytical method applied in the social sciences. Policy network analysis is an approach to study policy making structures, processes, and outcomes, thereby concentrating on relations between policy actors. An important operational concept for the analysis of policy networks is the notion of centrality, i.e., the distinction of actors according to their importance in a relational structure. We integrate this measure in a layout model for networks by mapping structural to geometric centrality. Thus, centrality values and network data can be presented simultaneously and explored interactively.

[1] J.M. Anthonisse, “The Rush in a Directed Graph,” Technical Report BN 9/71, Stichting Mathematisch Centrum, Amsterdam, Oct. 1971.
[2] J. Bertin, Semiology of Graphics: Diagrams, Networks, Maps. Univ. of Wisconsin Press, 1983.
[3] U. Brandes, “Drawing on Physical Analogies,” Drawing Graphs, M. Kaufmann and D. Wagner, eds., pp. 71-86, Springer, 2001.
[4] U. Brandes, P. Kenis, J. Raab, V. Schneider, and D. Wagner, “Explorations into the Visualization of Policy Networks,” J. Theoretical Politics, vol. 11, no. 1, pp. 75-106, 1999.
[5] S.K. Card, J.D. Mackinlay, and B. Shneiderman, Readings in Information Visualization: Using Vision to Think. Morgan Kaufman, 1999.
[6] M.-J. Carpano, “Automatic Display of Hierarchized Graphs for Computer-Aided Decision Analysis,” IEEE Trans. Systems, Man, and Cybernetics, vol. 10, no. 11, pp. 705-715, 1980.
[7] W.S. Cleveland and R. McGill, “Graphical Perception: Theory, Experimentation, and Application to the Development of Graphical Methods,” J. Am. Statistical Assoc., vol. 79, no. 387, pp. 531-554, Sept. 1984.
[8] R. Davidson and D. Harel, “Drawing Graphs Nicely Using Simulated Annealing,” ACM Trans. Graphics, vol. 15, no. 4, pp. 301-331, 1996.
[9] G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
[10] P. Eades, “A Heuristic for Graph Drawing,” Congressus Numerantium, vol. 42, pp. 149-160, 1984.
[11] P. Eades and K. Sugiyama, “How to Draw a Directed Graph,” J. Information Processing, vol. 13, no. 4, pp. 424-437, 1990.
[12] P. Eades and N.C. Wormald, “Edge Crossings in Drawings of Bipartite Graphs,” Algorithmica, vol. 11, pp. 379-403, 1994.
[13] S.G. Eick, “Visual Discovery and Analysis,” IEEE Trans. Visualization and Computer Graphics, vol. 6, no. 1, pp. 44-58, 2000.
[14] L.C. Freeman, “A Set of Measures of Centrality Based on Betweenness,” Sociometry, vol. 40, pp. 35-41, 1977.
[15] L.C. Freeman, “Centrality in Social Networks: Conceptual Clarification,” Social Networks, vol. 1, pp. 215-239, 1979.
[16] A. Frick, A. Ludwig, and H. Mehldau, “A Fast Adaptive Layout Algorithm for Undirected Graphs,” Proc. DIMACS Int'l Workshop Graph Drawing (GD '94), R. Tamassia and I.G. Tollis, eds., pp. 388-403, 1995.
[17] N.E. Friedkin, “Theoretical Foundations for Centrality Measures,” Am. J. Sociology, vol. 96, no. 6, pp. 1478-1504, May 1991.
[18] T.M.J. Fruchterman and E.M. Reingold, “Graph-Drawing by Force-Directed Placement,” SoftwarePractice and Experience, vol. 21, no. 11, pp. 1129-1164, 1991.
[19] I. Herman, G. Melançon, and M.S. Marshall, “Graph Visualization and Navigation in Information Visualization: A Survey,” IEEE Trans. Visualization and Computer Graphics, vol. 6, no. 1, pp. 24-43, Jan.-Mar. 2000.
[20] T. Kamada and S. Kawai, “An Algorithm for Drawing General Undirected Graphs,” Information Processing Letters, vol. 31, pp. 7-15, 1989.
[21] Drawing Graphs: Methods and Models, M. Kaufmann and D. Wagner, eds. Springer, 2001.
[22] P. Kenis and V. Schneider, “Policy Networks and Policy Analysis: Scrutinizing a New Analytical Toolbox,” Policy Networks: Empirical Evidence and Theoretical Considerations, B. Marin and R. Mayntz, eds., pp. 25-59, Campus Verlag, 1991.
[23] J.D. Mackinlay, “Automating the Design of Graphical Presentations of Relational Data,” ACM Trans. Graphics, vol. 5, no. 2, pp. 110-141, Apr. 1986.
[24] J.L. Moreno, Who Shall Survive: Foundations of Sociometry, Group Psychotherapy, and Sociodrama. Beacon House, 1953.
[25] M.L. Northway, “A Method for Depicting Social Relationships Obtained by Sociometric Testing,” Sociometry, vol. 3, no. 2, pp. 144-150, 1940.
[26] H.C. Purchase, “Which Aesthetic Has the Greatest Effect on Human Understanding?,” Proc. Fifth Int'l Symp. Graph Drawing (GD '97), G. Di Battista, ed., pp. 248-261, 1997.
[27] M.G. Reggiani and F.E. Marchetti, “A Proposed Method for Representing Hierarchies,” IEEE Trans. Systems, Man, and Cybernetics, vol. 18, no. 1, pp. 2-8, 1988.
[28] G. Sabidussi, “The Centrality Index of a Graph,” Psychometrika, vol. 31, pp. 581-603, 1966.
[29] K. Sugiyama, S. Tagawa, and M. Toda, “Methods for Visual Understanding of Hierarchical System Structures,” IEEE Trans. Systems, Man, and Cybernetics, vol. 11, no. 2, pp. 109-125, Feb. 1981.
[30] E.R. Tufte, The Visual Display of Quantitative Information. Graphics Press, 1983.
[31] S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications. Cambridge Univ. Press, 1994.

Index Terms:
Information visualization, graph drawing, force-directed placement, social network analysis, centrality.
Ulrik Brandes, Patrick Kenis, Dorothea Wagner, "Communicating Centrality in Policy Network Drawings," IEEE Transactions on Visualization and Computer Graphics, vol. 9, no. 2, pp. 241-253, April-June 2003, doi:10.1109/TVCG.2003.10003
Usage of this product signifies your acceptance of the Terms of Use.