Skip to main content
SpringerLink
Log in

Pajek — Analysis and Visualization of Large Networks

  • Chapter
Graph Drawing Software

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

Abstract

Pajek is a program, for Windows, for analysis and visualization of large networks having some ten or hundred of thousands of vertices. In Slovenian language pajek means spider.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adobe SVG Viewer (2002) http://www.adobe.com/svg/viewer/install/

    Google Scholar 

  2. Batagelj, V. (1986) Graph — data structure and algorithms in pascal. Research report

    Google Scholar 

  3. Batagelj, V. (1997) Notes on blockmodeling. Social Networks 19, 143–155

    Article  Google Scholar 

  4. Batagelj, V. (2002) Efficient Algorithms for Citation Network Analysis, in preparation

    Google Scholar 

  5. Batagelj, V., Brandes, U. (2002) Fast generation of large sparse random graphs, in preparation

    Google Scholar 

  6. Batagelj, V., Doreian, P., Ferligoj, A. (1992) An Optimizational Approach to Regular Equivalence. Social Networks 14, 121–135

    Article  Google Scholar 

  7. Batagelj, V., Ferligoj, A. (2000) Clustering relational data. In: W. Gaul, O. Opitz, M. Schader (eds.) Data Analysis, Springer-Verlag, Berlin, 3–15

    Chapter  Google Scholar 

  8. Batagelj, V., Mrvar, A. (1995) Towards NetML Networks Markup Language. Presented at International Social Network Conference, London, July 6–10, 1995. http://www.ijp.si/ftp/pub/preprints/ps/95/trp9515.ps

    Google Scholar 

  9. Batagelj, V., Mrvar, A. (1991–94) Programs for Network Analysis, http://vlado.fmf.uni-lj.si/pub/networks/

    Google Scholar 

  10. Batagelj, V., Mrvar, A. (1998) Pajek — A Program for Large Network Analysis. Connections 21(2), 47–57

    Google Scholar 

  11. Batagelj, V., Mrvar, A. (2000) Some Analyses of Erdös Collaboration Graph. Social Networks 22, 173–186

    Article  MathSciNet  Google Scholar 

  12. Batagelj, V., Mrvar, A. (2001) A Subquadratic Triad Census Algorithm for Large Sparse Networks with Small Maximum Degree. Social Networks 23, 237–243

    Article  Google Scholar 

  13. Batagelj, V., Mrvar, A. (2002) Pajek — Analysis and Visualization of Large Networks. In: P. Mutzel, M. Jünger, S. Leipert (eds.) Graph Drawing ′01, Lecture Notes in Computer Science 2265, Springer-Verlag, 477–478

    Google Scholar 

  14. Batagelj, V., Mrvar, A. (2002) Density based approaches to Reuters terror news network analysis, submitted

    Google Scholar 

  15. Batagelj, V., Pisanski, T. (1989) Xgraph project documentation

    Google Scholar 

  16. Batagelj, V., Mrvar, A., Zaversnik, M. (1999) Partitioning Approach to Visualization of Large Graphs. In: J. Kratochvfl (ed.) Graph Drawing ′99, Št iřin Castle, Czech Republic. Lecture Notes in Computer Science 1731, SpringerVerlag, 90–97

    Google Scholar 

  17. Batagelj, V., Mrvar, A., Zaveršnik, M. (2002) Network analysis of texts. Language Technologies, Ljubljana, 143–148

    Google Scholar 

  18. Batagelj, V., Zaveršnik, M. (2001) An 0(m) Algorithm for Cores Decomposition of Networks, submitted

    Google Scholar 

  19. Batagelj, V., Zaversnik, M. (2002) Generalized Cores, submitted http://arxiv.org/abs/cs.DS/0202039

    Google Scholar 

  20. Batagelj, V. and Zaversnik, M. (2002) Triangular connectivity and its generalizations, in preparation

    Google Scholar 

  21. Butts, C. T. (2002) sna: Tools for Social Network Analysis. http://cran.at.r-project.org/src/contrib/PACKAGES.html\#sna

    Google Scholar 

  22. Caida: Internet Visualization Tool Taxonomy. http://www.caida.org/tools/taxonomy/visualization/

    Google Scholar 

  23. Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C. (2001) Introduction to Algorithms, Second Edition, MIT Press

    Google Scholar 

  24. Cosmo Player (2002) http://ca.com/cosmo/

    Google Scholar 

  25. de Nooy, W., Mrvar, A., Batagelj, V. (2002) Exploratory Social Network Analysis With Pajek. to be published by the Cambridge University Press

    Google Scholar 

  26. Doreian, P., Mrvar, A. (1996) A Partitioning Approach to Structural Balance. Social Networks 18, 149–168

    Article  Google Scholar 

  27. Doreian, P., Batagelj, V., Ferligoj, A. (2000) Symmetric-acyclic decompositions of networks. J. classif. 17(1), 3–28

    Article  MathSciNet  MATH  Google Scholar 

  28. Dremelj, P., Mrvar, A., Batagelj, V. (2002) Analiza rodoslova dubrovackog vlasteoskog kruga pomocu programa Pajek. Anali Dubrovnik XL, HAZU, Zagreb, Dubrovnik, 105–126 (in Croatian)

    Google Scholar 

  29. Garfield, E., Sher, I. H., Torpie, R. J. (1964) The Use of Citation Data in Writing the History of Science. Philadelphia: The Institute for Scientific Information http://www.garfield.library.upenn.edu/papers/useofcitdatawritinghistofsei.pdf

    Google Scholar 

  30. GEDCOM 5.5. http://homepages.rootsweb.com/~pmcbride/gedcom/55gctoc.htm

    Google Scholar 

  31. Ghostscript, Ghostview and GSview, http://www.cs.wise.edu/~ghost/

    Google Scholar 

  32. Graph Drawing Contest 1997. http://vlado.fmf.uni-lj.si/pub/gd/gd97.htm

    Google Scholar 

  33. Grossman, J. (2002) The Erdös Number Project, http://www.Oakland.edu/~grossman/erdoshp.html

    Google Scholar 

  34. Hlebec, V. (1993) Recall versus recognition: Comparison of two alternative procedures for collecting social network data. Metodološki zvezki 9, Ljubljana: FDV, 121–128

    Google Scholar 

  35. Hummon, N. P., Doreian, P. (1989) Connectivity in a citation network: The development of DNA theory. Social Networks 11, 39–63

    Article  Google Scholar 

  36. Jones B. (2002). Computational geometry database. http://compgeom.cs.uiuc.edu/~jeffe/compgeom/biblios.html

    Google Scholar 

  37. MDL Information Systems, Inc. (2002) http://www.mdli.com/

    Google Scholar 

  38. James Moody home page (2002) http://www.soc.sbs.ohio-state.edu/jwm/

    Google Scholar 

  39. Murtagh, F. (1985) Multidimensional Clustering Algorithms, Compstat lectures 4, Vienna: Physica-Verlag

    Google Scholar 

  40. ODLIS (2002) Online dictionary of library and information science, http://vax.wesu.edu/library/odlis.html

    Google Scholar 

  41. Pennock, D.M. et al. (2002) Winners don’t take all, PNAS 99(8), 5207–5211

    Article  MATH  Google Scholar 

  42. The R Project for Statistical Computing, http://www.r-project.org/

    Google Scholar 

  43. Richardson, D. C, Richardson, J. S. (2002) The Mage Page, http://kinemage.biochem.duke.edu/index.html

    Google Scholar 

  44. Seidman, S. B. (1983) Network structure and minimum degree, Social Networks 5, 269–287

    Article  MathSciNet  Google Scholar 

  45. UCINET (2002) http://www.analytictech.com/

    Google Scholar 

  46. Project Vega (2002) http://vega.ijp.si/

    Google Scholar 

  47. Wasserman, S., Faust, K. (1994) Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge

    Book  Google Scholar 

  48. Wasserman, S., and Pattison, P. (1996) Logit models and logistic regressions for social networks: I. An introduction to Markov graphs and p *. Psychometrika 60, 401–442, http://kentucky.psych.uiuc.edu/pstar/index.html

    Article  MathSciNet  Google Scholar 

  49. White, D. R., Batagelj, V., Mrvar, A. (1999) Analyzing Large Kinship and Marriage Networks with Pgraph and Pajek. Social Science Computer Review 17(3), 245–274

    Article  Google Scholar 

  50. Yuen Ho et al. (2002) Systematic identification of protein complexes in Saccharomyces cerevisiae by mass spectrometry. Nature 415, 180–183, http://www.mshri.on.ca/tyers/pdfs/proteome.pdf

    Article  Google Scholar 

  51. Zaveršnik, M., Batagelj, V., Mrvar, A. (2002) Analysis and visualization of 2-mode networks. In: Proceedings of Sixth Austrian, Hungarian, Italian and Slovenian Meeting of Young Statisticians, October 5–7, 2001, Ossiach, Austria. University of Klagenfurt, 113–123

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Mathematics and Physics, University of Ljubljana, Slovenia

    Vladimir Batagelj

  2. Faculty of Social Sciences, University of Ljubljana, Slovenia

    Andrej Mrvar

Authors
  1. Vladimir Batagelj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrej Mrvar
    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

Batagelj, V., Mrvar, A. (2004). Pajek — Analysis and Visualization of Large 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_4

Download citation

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

  • 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