Skip to main content
SpringerLink
Log in
Book cover

Graph Drawing Software pp 321–340Cite as

Analysis and Visualization of Social Networks

  • Chapter

Part of the book series: Mathematics and Visualization ((MATHVISUAL))

Abstract

We describe Visone, a tool that facilitates the visual exploration of social networks. Social network analysis is a methodological approach in the social sciences using graph-theoretic concepts to describe, understand and explain social structure. The Visone software is an attempt to integrate analysis and visualization of social networks and is intended to be used in research and teaching. While we are primarily focusing on users in the social sciences, several features provided in the tool will be useful in other fields as well.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Analytic Technologies. UCINET V. Network analysis software. See http://www.analytictech.com/

    Google Scholar 

  2. Anthonisse, J. M. (1971) The rush in a directed graph. Technical Report BN 9/71, Stichting Mathematisch Centrum, Amsterdam

    Google Scholar 

  3. Barabasi, A.-L., Albert, R. (1999) Emergence of scaling in random networks. Science 286(5439), 509–512

    Article  MathSciNet  Google Scholar 

  4. Batagelj, V., Brandes, U. (2003) Efficient generation of random graphs. Working Paper

    Google Scholar 

  5. Batagelj, V., Brandes, U., Johnson, J. C, Kobourov, S., Krempel, L., Mrvar, A., Wagner, D. (2002) Analysis and visualization of network data. Special Session during Sunbelt Social Network Conference XXII, New Orleans

    Google Scholar 

  6. Baur, M., Brandes, U. (2003) An improved heuristic for crossing minimization in circular layouts. Working Paper

    Google Scholar 

  7. Beauchamp, M. A. (1965) An improved index of centrality. Behavioral Science 10, 161–163

    Article  Google Scholar 

  8. Bonacich, P. (1972) Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology 2, 113–120

    Article  Google Scholar 

  9. Brandes, U. (2001) A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25(2), 163–177

    Article  MATH  Google Scholar 

  10. Brandes, IL, Eiglsperger, M., Herman, I., Himsolt, M., Marshall, M. S. (2002) GraphML progress report: Structural layer proposal. In: P. Mutzel, M. Jünger, S. Leipert (eds.) Graph Drawing’ 01, Lecture Notes in Computer Science 2265, Springer-Verlag, 501–512. For up-to-date information see http://graphml.graphdrawing.org/.

    Google Scholar 

  11. Brandes, U., Kenis, P., Raab, J., Schneider, V., Wagner, D. (1999) Explorations into the visualization of policy networks. Journal of Theoretical Politics 11(1), 75–106

    Article  Google Scholar 

  12. Brandes, U., Kenis, P., Wagner, D. (2003) Communicating centrality in policy network drawings. IEEE Transactions on Visualization and Computer Graphics 9(2), 241–253

    Article  Google Scholar 

  13. Brandes, U., Köpf, B. (2002) Fast and simple horizontal coordinate assignment. In: P. Mutzel, M. Jünger, S. Leipert (eds.) Graph Drawing’ 01, Lecture Notes in Computer Science 2265, Springer-Verlag, 31–44

    Google Scholar 

  14. Brandes, U., Raab, J., Wagner, D. (2001) Exploratory network visualization: Simultaneous display of actor status and connections. Journal of Social Structure 2(4)

    Google Scholar 

  15. Brin, S., Page, L. (1998) The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1–7), 107–117

    Article  Google Scholar 

  16. Burt, R. S. (1982) Toward a Structural Theory of Action: Network Models of Social Structure, Perception, and Action. Academic Press

    Google Scholar 

  17. Burt, R. S. (1991) Structure, Version 4.2. Center for the Social Sciences, Columbia University, New York. See http://gsbwww.uchicago.edu/fac/ronald.burt/teaching/

    Google Scholar 

  18. Corman, S. R., Kuhn, T., McPhee, R. D., Dooley, K. J. (2002) Studying complex discursive systems: Centering resonance analysis of communication. Human Communication Research 28(2), 157–206

    Google Scholar 

  19. Freeman, L. C. (1977) A set of measures of centrality based on betweenness. Sociometry 40, 35–41

    Article  Google Scholar 

  20. Gilbert, E. N. (1959) Random graphs. The Annals of Mathematical Statistics 30(4), 1141–1144

    Article  MATH  Google Scholar 

  21. Hage, P., Harary, F. (1995) Eccentricity and centrality in networks. Social Networks 17, 57–63

    Article  Google Scholar 

  22. Hall, K. M. (1970) An r-dimensional quadratic placement algorithm. Management Science 17(3), 219–229

    Article  MATH  Google Scholar 

  23. Harel, D., Koren, Y. (2002) Graph drawing by high-dimensional embedding. In: M. T. Goodrich and S. G. Kobourov (eds.) Graph Drawing’ 02, Lecture Notes in Computer Science 2528, Springer-Verlag, 207–219

    Google Scholar 

  24. Katz, L. (1953) A new status index derived from sociometric analysis. Psychometrika 18, 39–43

    Article  MATH  Google Scholar 

  25. Kenis, P. (1998) An analysis of cooperation structures in local drug policy in Germany. Unpublished Report.

    Google Scholar 

  26. Kleinberg, J. M. (1999) Authoritative sources in a hyperlinked environment. Journal of the Association for Computing Machinery 46(5), 604–632

    Article  MathSciNet  MATH  Google Scholar 

  27. Koren, Y., Carmel, L., Harel, D. (2002) ACE: A fast multiscale eigenvectors computation for drawing huge graphs. In: Proceedings IEEE Symposium on Information Visualization (InfoVis’ 02), 137–144

    Google Scholar 

  28. Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T. (1987) On the NP-completeness of a computer network layout problem. In: Proceedings IEEE International Symposium on Circuits and Systems, 292–295

    Google Scholar 

  29. Matuszewski, C, Schönfeld, R., Molitor, P. (1999) Using sifting for k-layer straightline crossing minimization. In: J. Katochvil (ed.) Graph Drawing’ 99, Lecture Notes in Computer Science 1731, Springer-Verlag, 217–224

    Google Scholar 

  30. Mehlhorn, K., Näher, S. (1999) The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press

    Google Scholar 

  31. Raab, J. (2002) Steuerung von Privatisierung. Westdeutscher Verlag

    Google Scholar 

  32. Sabidussi, G. (1966) The centrality index of a graph. Psychometrika 31, 581–603

    Article  MathSciNet  MATH  Google Scholar 

  33. Six, J. M., Tollis, I. G. (1999) Circular drawings of biconnected graphs. In: M. T. Goodrich and C. C. McGeoch (ed.), Proceedings 1st Workshop on Algorithm Engineering and Experimentation (ALENEX’ 99), Lecture Notes in Computer Science 1619, Springer-Verlag, 57–73

    Google Scholar 

  34. Six, J. M., Tollis, I. G. (1999) A framework for circular drawings of networks. In: J. Katochvil (ed.) Graph Drawing’ 99, Lecture Notes in Computer Science 1731, Springer-Verlag, 107–116

    Google Scholar 

  35. Valente, T. W., Foreman, R. K. (1998) Integration and radiality: Measuring the extent of an individual’s connectedness and reachability in a network. Social Networks 20(1), 89–105

    Article  Google Scholar 

  36. Watts, D. J., Strogatz, S. H. (1998) Collective dynamics of “small-world” networks. Nature 393, 440–442

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics & Computer Science, University of Passau, 94030, Passau, Germany

    Ulrik Brandes

  2. Department of Computer & Information Science, University of Konstanz, 78457, Konstanz, Germany

    Dorothea Wagner

Authors
  1. Ulrik Brandes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dorothea Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität zu Köln, Pohligstraße 1, 50969, Köln, Germany

    Michael Jünger

  2. Institut für Computergraphik und Algorithmen, Technische Universität Wien, Favoritenstraße 9-11 E186, 1040, Wien, Austria

    Petra Mutzel

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Brandes, U., Wagner, D. (2004). Analysis and Visualization of Social Networks. In: Jünger, M., Mutzel, P. (eds) Graph Drawing Software. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18638-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18638-7_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-62214-4

  • Online ISBN: 978-3-642-18638-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation