Definitions, network representations, program Pajek
- representation (matrix, graph)
- Types of networks
- undirected networks
- directed networks
- mixed networks
- 2-mode networks
- Size and density
- small and large networks
- sparse and dense networks
- network density
- Program Pajek
- description of networks in input file
- arcs, edges
- arcslist, edgeslist
- other formats
- interactive definition of networks
- network layouts
- automatic drawing
- manual drawing
Definition of networks in input file, interactive definitions of selected network,
getting layouts in program Pajek.
Each student gets his/her own network.
Detailed instructions to complete the first assignment:
Enter the network in Pajek NET format.
In network there should be only arcs, there are NO edges.
Bidirectional arcs SHOULD NOT be transformed to edges!
Write the question that generates your network.
Draw the network nicely using automatic and manual drawing.
Include the picture in the report.
Find out the total number of arcs and the density of the network.
Interprete the results: using layout only try to find basic characteristics
of the network: who are the most important (central) students?
Are there any groups of densely connected students? Isolated students?
Are there any differences according to gender? Etc.
Later, during the course, we will be able to compute all these characteristics,
and at that time we will check if our conclusions obtained
from the layout only were correct or not (sometimes the picture can be misleading).
Additionally to printed report next week students should bring their NET files as well.
NET files should be named according to their surnames (e.g. Smith.net).
Professor will use that file to check if the network was entered correctly and
if results computed in all assignments are correct.
Slides Pajek 2.05 (PDF)
Slides - the latest version of Pajek (PDF)
Test networks (ZIP)