Newcomb fraternity (UCINET)
Data from 1956, 17 students who do not know each other.
They came to the off-campus (fraternity) of University of Michigan.
Each student ranked all others with ranks 1...16 according to 'liking'.
Rank 1 means the highest liking, 16 the highest disliking.
The ranking was done in 15 weeks (files newc0 to newc15),
rankings for week 9 are missing.
Network in week 0:
<![CDATA[
A B C D E F G H I J K L M N O P Q
A 0 7 12 11 10 4 13 14 15 16 3 9 1 5 8 6 2
B 8 0 16 1 11 12 2 14 10 13 15 6 7 9 5 3 4
C 13 10 0 7 8 11 9 15 6 5 2 1 16 12 4 14 3
D 13 1 15 0 14 4 3 16 12 7 6 9 8 11 10 5 2
E 14 10 11 7 0 16 12 4 5 6 2 3 13 15 8 9 1
F 7 13 11 3 15 0 10 2 4 16 14 5 1 12 9 8 6
G 15 4 11 3 16 8 0 6 9 10 5 2 14 12 13 7 1
H 9 8 16 7 10 1 14 0 11 3 2 5 4 15 12 13 6
I 6 16 8 14 13 11 4 15 0 7 1 2 9 5 12 10 3
J 2 16 9 14 11 4 3 10 7 0 15 8 12 13 1 6 5
K 12 7 4 8 6 14 9 16 3 13 0 2 10 15 11 5 1
L 15 11 2 6 5 14 7 13 10 4 3 0 16 8 9 12 1
M 1 15 16 7 4 2 12 14 13 8 6 11 0 10 3 9 5
N 14 5 8 6 13 9 2 16 1 3 12 7 15 0 4 11 10
O 16 9 4 8 1 13 11 12 6 2 3 5 10 15 0 14 7
P 8 11 15 3 13 16 14 12 1 9 2 6 10 7 5 0 4
Q 9 15 10 2 4 11 5 12 3 7 8 1 6 16 14 13 0
]]>
We can recode this data to get signed graphs in several ways:
- rocoding (files New1*.net):
1, 2, 3 -> 1 (likes)
14, 15, 16 -> -1 (does not like)
4, 5, 6, 7, 8, 9, 10, 11, 12, 13 -> 0.
- recoding (files New2*.net):
1, 2, 3 -> 1 (likes)
15, 16 -> -1 (does not like)
4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 -> 0.
- recoding (files New3*.net):
1, 2, 3, 4 -> 1 (likes)
14, 15, 16 -> -1 (does not like)
5, 6, 7, 8, 9, 10, 11, 12, 13 -> 0.
Newcomb, T. (1962):
The acquaintance process. New York: Holt. Reinhart & Winston.
Recoded networks (newcomb.zip)
|