| node type: | person |
| edge type: | is friend of |
| number of nodes: | 33 |
| number of edges: | 147 |
| source: | Pajek project, http://vlado.fmf.uni-lj.si/pub/networks/data/ |
| data: | Hitech.txt |
Only the edge-repulsion LinLog drawing clearly shows that there are two groups of friends – the left group around Chris and Rick and the right group around Steve and Irv – which are mainly connected by Upton and Dan. The other two drawings mainly cluster together nodes with high degree (i.e., people with many friends). In all drawings, double edges correspond to reciprocated relationships, single edges to non-reciprocated relationships.
![]() |
| Edge-repulsion LinLog model |
![]() |
![]() |
| Fruchterman-Reingold model (for comparison) | Node-repulsion LinLog model (for comparison) |
| back |