Bird – Networks & Grades
42
A
PPENDIX
2:
D
ISTANCE
--------------------------------------------------------------------------------
Type of data: ADJACENCY
Nearness transform: NONE
Input dataset: C:\Documents and Settings\Pooky\My Documents\Boston Univ\Fall 2003\MB 874
Network Analysis\grades social networks paper\1-7-04 data manipulations\entire_dich-1.2.3\Entire matrix
dich123
For each pair of nodes, the algorithm finds the # of edges in the shortest path between them.
Average distance (among reachable pairs) =
7.654
Distance-based cohesion =
0.063
(range 0 to 1; larger values indicate greater cohesiveness)
Distance-weighted Fragmentation =
0.937
A
PPENDIX
3:
D
ESCRIPTIVE
S
TATISTICS
N = 198 describes survey respondents only
N = 294 describes survey respondents and non-respondents; entire class
Student Year
(all students)
N = 294
Freshman
Sophomore
Junior
Senior
20.8%
55.8%
16.2%
7.2%
Motivation
(resp.’s only)
N = 198
10
9
8
7
6
5
4
3
2
1
24.9%
30.5%
25.4%
10.6%
4.1%
2.0%
0.5%
2.0%
0%
0%
Student Grade
(all students)
N = 294
A
A-
B+
B
B-
C+
C
C-
D
13.2%
16.8%
19.3%
16.2%
14.2%
9.2%
7.6%
1.0%
2.5%
Affiliation
(resp.’s only)
N = 198
None
Republican
Democrat
Green
Libertarian
Communist
30.3%
14.6%
50.7%
2.4%
1.5%
0.5%
Connections Between Students
total
%
total cells
(total potential connections between all students)
86436
100.000
"1's" (minimal)
209
0.241
"2's" (medium)
227
0.263
"3's" (intense)
126
0.146