Logo

Login | Create Account

Centrality in Policy Network Drawings (Extended Abstract)

Brandes, Ulrik and Kenis, Patrick and Wagner, Dorothea (1999) Centrality in Policy Network Drawings (Extended Abstract). [Conference Paper]

Full text not available from this repository.

Abstract

We report on first results of a cooperation aiming at the usage of graph drawing techniques to convey domain-specific information contained in policy or, more general, social networks. Policy network analysis is an approach to study policy making processes, structures and outcomes, thereby concentrating on the analysis of relations between policy actors. An important operational concept for the analysis of policy networks is centrality, i. e. the distinction of actors according to their importance in a relational structure. Matching structural with geometric centrality we incorporate the aggregated values of centrality measures into a layout model of the network.

Item Type:Conference Paper
Classifications:M Methods > M.999 Others
Z Theory > Z.250 Geometry
P Styles > P.999 Others
ID Code:353
Deposited By:Maciejak, Agnes
Deposited On:23 Nov 2004
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=1731&spage=232

Repository Staff Only: item control page

References

1. Vladimir Batagelj and Andrej Mrvar. PAJEK - Program for large network analysis. Connections, 21:47-57, 1998.

2. Jacques Bertin. Semiology of Graphics. Diagrams, Networks, Maps. University of Wisconsin Press, 1983.

3. Ulrik Brandes, Patrick Kenis, Jörg Raab, Volker Schneider, and Dorothea Wagner. Explorations into the visualization of policy networks. Journal of Theoretical Politics, 11(1):75-106, 1999.

4. Ron Davidson and David Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15(4):301-331, 1996.

5. Peter Eades and Nicholas C. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11:379-403, 1994.

6. Linton C. Freeman. Centrality in social networks: Conceptual clarification. Social Networks, 1:215-239, 1979.

7. Noah E. Friedkin. Theoretical foundations for centrality measures. American Journal of Sociology, 96(6):1478-1504, May 1991.

8. Tomihisa Kamada and Satoru Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7-15, 1989.

9. Patrick Kenis and Volker Schneider. Policy networks and policy analysis: Scrutinizing a new analytical toolbox. In Bernd Marin and Renate Mayntz, editors, Policy Networks: Empirical Evidence and Theoretical Consideration, pages 25-59, Campus Verlag, 1991.

10. David Krackhardt, Jim Blythe, and Cathleen McGrath. KrackPlot 3.0: An improved network drawing program. Connections, 17(2):53-55, 1994.

11. Cathleen McGrath, Jim Blythe, and David Krackhardt. The effect of spatial arrangement on judgments and errors in interpreting graphs. Social Networks, 19(3):223-242, 1997.

12. Jakob L. Moreno. Who Shall Survive: Foundations of Sociometry, Group Psychotherapy, and Sociodrama. Beacon House, 1953.

13. Mary L. Northway. A method for depicting social relationships obtained by sociometric testing. Sociometry, 3:144-150, 1940.

14. Marcello G. Reggiani and Franco E. Marchetti. A proposed method for representing hierarchies. IEEE Transactions on Systems, Man and Cybernetics, 18(1):2-8, 1988.

15. Kozo Sugiyama, Shojiro Tagawa, and Mitsuhiko Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, 11(2):109-125, February 1981.

16. Edward R. Tufte. The Visual Display of Quantitative Information. Graphics Press, 1983.

17. Stanley Wasserman and Katherine Faust. Social Network Analysis: Methods and Applications. Cambridge University Press, 1994.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.