parker_asher_classrooms — Parker and Asher elementary school friendships (1993)
- Description
Friendships among the children of three elementary school classes, from the study of J. G. Parker and S. R. Asher, who collected network data from 881 children in 36 classrooms of the third, fourth and fifth grades in five public elementary schools in the US Midwest. Each child was given a roster of the children in the class, and was asked to choose his or her "very best friend", three "best friends", and an unlimited number of "friends". C. J. Anderson, S. Wasserman and B. Crouch (1999) selected three of the classrooms, one of each grade, and ignored the distinctions between the types of friendship. The data were distributed by L. C. Freeman on his network data page at the University of California, Irvine (no longer online), from which this version was obtained via the Internet Archive.
third,fourth,fifth: the classrooms of the third, fourth and fifth grades.
A directed edge (i, j) indicates that child i named child j as a very best friend, best friend or friend.
The networks have the following properties:
- Nodes:
boy, whether the child is a boy.
- Tags
- Social Offline Unweighted Metadata
- Citation
-
- J. G. Parker, S. R. Asher, "Friendship and friendship quality in middle childhood: Links with peer group acceptance and feelings of loneliness and social dissatisfaction." Developmental Psychology 29(4), 611-621 (1993) 10.1037/0012-1649.29.4.611 Sci-Hub
- C. J. Anderson, S. Wasserman, B. Crouch, "A p* primer: logit models for social networks." Social Networks 21(1), 37-66 (1999) 10.1016/S0378-8733(98)00012-4 Sci-Hub
- Upstream URL OK
- https://web.archive.org/web/20210115130726/http://moreno.ss.uci.edu/data.html#children
- Networks
-
Tip: click on a column header to sort the list, or hover over it for a description.
Column legend
- $\left<k\right>$
- Mean degree
- $\sigma_k$
- Standard deviation of the degrees
- $\lambda_h$
- Largest eigenvalue of the Hashimoto (non-backtracking) matrix
- $\tau$
- Random walk mixing time
- $r$
- Degree assortativity
- $c$
- Global clustering coefficient
- $\oslash$
- (Pseudo-) diameter
- $S$
- Relative size of the largest component
- NPs
- Node properties
- EPs
- Edge properties
Name Nodes Edges $\left<k\right>$ $\sigma_k$ $\lambda_h$ $\tau$ $r$ $c$ $\oslash$ $S$ Kind Mode NPs EPs gt GraphML GML csv third 22 177 8.05 5.40 11.31 2.28 0.04 0.68 2 1.00 Directed Unipartite boy 1 KiB 1 KiB 1 KiB 1 KiB fourth 24 161 6.71 2.53 8.44 5.13 -0.11 0.59 3 1.00 Directed Unipartite boy 1 KiB 1 KiB 1 KiB 1 KiB fifth 22 103 4.68 3.47 7.15 12.59 0.28 0.61 4 1.00 Directed Unipartite boy 1 KiB 1 KiB 1 KiB 1 KiB