Pajek — Analysis and Visualization of Large Networks

  • Vladimir Batagelj
  • Andrej Mrvar
Part of the Mathematics and Visualization book series (MATHVISUAL)


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.


Large Network Social Network Analysis Citation Network Graph Draw Scalable Vector Graphic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adobe SVG Viewer (2002) Scholar
  2. 2.
    Batagelj, V. (1986) Graph — data structure and algorithms in pascal. Research reportGoogle Scholar
  3. 3.
    Batagelj, V. (1997) Notes on blockmodeling. Social Networks 19, 143–155CrossRefGoogle Scholar
  4. 4.
    Batagelj, V. (2002) Efficient Algorithms for Citation Network Analysis, in preparationGoogle Scholar
  5. 5.
    Batagelj, V., Brandes, U. (2002) Fast generation of large sparse random graphs, in preparationGoogle Scholar
  6. 6.
    Batagelj, V., Doreian, P., Ferligoj, A. (1992) An Optimizational Approach to Regular Equivalence. Social Networks 14, 121–135CrossRefGoogle Scholar
  7. 7.
    Batagelj, V., Ferligoj, A. (2000) Clustering relational data. In: W. Gaul, O. Opitz, M. Schader (eds.) Data Analysis, Springer-Verlag, Berlin, 3–15CrossRefGoogle Scholar
  8. 8.
    Batagelj, V., Mrvar, A. (1995) Towards NetML Networks Markup Language. Presented at International Social Network Conference, London, July 6–10, 1995. Scholar
  9. 9.
    Batagelj, V., Mrvar, A. (1991–94) Programs for Network Analysis, Scholar
  10. 10.
    Batagelj, V., Mrvar, A. (1998) Pajek — A Program for Large Network Analysis. Connections 21(2), 47–57Google Scholar
  11. 11.
    Batagelj, V., Mrvar, A. (2000) Some Analyses of Erdös Collaboration Graph. Social Networks 22, 173–186MathSciNetCrossRefGoogle Scholar
  12. 12.
    Batagelj, V., Mrvar, A. (2001) A Subquadratic Triad Census Algorithm for Large Sparse Networks with Small Maximum Degree. Social Networks 23, 237–243CrossRefGoogle Scholar
  13. 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–478Google Scholar
  14. 14.
    Batagelj, V., Mrvar, A. (2002) Density based approaches to Reuters terror news network analysis, submittedGoogle Scholar
  15. 15.
    Batagelj, V., Pisanski, T. (1989) Xgraph project documentationGoogle Scholar
  16. 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–97Google Scholar
  17. 17.
    Batagelj, V., Mrvar, A., Zaveršnik, M. (2002) Network analysis of texts. Language Technologies, Ljubljana, 143–148Google Scholar
  18. 18.
    Batagelj, V., Zaveršnik, M. (2001) An 0(m) Algorithm for Cores Decomposition of Networks, submittedGoogle Scholar
  19. 19.
    Batagelj, V., Zaversnik, M. (2002) Generalized Cores, submitted Scholar
  20. 20.
    Batagelj, V. and Zaversnik, M. (2002) Triangular connectivity and its generalizations, in preparationGoogle Scholar
  21. 21.
    Butts, C. T. (2002) sna: Tools for Social Network Analysis.\#snaGoogle Scholar
  22. 22.
    Caida: Internet Visualization Tool Taxonomy. Scholar
  23. 23.
    Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C. (2001) Introduction to Algorithms, Second Edition, MIT PressGoogle Scholar
  24. 24.
    Cosmo Player (2002) Scholar
  25. 25.
    de Nooy, W., Mrvar, A., Batagelj, V. (2002) Exploratory Social Network Analysis With Pajek. to be published by the Cambridge University PressGoogle Scholar
  26. 26.
    Doreian, P., Mrvar, A. (1996) A Partitioning Approach to Structural Balance. Social Networks 18, 149–168CrossRefGoogle Scholar
  27. 27.
    Doreian, P., Batagelj, V., Ferligoj, A. (2000) Symmetric-acyclic decompositions of networks. J. classif. 17(1), 3–28MathSciNetzbMATHCrossRefGoogle Scholar
  28. 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. 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 Scholar
  30. 30.
    GEDCOM 5.5. Scholar
  31. 31.
    Ghostscript, Ghostview and GSview, Scholar
  32. 32.
    Graph Drawing Contest 1997. Scholar
  33. 33.
    Grossman, J. (2002) The Erdös Number Project, Scholar
  34. 34.
    Hlebec, V. (1993) Recall versus recognition: Comparison of two alternative procedures for collecting social network data. Metodološki zvezki 9, Ljubljana: FDV, 121–128Google Scholar
  35. 35.
    Hummon, N. P., Doreian, P. (1989) Connectivity in a citation network: The development of DNA theory. Social Networks 11, 39–63CrossRefGoogle Scholar
  36. 36.
    Jones B. (2002). Computational geometry database. Scholar
  37. 37.
    MDL Information Systems, Inc. (2002) Scholar
  38. 38.
    James Moody home page (2002) Scholar
  39. 39.
    Murtagh, F. (1985) Multidimensional Clustering Algorithms, Compstat lectures 4, Vienna: Physica-VerlagGoogle Scholar
  40. 40.
    ODLIS (2002) Online dictionary of library and information science, Scholar
  41. 41.
    Pennock, D.M. et al. (2002) Winners don’t take all, PNAS 99(8), 5207–5211zbMATHCrossRefGoogle Scholar
  42. 42.
    The R Project for Statistical Computing, Scholar
  43. 43.
    Richardson, D. C, Richardson, J. S. (2002) The Mage Page, Scholar
  44. 44.
    Seidman, S. B. (1983) Network structure and minimum degree, Social Networks 5, 269–287MathSciNetCrossRefGoogle Scholar
  45. 45.
    UCINET (2002) Scholar
  46. 46.
    Project Vega (2002) Scholar
  47. 47.
    Wasserman, S., Faust, K. (1994) Social Network Analysis: Methods and Applications. Cambridge University Press, CambridgeCrossRefGoogle Scholar
  48. 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, Scholar
  49. 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–274CrossRefGoogle Scholar
  50. 50.
    Yuen Ho et al. (2002) Systematic identification of protein complexes in Saccharomyces cerevisiae by mass spectrometry. Nature 415, 180–183, Scholar
  51. 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–123Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Vladimir Batagelj
    • 1
  • Andrej Mrvar
    • 2
  1. 1.Department of Mathematics, Faculty of Mathematics and PhysicsUniversity of LjubljanaSlovenia
  2. 2.Faculty of Social SciencesUniversity of LjubljanaSlovenia

Personalised recommendations