Skip to main content
SpringerLink
Log in

Pajek and PajekXXL

  • Living reference work entry
  • First Online:
Encyclopedia of Social Network Analysis and Mining

Synonyms

Bibliometrics; Graph theory; Kinship analysis; Large networks; Social network analysis; Visualization

Glossary

BOM (byte order mark):

A Unicode character used to signal the byte order of a text file or stream

CPM:

Critical path method

GEDCOM (GEnealogical Data COMmunications):

A genealogical software interchange format

GUI:

Graphical user interface

MDS:

Multidimensional scaling

OR:

Operations research

SN5:

Network data set on social networks prepared for Viszards session at Sunbelt XXVIII, 2008

SNA:

Social network analysis

STRAN:

STRuctural ANalysis

SVG (Scalable Vector Graphics):

A WWW picture format

Unicode:

The name of the international character set

VOS:

Visualization of similarities

VR:

Virtual reality

Tool’s ID Card

  • Tool name, title: Pajek and PajekXXL, program for analysis and visualization of large networks

  • Creation year: November 1996

  • Authors: Vladimir Batagelj and Andrej Mrvar

  • Range: general network problems with emphasis on large networks

  • Copyright: free for...

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  • Ahmed A, Batagelj V, Fu X, Hong S-H, Merrick D, Mrvar A (2007) Visualisation and analysis of the Internet movie database. In: Asia-Pacific symposium on visualisation 2007, Sydney, Australia, 5–7 February 2007 (IEEE Cat. No. 07EX1615), pp 17–24

    Google Scholar 

  • Batagelj V (1987) Data structure graph. Eight Yugoslav seminar on graph theory, Novi Sad, 17–18 Apr 1987. Institute of Mathematics, Novi Sad, p 4

    Google Scholar 

  • Batagelj V (1994) Semirings for social networks analysis. J Math Sociol 19(1):53–68

    Article  MathSciNet  MATH  Google Scholar 

  • Batagelj V (1997) Notes on blockmodeling. Soc Netw 19:143–155

    Article  Google Scholar 

  • Batagelj V (2003) Efficient algorithms for citation network analysis. http://arxiv.org/abs/cs.DL/0309023

  • Batagelj V, Brandes U (2005) Efficient generation of large random networks. Phys Rev E 71(3 Part 2):036113, 1–5

    Article  Google Scholar 

  • Batagelj V, Cerinšek M (2013) On bibliographic networks. Scientometrics 96(3):845–864

    Article  Google Scholar 

  • Batagelj V, Mrvar A (1998) Pajek: a program for large network analysis. Connections 21(2):47–57

    Google Scholar 

  • Batagelj V, Mrvar A (2000) Some analyses of Erdös collaboration graph. Soc Netw 22:173–186

    Article  Google Scholar 

  • Batagelj V, Mrvar A (2001) A subquadratic triad census algorithm for large sparse networks with small maximum degree. Soc Netw 23(3):237–243

    Article  Google Scholar 

  • Batagelj V, Mrvar A (2003) Density based approaches to network analysis: analysis of Reuters terror news network. In: Workshop on link analysis for detecting complex behavior (LinkKDD2003), Washington, DC, 27 Aug 2003. http://www-2.cs.cmu.edu/~dunja/LinkKDD2003/papers/Batagelj.pdf

  • Batagelj V, Mrvar A (2008) Analysis of kinship relations with Pajek. Soc Sci Comput Rev 26(2):224–246

    Article  Google Scholar 

  • Batagelj V, Praprotnik S (2016) An algebraic approach to temporal network analysis based on temporal quantities. Soc Netw Anal Min 6(1):1–22

    Article  MATH  Google Scholar 

  • Batagelj V, Zaveršnik M (2007) Short cycle connectivity. Discret Math 307(3–5):310–318

    Article  MathSciNet  MATH  Google Scholar 

  • Batagelj V, Zaveršnik M (2011) Fast algorithms for determining (generalized) core groups in social networks. Adv Data Anal Classif 5(2):129–145

    Article  MathSciNet  MATH  Google Scholar 

  • Batagelj V, Doreian P, Ferligoj A (1992a) An optimizational approach to regular equivalence. Soc Netw 14(1–2):121–135

    Article  Google Scholar 

  • Batagelj V, Ferligoj A, Doreian P (1992b) Direct and indirect methods for structural equivalence. Soc Netw 14(1–2):63–90

    Article  Google Scholar 

  • Batagelj V, Mrvar A, Zaveršnik M (1999) Partitioning approach to visualization of large graphs. In: Graph drawing, 1999, Stiřin Castle, Czech Republic, September 1999. Lecture notes in computer science, vol 1731/1999. Springer, Berlin, Heidelberg, pp 90–97

    Google Scholar 

  • Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp. https://doi.org/10.1088/1742–5468/2008/10/P10008

  • Brusco M, Doreian P, Mrvar A, Steinley D (2011) Two algorithms for relaxed structural balance partitioning: linking theory, models, and data to understand social network phenomena. Sociol Methods Res 40:57–87

    Article  MathSciNet  Google Scholar 

  • Burt RS (1992) Structural holes. The social structure of competition. Harvard University Press, Cambridge

    Google Scholar 

  • Cormen T, Leiserson C, Rivest R (1990) Introduction to algorithms. McGraw-Hill, New York

    MATH  Google Scholar 

  • Doreian P, Mrvar A (1996) A partitioning approach to structural balance. Soc Netw 18:149–168

    Article  Google Scholar 

  • Doreian P, Mrvar A (2009) Partitioning signed social networks. Soc Netw 31(1):1–11

    Article  MATH  Google Scholar 

  • Doreian P, Mrvar A (2014) Testing two theories for generating signed networks using real data. Adv Methodol Stat 11:31–63. Faculty of Social Sciences, Ljubljana

    Google Scholar 

  • Doreian P, Mrvar A (2015) Structural balance and signed international relations. J Soc Struct 16. Carnegie Mellon University, Pittsburgh, 1–49

    Google Scholar 

  • Doreian P, Mrvar A (2016) Identifying fragments in networks for structural balance and tracking the levels of balance over time. Connections 35(2):6–18

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Doreian P, Batagelj V, Ferligoj A (2004) Generalized blockmodeling of two-mode network data. Soc Netw 26(1):29–53

    Article  Google Scholar 

  • Doreian P, Lloyd P, Mrvar A (2013) Partitioning large signed two-mode networks: problems and prospects. Soc Netw 35:178–203

    Article  Google Scholar 

  • Ferligoj A, Batagelj V (1983) Some types of clustering with relational constraints. Psychometrika 48(4):541–552

    Article  MathSciNet  MATH  Google Scholar 

  • Hamberger K (2016) Puck – program for the use and computation of kinship data. http://www.kintip.net

  • Harary F, Norman RZ, Cartwright D (1965) Structural models: an introduction to the theory of directed graphs. Wiley, New York

    MATH  Google Scholar 

  • Hill RA, Dunbar RIM (2002) Social network size in humans. Hum Nat 14(1):53–72

    Article  Google Scholar 

  • Hummon NP, Doreian P (1989) Connectivity in a citation network: the development of DNA theory. Soc Netw 11:39–63

    Article  Google Scholar 

  • Kleinberg J (1998) Authoritative sources in a hyperlinked environment. In: Proceedings of 9th ACM-SIAM symposium on discrete algorithms, San Francisco, pp 668–677. http://www.cs.cornell.edu/home/kleinber/auth.ps

  • Leydesdorff L (2016) Web site: http://www.leydesdorff.net/

  • Liu JS, Lu LYY (2012) An integrated approach for main path analysis: development of the Hirsch index as an example. J Am Soc Inf Sci Technol 63:528–542

    Article  Google Scholar 

  • McCabe T (2003) Computer science approaches: visualization tools and software metrics. In: Survey automation. NAP, Washington, DC, pp 116–136

    Google Scholar 

  • Mrvar A, Doreian P (2009) Partitioning signed two-mode networks. J Math Sociol 33(3):196–221

    Article  MATH  Google Scholar 

  • Pennock DM et al (2002) Winners don’t take all. PNAS 99(8):5207–5211

    Article  MATH  Google Scholar 

  • Peterson JL (1981) Petri net theory and the modeling of systems. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  • Rotta R, Noack A (2011) Multilevel local search algorithms for modularity clustering. J Exp Algorithmics 16:2.3

    Article  MathSciNet  MATH  Google Scholar 

  • Schvaneveldt RW, Dearholt DW, Durso FT (1988) Graph theoretic foundations of pathfinder networks. Comput Math Appl 15(4):337–345

    Article  MathSciNet  MATH  Google Scholar 

  • Seidman SB (1983) Network structure and minimum degree. Soc Netw 5:269–287

    Article  MathSciNet  Google Scholar 

  • Tarjan RE (1983) Data structures and network algorithms. Society for Industrial and Applied Mathematics, Philadelphia

    Book  MATH  Google Scholar 

  • VOSviewer web site: http://www.vosviewer.com/

  • Waltman L, van Eck NJ, Noyons ECM (2010) A unified approach to mapping and clustering of bibliometric networks. J Informetr 4:629–635

    Article  Google Scholar 

  • White D (2016) Web site: http://eclectic.ss.uci.edu/~drwhite/

  • White DR, Batagelj V, Mrvar A (1999) Analyzing large kinship and marriage networks with graph and Pajek. Soc Sci Comput Rev 17(3):245–274

    Article  Google Scholar 

  • Zaveršnik M, Batagelj V (2004) Islands, slides from Sunbelt XXIV, Portorož, 12–16 May 2004. http://vlado.fmf.uni-lj.si/pub/networks/doc/sunbelt/islands.pdf

Recommended Reading

Download references

Acknowledgments

The work was supported in part by the ARRS, Slovenia, grant P1-0294, as well as by grant N1-0011 within the EUROCORES Programme EUROGIGA (project GReGAS) of the European Science Foundation.

Author information

Authors and Affiliations

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

    Vladimir Batagelj

  2. Faculty of Social Sciences, University of Ljubljana, 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

Corresponding author

Correspondence to Andrej Mrvar .

Editor information

Editors and Affiliations

  1. Computer Science, University of Calgary, Calgary, Alberta, Canada

    Reda Alhajj

  2. University of Calgary Computer Science, Calgary, Canada

    Jon Rokne

Section Editor information

  1. Department of Theoretical Computer Science, Institute of Mathematics, Physics and Mechanics, Jadranska 19, 1000, Ljubljana, Slovenia

    Vladimir Batagelj

  2. University of Primorska, Andrej Marušič Institute, Koper, Slovenia

    Vladimir Batagelj

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media LLC

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Batagelj, V., Mrvar, A. (2018). Pajek and PajekXXL. In: Alhajj, R., Rokne, J. (eds) Encyclopedia of Social Network Analysis and Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7163-9_310-1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-7163-9_310-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-7163-9

  • Online ISBN: 978-1-4614-7163-9

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation