Analysis and visualization of large networks with program package Pajek
 Andrej Mrvar^{1}Email author and
 Vladimir Batagelj^{2}
DOI: 10.1186/s4029401600178
© Mrvar and Batagelj. 2016
Received: 17 February 2016
Accepted: 25 February 2016
Published: 6 April 2016
Abstract
Keywords
Pajek PajekXXL Analysis of large networks Visualization of networksBackground
Large networks can be found everywhere, e.g., social networks, connections among people (kinship relations, friendship, Facebook, Twitter, WWW); trade among organizations or countries; citation and coauthorship networks (e.g., obtained from Web of Science); telephone calls; flow charts in computer science; organic molecule in chemistry (e.g., DNA, protein–protein interaction networks, genome research); connections among words in text or dictionaries; transportation networks (airlines, streets,…).
Review
History
Development of program Pajek began in 1996 when Andrej Mrvar started his work on Ph.D. thesis on analysis and visualization of large networks at Faculty of Computer and Information Science, University Ljubljana (advisor prof. dr. Vladimir Batagelj). Although Pajek has been developed now for 20 years, it is still the only general program available on the market that can handle huge networks (networks having up to a billion of vertices; there is no limit—except the memory size—on the number of lines). Pajek is now used by several universities (e.g., University of Oxford, University of California at Irvine, San Diego, Amsterdam…) and companies (e.g., Deutsche Bundesbank, Volkswagen AG, SPSS Korea, Bank of England, Cisco, Basel Bank for International Settlements, Kansas City Missouri Police Department, Indianapolis Police Department…). Pajek is cited (March, 2016) more than 2000 times in Web of Science and more than 6000 times in Google Scholar. Citations can be found also in some prominent journals like Nature and Genome Research. Pajek was the winner of the William D. Richards Jr., Software Award in 2013.
Main goals of Pajek

to support abstraction by (recursive) decomposition of a large network into several smaller networks that can be treated further using more sophisticated methods (Batagelj and Mrvar 1998; Batagelj et al. 1999);

to provide the user with some powerful visualization tools (Batagelj and Mrvar 2002, 2003);

to implement a selection of efficient (subquadratic) algorithms for analysis of large networks (Batagelj and Mrvar 2014).
Operations
According to main goals, Pajek contains several basic operations on its objects. Pajek is not ‘a one click program’, some users call it ‘the network calculator’. That means that for obtaining some result several basic operations must be executed in a sequence. In fact possibility to combine different basic operations gives Pajek a special power.
Some of such basic operations available in Pajek include: extracting subnetworks; shrinking selected parts of networks; searching for connected components (weak, strong, biconnected); searching for shortest paths, kneighbors, maximum flow; computing centralities of vertices and centralizations of networks (degree, closeness, betweenness, hubs and authorities, clustering coefficients, Laplacean centrality); fragment searching; clustering in networks (with or without constraint); brokerage; community detection methods (Louvain method and VOS clustering); fast sparse network multiplication; triadic census (Batagelj and Mrvar 2001); structural holes; islands (on vertices or lines); counting for three and four rings; generating different types of random networks, Petri nets execution, and many, many others. Some operations which are suitable only for smaller networks are also included in Pajek (e.g., Pajek is the only software that includes generalized blockmodeling (Batagelj et al. 2004)—a sophisticated method for partitioning smaller networks).
Pajek contains several operations that enable transitions among objects. In this way analysis of large networks can be performed fluently. Sequences of commands can be defined as a macro.
Results obtained by Pajek (e.g., partitions and vectors) can be further analysed using R, SPSS, and Excel (several exports to statistical software are included in Pajek).
In addition to ordinary (directed or undirected) networks Pajek supports also twomode networks, temporal networks (networks changing over time), signed networks (networks with positive and negative lines), multirelational networks (several relations defined on the same set of vertices) and acyclic networks. Special operations for these kinds of networks are available, e.g., different methods for partitioning signed networks (Doreian and Mrvar 1996, 2009, 2014, 2015; Mrvar and Doreian 2009; Doreian et al. 2013); several methods for computing traversal weights (e.g., SPC, SPLC, and SPNP) and later determining main paths in acyclic (e.g., citation) networks….
Genealogies saved in GEDCOM format can be loaded in Pajek as well. Kinship relations can be represented as Ore graph, pgraph or bipartite pgraph (White et al. 1999; Batagelj and Mrvar 2008). Pajek was successfully applied to analysis of large genealogies (e.g., searching for relinking marriages).
In addition to standard Pajek there exists also a special version called PajekXXL. PajekXXL is a special edition of program Pajek which memory consumption is much lower. For the same sparse network it needs at least 2–3 times less physical memory than Pajek. Operations that are memory intensive (e.g., generating random networks, extracting, shrinking…) are therefore much faster. PajekXXL is usually used for huge networks that do not fit to available computer memory. After some interesting parts are found and extracted, the standard Pajek version can be used for further analysis.
Visualization methods
There are different methods for automatic generation of network layouts available in Pajek. The most important (often used) are: KamadaKawai optimization, Fruchterman Reingold optimization, VOS mapping, Pivot MDS, drawing in layers, FishEye transformation. Layouts obtained by Pajek can be exported to different 2D or 3D output formats (e.g., SVG, EPS, X3D, VOSViewer, Mage,…). Special viewers and editors for these formats are available (e.g., inkscape, GSView, instantreality, KiNG,…). Using them we can further edit layouts or examine them in details.
Pajek implementations of the algorithms for automatic network drawing were tested on several Graph Drawing Competitions. Andrej Mrvar and Vladimir Batagelj took part in competitions in the period 1995–2005. Their visualizations using program Pajek were awarded altogether with eight first and three second prizes.
Publications
Because of such a wide usage of the program the need for a monograph describing ‘How to do network analysis with Pajek?’ became inevitable.
Example visualizations obtained by Pajek
Discussion
One of the implications of the 20 years development in information and communication technologies is availability of huge amount of data. Some people call this phenomenon Big Data. Now a lot of data is already available in a computer readable electronic form. Researchers have recognized the power of gathering and analyzing such data. The need for computer programs to analyze and visualize Big Data becomes inevitable. The same happens in the area of social networks analysis. Now we can generate huge networks from different electronic resources. Typical examples of such networks are coauthorship (Batagelj and Mrvar 2000) and citations networks obtained from Web of Science. Pajek—program for analysis and visualization of large networks is discussed in the paper.
Application areas
As mentioned in previous sections large networks could be found anywhere. Program package Pajek has several application areas, including: analysis of any kind of social networks (Facebook, Twitter, networks in organizations (Škerlavaj et al. 2010), networks of international relations, kinship relations,…); citation and coauthorship networks; protein–protein interaction networks; transportation networks, archaeological networks,… Some people use it also only as a visualization tool for displaying any kind of networks.
Conclusion
Pajek is in constant development. For more information on Pajek check its webpage. For those who want to learn Pajek: Several books, manuals, articles, and samples are available. They are listed in the references section.
Declarations
Authors’ contributions
AM drafted the manuscript and provided examples. VB checked the manuscript. Both authors read and approved the final manuscript.
Acknowledgements
We would like to thank University of Ljubljana, Slovenia for providing the necessary environment and support to carry out this work.
Competing interests
The authors declare that they have no competing interests.
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Authors’ Affiliations
References
 Batagelj V, Mrvar A (1998) Pajek—a program for large network analysis. Connections 21(2):47–57Google Scholar
 Batagelj V, Mrvar A (2000) Some analyses of Erdos collaboration graph. Soc Netw 22:173–186MathSciNetView ArticleGoogle Scholar
 Batagelj V, Mrvar A (2001) A subquadratic triad census algorithm for large sparse networks with small maximum degree. Soc Netw 23:237–243View ArticleGoogle Scholar
 Batagelj V, Mrvar A (2002) Pajek—analysis and visualization of large networks. Lecture notes in computer science vol 2265, SpringerVerlag, pp 477–478Google Scholar
 Batagelj V, Mrvar A (2003) Pajek—analysis and visualization of large networks. In: M Juenger, P Mutzel (eds) Graph drawing software. Springer (series mathematics and visualization), pp 77–103Google Scholar
 Batagelj V, Mrvar A (2008) Analysis of kinship relations with Pajek. Soc Sci Comput Rev 26(2):224–246View ArticleGoogle Scholar
 Batagelj V, Mrvar A (2014) Pajek. In: R Alhajj, J. Rokne (eds) Encyclopedia of social network analysis and mining. Springer, Heidelberg, pp 1245–1256Google Scholar
 Batagelj V, Mrvar A, Zaveršnik M (1999) Partitioning Approach to visualization of large graphs. Lecture notes in computer science vol 1731. SpringerVerlag, pp 90–97Google Scholar
 Batagelj V, Mrvar A, Ferligoj A, Doreian P (2004) Generalized blockmodeling with Pajek. Advances in methodology and statistics, vol 1. FDV, Ljubljana, pp 455–467Google Scholar
 de Nooy W, Mrvar A, Batagelj V (2005) Exploratory social network analysis with Pajek. Cambridge University Press, New YorkView ArticleGoogle Scholar
 de Nooy W, Mrvar A, Batagelj V (2009) Pajek を活用した社会ネットワーク分析, Tokyo Denki University Press, TokyoGoogle Scholar
 de Nooy W, Mrvar A, Batagelj V (2011) Exploratory social network analysis with Pajek: revised and expanded, 2nd edn. Cambridge University Press, New YorkView ArticleGoogle Scholar
 de Nooy W, Mrvar A, Batagelj V (2012) 蜘蛛 : 社会网络分析技术. Beijing World Publishing Corporation, BeijingGoogle Scholar
 Doreian P, Mrvar A (1996) A partitioning approach to structural balance. Soc Netw 18:149–168View ArticleGoogle Scholar
 Doreian P, Mrvar A (2009) Partitioning signed social networks. Soc Netw 31:1–11View ArticleMATHGoogle Scholar
 Doreian P, Mrvar A (2014) Testing two theories for generating signed networks using real data. Advances in Methodology and Statistics, vol 11. FDV, Ljubljana, pp 31–63Google Scholar
 Doreian P, Mrvar A (2015) Structural balance and signed international relations. J Soc Struct 16Google Scholar
 Doreian P, Lloyd P, Mrvar A (2013) Partitioning large signed twomode networks: problems and prospects. Soc Netw 35:178–203View ArticleGoogle Scholar
 Mrvar A, Doreian P (2009) Partitioning signed twomode networks. J Math Sociol 33:196–221View ArticleMATHGoogle Scholar
 Škerlavaj M, Dimovski V, Mrvar A, Pahor M (2010) Intraorganizational learning networks within knowledgeintensive learning environments. Interact Learn Environ 18:39–63View ArticleGoogle Scholar
 White DR, Batagelj V, Mrvar A (1999) Analysis of kinship relations with Pajek. Soc Sci Comput Rev 17(3):245–274View ArticleGoogle Scholar