This lab will examine how to measure individuals’ perceived structure of social networks (cognitive social structures or CSS) and how to analyze these perceptions, drawing on notions of structural equivalence and quadratic assignment procedure discussed in class.
We will be using the Krackhardt’s Advice and Friendship data sets. 1 This is the data set reported in Krackhardt, D. (1987) “Cognitive Social Structures,” Social Networks, 9: 109—34. Reading that paper before carrying out the analysis is strongly recommended. The 21 respondents are managers in a company.
There are four sections to this lab below: CSS analysis, visualization, structural equivalence, and differences and correlation. We are not looking for an essay response to every question, but you should succinctly convey that you understand how to interpret and make inferences based on the outputs from these analyses.
This assignment is designed to use the sna package in the R statistical programming language.2 See Butts, Carter T., sna: Tools for Social Network Analysis, R package version 2.4.; see also ?? sna for documentation and Butts, Carter T. (2008). “Social Network Analysis with sna.” Journal of Statistical Software, 24(6). You are provided the RData file. krackhardt_css_data.RData
Our visualization for this exercise will be done using ggnet2,3 Moritz Marbach and Francois Briatte, with help from Heike Hoffmann, Pedro Jordano and Ming-Yu Liu; see ?? ggnet2. a visualization package which applies the visualization framework developed in ggplot2, an up-and-coming visualization framework created by RStudio that is well on its way to being recognized as the professional standard in R visualization.4 See ?? ggplot2, and the tidyverse website.
Because you will not be collecting data in this lab, feel free to knit early and often to see how your responses are being formatted! Please do your best to maintain the formatting provided by this assignment. It makes grading significantly easier when answers are easy to read.
Download all the files for this lab and save them in the same folder. Open the CSS_Lab.R file in RStudio (File > Open). After the R script is loaded in the editor, set the working directory so that R knows where to find the RData file you are going to load (Session > Set Working Directory > To Source File Location).
The data file krackhardt_css_data.RData consists of two CSS data objects:
● advice_nets: respondents’ perceptions about their own and others’ advice ties within the organization
● friendship_nets: respondents’ perceptions about their own and others’ friendship ties within the organization
We’ll begin by viewing an example response matrix. Notice that this is a binary sociomatrix.
Advice Matrix Table
| V1 | V2 | V3 | V4 | V5 | V6 | V7 | V8 | V9 | V10 | V11 | V12 | V13 | V14 | V15 | V16 | V17 | V18 | V19 | V20 | V21 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 0 |
| 2 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 |
| 3 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 |
| 4 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 |
| 5 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 6 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 |
| 7 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 |
| 8 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 |
| 9 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 |
| 10 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 |
| 11 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 |
| 12 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 |
| 13 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 |
| 14 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 |
| 15 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 |
| 16 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
| 17 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 |
| 18 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 19 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 |
| 20 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 |
| 21 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 |
The advice_nets and friendship_nets objects are R lists that each contain 21 networks, one for each respondent’s perception about what the advice and friendship networks look like. Let’s view the characteristics of a sample friendship network. We’ll visualize the ties within that network in the next Part.
Individual Respondent Network
| V1 | V2 | V3 | V4 | V5 | V6 | V7 | V8 | V9 | V10 | V11 | V12 | V13 | V14 | V15 | V16 | V17 | V18 | V19 | V20 | V21 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| V1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| V2 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 |
| V3 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| V4 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| V5 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 |
| V6 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| V7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| V8 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 |
| V9 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| V10 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| V11 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| V12 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 |
| V13 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| V14 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| V15 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| V16 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| V17 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| V18 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| V19 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| V20 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| V21 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 |
Next, we’ll aggregate the individual observations of each actor within the network into a single network. There are multiple ways to do so. Each presents a different manner of combining the 21 responses into a single aggregated network. These include four locally aggregated structures (LAS) and one consensus aggregated structure. First, we calculate the four LAS: row, column, intersection, and union.
Friendship, Column Matrix
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 2 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 4 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 5 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 |
| 6 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 7 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 8 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 9 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 10 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 11 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 12 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 13 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 14 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 15 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 |
| 16 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 17 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 18 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 19 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 20 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 21 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
Friendship, Row
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 2 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 4 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 5 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 6 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 8 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 9 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 10 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 11 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 |
| 12 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 |
| 13 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 14 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 15 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 16 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 17 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 18 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 19 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 20 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 21 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 |
Conceptually, how do these two networks differ from one another? What are the pros and cons of using this method? Column: Answers the question, “Who is friends with you?” Row: Answers the question, “Who are you friends with?” The perception of the tie is from the perspective the tie is based on; in other words, K=i or K=j. The benefit is that these should be the most accurate perceptions in the network, and by creating a new matrix using the row or columns of all the other matrices, there should be a boon to the validity of the network. They essentially differ because they answer different questions.
Friendship Intersection
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 4 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 5 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 6 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 8 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 9 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 10 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 11 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 12 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 13 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 14 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 15 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 16 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 17 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 18 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 19 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 20 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 21 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
What information does the ‘intersection’ method capture? What are the pros and cons of using this method? Intersection LAS is only concerned with i and j agreeing a tie exists between them. When they both agree a tie exists, it exists, and conversely if either or both say there is no tie, then there is no tie. This method bolsters the reliability of the network.
Friendship Union
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 2 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 4 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 5 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 |
| 6 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 7 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 8 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 9 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 10 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 11 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 |
| 12 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 |
| 13 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 14 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 15 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 |
| 16 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 17 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 18 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 19 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| 20 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 21 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 |
What kind of information does the union method capture? What are the pros and cons of using this method? LAS union method assumes there is a tie if either i or j perceive a tie. The problem is that the tie is created even if one party does not agree, there is a tie. The benefit is that it is less stringent and allows for the interpretation of every perceived tie.
Friendship Median
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 2 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 4 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 5 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
| 6 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 7 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 8 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 9 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 10 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 11 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 12 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 13 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 14 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 15 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 16 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 17 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 18 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 19 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 20 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 21 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
What kind of information does the median measure capture? What are the pros and cons of using this method? Consensus methods require a set threshold be met before a tie is recognized as established. For example, at least 50% of the surveyed people need to say they perceive a tie between i and j before we acknowledge a tie exists. This method can lead to sparse networks like the one we see here.
Finally, we’ll also load the data for our advice network for later analysis.
ad_column <- consensus(advice_nets, mode="digraph", diag=FALSE, method="OR.col")
ad_row <- consensus(advice_nets, mode="digraph", diag=FALSE, method="OR.row")
ad_intersection <- consensus(advice_nets, mode="digraph", diag=FALSE, method="LAS.intersection")
ad_union <- consensus(advice_nets, mode="digraph", diag=FALSE, method="LAS.union")
ad_median <- consensus(advice_nets, mode="digraph", diag=FALSE, method="central.graph")
First, we’re going to define the position of the nodes on the network so that it is easier to compare edges across graphs.
Base Graph Structure
Using our initial node placement as a template, we will now visualize the ties for aggregated networks.
# If you pass ggnet2 the mode value of a matrix, it will use the first two vectors to position the nodes on their x and y axes. Thus, if we call baseLayout throughout the rest of the visualizations, the nodes will remain in place but the edges drawn between the visualizations will change.
ggnet2(fr_union_net, mode = baseLayout, label = TRUE, edge.color="red", arrow.gap = 0.03) + theme(panel.background = element_rect(fill = "#fffff8"))
Friendship, Union.
Describe what this network shows in your own words. The graph shows a perceived friendship network. This graph is using the union method which creates a tie if either i or j perceives a friendship.
Friendship, Row.
Describe what this network shows in your own words. As this is using the LAS row method. The graph seeks to answer the question, “Who are you friends with?” For example, node 20 believes they are friends with nobody, node 10 says they are friends with node 7, etc.
What are the relevant similiarities and differences between the two networks? What do they mean? Many of the ties are the same, which makes sense as the union method would keep all the same ties as the row method. Node 20 becomes an isolate in the row graph.
Choose two of the aggregated advice networks calculated above to visualize.
# Feel free to edit this portion of the code if you would like to plot different aggregated measures.
# Plot the ad_intersection network.
ad_intersect_net <- graph.adjacency(ad_intersection) # make an igraph network object from the advice intersection adjacency matrix
ggnet2(ad_intersect_net, mode = baseLayout, label = TRUE, arrow.size = 8, edge.color="pink", arrow.gap = 0.03) + theme(panel.background = element_rect(fill = "#fffff8")) # plots the advice intersection network
Advice, Intersection.
Describe what this network shows in your own words. This network graph depicts an Advice network using the LAS intersection method. The intersection method creates a tie if both i and j agree there is a tie. For example, node 9 goes to node 19 for advice, both 19 and 9 agree that 9 goes to 19 for advice.
Advice, Median.
Describe what this network shows in your own words. This graph depicts an advice network using the consensus method. A consensus network is created by creating a threshold percentage of the entire network that needs to agree there is a tie, before establishing a tie. For example, node 14 goes to 5 for advice, and 5 and 19 go to each other for advice. Each out-tie is based on the entire network being in relative agreement the tie exists
What are the relevant similiarities and differences between the two networks? What do they mean? Pretty much everyone agrees node 18 is someone to seek advice from, but 18 does not seek advice. The graphs differ more than they are similar. Consensus LAS methods are usually less stringent than intersection LAS methods.
Next, we’ll plot two of the individual self-report networks. Choose two respondents (by number, 1—21) from either advice_nets or friendship_nets, or visualize both of a single respondent’s self-reports.
Respondent 18’s Advice Network.
Respondent 18’s Friendship Network .
What respondents did you choose to visualize? Why? I chose to examine respondent 18 for both graphs because of their isolated status in previous analyses. I wanted to see if they agreed they were isolated.
What do their networks show? Can you draw any conclusions about each actor’s role in the network? It shows that node 18 believes they are indeed an isolate in the friendship network and has very little awareness of who is friends with whom; however, they believe nearly everyone goes to them for advice. I would guess that node 18 is some sort of boss. People are very rarely friends with their bosses and vice versa, but they often will seek advice from their bosses.
Finally, we’re going to plot the intersection of two networks.
Intersection of Friendship, Union, and Advice, Union.
What does this network show? Why might this visualization be useful? This network depicts any form of tie, whether it be advice or friendship. The graph is using the intersection LAS method of two matrices that have already been constructed through union LAS. This graph could be useful to see who talks to whom. As in any form of communication.
In this section, we will compute the structural equivalence among the actors using the locally aggregated structure (LAS). Based upon the exploratory visualizations you created in Part II, choose one LAS structure for both the AD and FR relation type to compute structural equivalence (e.g. ad_union and fr_union).
Outline your rationale for choosing your networks. I prefer the intersection LAS method as I feel it’s important for both parties to agree there is a tie to be considered friends. It’s not as important for understanding advice networks; however, for the sake of consistency, I will use the ad_intersection matrix as well.
Now, we’ll generate the matrices used to evaluate structural equivalence. Note that we’ll be using the Euclidean distance method.5 Hint: the way you interpret results using the Pearson correlation method and the Euclidean distance method are inverse. You should review the readings or slides from class to make sure you understand how to interpret results.
Advice SEM
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | NA | 2.83 | 3.32 | 3.00 | 3.16 | 3.16 | 3.46 | 3.00 | 3.16 | 2.65 | 2.83 | 3.16 | 3.32 | 3.61 | 3.00 | 2.00 | 3.00 | 3.61 | 3.46 | 3.32 | 4.00 |
| 2 | 2.83 | NA | 2.65 | 2.65 | 2.83 | 2.83 | 3.16 | 2.65 | 2.83 | 2.65 | 2.83 | 2.45 | 3.00 | 3.32 | 3.32 | 2.45 | 3.00 | 3.32 | 3.16 | 3.00 | 3.16 |
| 3 | 3.32 | 2.65 | NA | 2.83 | 2.65 | 2.65 | 3.00 | 2.83 | 2.24 | 2.00 | 2.24 | 2.24 | 2.45 | 2.45 | 2.45 | 2.65 | 2.45 | 3.16 | 2.24 | 2.45 | 3.61 |
| 4 | 3.00 | 2.65 | 2.83 | NA | 2.65 | 2.65 | 3.32 | 2.00 | 2.65 | 2.45 | 2.65 | 2.24 | 2.83 | 3.46 | 3.16 | 2.24 | 2.45 | 4.00 | 3.00 | 2.83 | 3.87 |
| 5 | 3.16 | 2.83 | 2.65 | 2.65 | NA | 2.83 | 3.46 | 2.24 | 2.45 | 2.24 | 2.00 | 2.45 | 2.24 | 3.00 | 3.00 | 2.45 | 2.65 | 3.61 | 2.83 | 2.24 | 3.74 |
| 6 | 3.16 | 2.83 | 2.65 | 2.65 | 2.83 | NA | 3.16 | 2.65 | 2.45 | 2.24 | 2.83 | 1.41 | 2.65 | 3.32 | 3.00 | 2.83 | 1.73 | 3.61 | 2.83 | 3.00 | 2.83 |
| 7 | 3.46 | 3.16 | 3.00 | 3.32 | 3.46 | 3.16 | NA | 3.61 | 3.46 | 3.32 | 3.16 | 3.16 | 3.61 | 3.32 | 3.61 | 3.46 | 3.32 | 3.61 | 3.74 | 3.61 | 3.46 |
| 8 | 3.00 | 2.65 | 2.83 | 2.00 | 2.24 | 2.65 | 3.61 | NA | 2.24 | 2.00 | 2.24 | 2.24 | 2.45 | 3.46 | 2.83 | 2.65 | 2.83 | 3.74 | 3.00 | 2.83 | 3.61 |
| 9 | 3.16 | 2.83 | 2.24 | 2.65 | 2.45 | 2.45 | 3.46 | 2.24 | NA | 1.73 | 2.45 | 2.00 | 1.00 | 3.00 | 1.73 | 2.45 | 2.65 | 3.61 | 2.00 | 2.24 | 3.74 |
| 10 | 2.65 | 2.65 | 2.00 | 2.45 | 2.24 | 2.24 | 3.32 | 2.00 | 1.73 | NA | 1.73 | 1.73 | 2.00 | 2.83 | 2.00 | 1.73 | 2.00 | 3.16 | 2.24 | 2.45 | 3.61 |
| 11 | 2.83 | 2.83 | 2.24 | 2.65 | 2.00 | 2.83 | 3.16 | 2.24 | 2.45 | 1.73 | NA | 2.45 | 2.65 | 3.00 | 2.65 | 2.45 | 2.65 | 3.32 | 2.83 | 2.65 | 3.74 |
| 12 | 3.16 | 2.45 | 2.24 | 2.24 | 2.45 | 1.41 | 3.16 | 2.24 | 2.00 | 1.73 | 2.45 | NA | 2.24 | 3.00 | 2.65 | 2.45 | 1.73 | 3.61 | 2.45 | 2.65 | 3.16 |
| 13 | 3.32 | 3.00 | 2.45 | 2.83 | 2.24 | 2.65 | 3.61 | 2.45 | 1.00 | 2.00 | 2.65 | 2.24 | NA | 3.16 | 2.00 | 2.65 | 2.83 | 3.74 | 2.24 | 2.45 | 3.87 |
| 14 | 3.61 | 3.32 | 2.45 | 3.46 | 3.00 | 3.32 | 3.32 | 3.46 | 3.00 | 2.83 | 3.00 | 3.00 | 3.16 | NA | 2.83 | 3.32 | 3.16 | 3.16 | 1.73 | 2.83 | 3.61 |
| 15 | 3.00 | 3.32 | 2.45 | 3.16 | 3.00 | 3.00 | 3.61 | 2.83 | 1.73 | 2.00 | 2.65 | 2.65 | 2.00 | 2.83 | NA | 2.65 | 2.83 | 3.74 | 2.24 | 2.00 | 4.12 |
| 16 | 2.00 | 2.45 | 2.65 | 2.24 | 2.45 | 2.83 | 3.46 | 2.65 | 2.45 | 1.73 | 2.45 | 2.45 | 2.65 | 3.32 | 2.65 | NA | 2.24 | 3.32 | 2.83 | 2.65 | 4.00 |
| 17 | 3.00 | 3.00 | 2.45 | 2.45 | 2.65 | 1.73 | 3.32 | 2.83 | 2.65 | 2.00 | 2.65 | 1.73 | 2.83 | 3.16 | 2.83 | 2.24 | NA | 3.74 | 2.65 | 2.83 | 3.32 |
| 18 | 3.61 | 3.32 | 3.16 | 4.00 | 3.61 | 3.61 | 3.61 | 3.74 | 3.61 | 3.16 | 3.32 | 3.61 | 3.74 | 3.16 | 3.74 | 3.32 | 3.74 | NA | 3.61 | 3.46 | 3.61 |
| 19 | 3.46 | 3.16 | 2.24 | 3.00 | 2.83 | 2.83 | 3.74 | 3.00 | 2.00 | 2.24 | 2.83 | 2.45 | 2.24 | 1.73 | 2.24 | 2.83 | 2.65 | 3.61 | NA | 2.65 | 4.00 |
| 20 | 3.32 | 3.00 | 2.45 | 2.83 | 2.24 | 3.00 | 3.61 | 2.83 | 2.24 | 2.45 | 2.65 | 2.65 | 2.45 | 2.83 | 2.00 | 2.65 | 2.83 | 3.46 | 2.65 | NA | 3.87 |
| 21 | 4.00 | 3.16 | 3.61 | 3.87 | 3.74 | 2.83 | 3.46 | 3.61 | 3.74 | 3.61 | 3.74 | 3.16 | 3.87 | 3.61 | 4.12 | 4.00 | 3.32 | 3.61 | 4.00 | 3.87 | NA |
| # Fri | endship | SEM |
Friendship SEM
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | NA | 2.45 | 2.45 | 2.24 | 2.65 | 2.65 | 2.24 | 2.00 | 2.24 | 2.24 | 2.45 | 2.00 | 2.24 | 2.24 | 2.65 | 1.73 | 2.24 | 2.24 | 3.00 | 2.24 | 2.65 |
| 2 | 2.45 | NA | 2.00 | 1.73 | 2.24 | 1.00 | 1.73 | 2.00 | 1.73 | 1.73 | 2.00 | 1.41 | 1.73 | 1.73 | 2.24 | 1.73 | 1.73 | 1.73 | 2.65 | 1.73 | 1.73 |
| 3 | 2.45 | 2.00 | NA | 1.00 | 1.73 | 1.73 | 1.00 | 1.41 | 1.00 | 1.00 | NA | 1.41 | 1.00 | 1.00 | 1.73 | 1.73 | 1.00 | 1.00 | 2.24 | 1.00 | 2.24 |
| 4 | 2.24 | 1.73 | 1.00 | NA | 1.41 | 1.41 | NA | 1.00 | NA | NA | 1.00 | 1.00 | NA | NA | 1.41 | 1.41 | NA | NA | 2.00 | NA | 2.00 |
| 5 | 2.65 | 2.24 | 1.73 | 1.41 | NA | 2.00 | 1.41 | 1.73 | 1.41 | 1.41 | 1.73 | 1.73 | 1.41 | 1.41 | NA | 2.00 | 1.41 | 1.41 | 1.41 | 1.41 | 2.45 |
| 6 | 2.65 | 1.00 | 1.73 | 1.41 | 2.00 | NA | 1.41 | 1.73 | 1.41 | 1.41 | 1.73 | 1.73 | 1.41 | 1.41 | 2.00 | 2.00 | 1.41 | 1.41 | 2.45 | 1.41 | 1.41 |
| 7 | 2.24 | 1.73 | 1.00 | NA | 1.41 | 1.41 | NA | 1.00 | NA | NA | 1.00 | 1.00 | NA | NA | 1.41 | 1.41 | NA | NA | 2.00 | NA | 2.00 |
| 8 | 2.00 | 2.00 | 1.41 | 1.00 | 1.73 | 1.73 | 1.00 | NA | 1.00 | 1.00 | 1.41 | 1.41 | 1.00 | 1.00 | 1.73 | 1.00 | 1.00 | 1.00 | 2.24 | 1.00 | 2.24 |
| 9 | 2.24 | 1.73 | 1.00 | NA | 1.41 | 1.41 | NA | 1.00 | NA | NA | 1.00 | 1.00 | NA | NA | 1.41 | 1.41 | NA | NA | 2.00 | NA | 2.00 |
| 10 | 2.24 | 1.73 | 1.00 | NA | 1.41 | 1.41 | NA | 1.00 | NA | NA | 1.00 | 1.00 | NA | NA | 1.41 | 1.41 | NA | NA | 2.00 | NA | 2.00 |
| 11 | 2.45 | 2.00 | NA | 1.00 | 1.73 | 1.73 | 1.00 | 1.41 | 1.00 | 1.00 | NA | 1.41 | 1.00 | 1.00 | 1.73 | 1.73 | 1.00 | 1.00 | 2.24 | 1.00 | 2.24 |
| 12 | 2.00 | 1.41 | 1.41 | 1.00 | 1.73 | 1.73 | 1.00 | 1.41 | 1.00 | 1.00 | 1.41 | NA | 1.00 | 1.00 | 1.73 | 1.00 | 1.00 | 1.00 | 2.24 | 1.00 | 2.24 |
| 13 | 2.24 | 1.73 | 1.00 | NA | 1.41 | 1.41 | NA | 1.00 | NA | NA | 1.00 | 1.00 | NA | NA | 1.41 | 1.41 | NA | NA | 2.00 | NA | 2.00 |
| 14 | 2.24 | 1.73 | 1.00 | NA | 1.41 | 1.41 | NA | 1.00 | NA | NA | 1.00 | 1.00 | NA | NA | 1.41 | 1.41 | NA | NA | 2.00 | NA | 2.00 |
| 15 | 2.65 | 2.24 | 1.73 | 1.41 | NA | 2.00 | 1.41 | 1.73 | 1.41 | 1.41 | 1.73 | 1.73 | 1.41 | 1.41 | NA | 2.00 | 1.41 | 1.41 | 1.41 | 1.41 | 2.45 |
| 16 | 1.73 | 1.73 | 1.73 | 1.41 | 2.00 | 2.00 | 1.41 | 1.00 | 1.41 | 1.41 | 1.73 | 1.00 | 1.41 | 1.41 | 2.00 | NA | 1.41 | 1.41 | 2.45 | 1.41 | 2.45 |
| 17 | 2.24 | 1.73 | 1.00 | NA | 1.41 | 1.41 | NA | 1.00 | NA | NA | 1.00 | 1.00 | NA | NA | 1.41 | 1.41 | NA | NA | 2.00 | NA | 2.00 |
| 18 | 2.24 | 1.73 | 1.00 | NA | 1.41 | 1.41 | NA | 1.00 | NA | NA | 1.00 | 1.00 | NA | NA | 1.41 | 1.41 | NA | NA | 2.00 | NA | 2.00 |
| 19 | 3.00 | 2.65 | 2.24 | 2.00 | 1.41 | 2.45 | 2.00 | 2.24 | 2.00 | 2.00 | 2.24 | 2.24 | 2.00 | 2.00 | 1.41 | 2.45 | 2.00 | 2.00 | NA | 2.00 | 2.83 |
| 20 | 2.24 | 1.73 | 1.00 | NA | 1.41 | 1.41 | NA | 1.00 | NA | NA | 1.00 | 1.00 | NA | NA | 1.41 | 1.41 | NA | NA | 2.00 | NA | 2.00 |
| 21 | 2.65 | 1.73 | 2.24 | 2.00 | 2.45 | 1.41 | 2.00 | 2.24 | 2.00 | 2.00 | 2.24 | 2.24 | 2.00 | 2.00 | 2.45 | 2.45 | 2.00 | 2.00 | 2.83 | 2.00 | NA |
Take a moment to compare the structural equivalence matrices (SEM) for the advice and friendship networks that you analyzed. You might want to refer to previous visualizations. Notice that it’s challenging to decode this information visually in matrix form, even for a relatively small network. We’ll search the matrix programmatically to understand more about it.
Next, we will identify the two nodes with the highest and lowest SEM Euclidean distance in each matrix as well as the mean value of distance across both networks.
## [1] "Friendship SEM"
## row col
## 6 6 2
## 4 4 3
## 7 7 3
## 9 9 3
## 10 10 3
## 13 13 3
## 14 14 3
## 17 17 3
## 18 18 3
## 20 20 3
## 3 3 4
## 8 8 4
## 11 11 4
## 12 12 4
## 2 2 6
## 3 3 7
## 8 8 7
## 11 11 7
## 12 12 7
## 4 4 8
## 7 7 8
## 9 9 8
## 10 10 8
## 13 13 8
## 14 14 8
## 16 16 8
## 17 17 8
## 18 18 8
## 20 20 8
## 3 3 9
## 8 8 9
## 11 11 9
## 12 12 9
## 3 3 10
## 8 8 10
## 11 11 10
## 12 12 10
## 4 4 11
## 7 7 11
## 9 9 11
## 10 10 11
## 13 13 11
## 14 14 11
## 17 17 11
## 18 18 11
## 20 20 11
## 4 4 12
## 7 7 12
## 9 9 12
## 10 10 12
## 13 13 12
## 14 14 12
## 16 16 12
## 17 17 12
## 18 18 12
## 20 20 12
## 3 3 13
## 8 8 13
## 11 11 13
## 12 12 13
## 3 3 14
## 8 8 14
## 11 11 14
## 12 12 14
## 8 8 16
## 12 12 16
## 3 3 17
## 8 8 17
## 11 11 17
## 12 12 17
## 3 3 18
## 8 8 18
## 11 11 18
## 12 12 18
## 3 3 20
## 8 8 20
## 11 11 20
## 12 12 20
## [1] "Min. Value:"
## [1] 1
## row col
## 19 19 1
## 1 1 19
## [1] "Max Value:"
## [1] 3
## [1] "Mean Value:"
## [1] 1.65588
## [1] "Advice SEM"
## row col
## 13 13 9
## 9 9 13
## [1] "Min. Value:"
## [1] 1
## row col
## 21 21 15
## 15 15 21
## [1] "Max. Value:"
## [1] 4.123106
## [1] "Mean Value:"
## [1] 2.847543
How do you interpret high and low values in this matrix, calculated using Euclidean distance? High Euclidean distance means that the nodes are farther apart, or in this case, they are farther from being structurally equivalent.
Which network has the smallest minimum distance between nodes? Why might that be? You may want to refer to your earlier visualizations for more insight into the network. Both networks have the same smallest min distance between nodes (min = 1).
Which network has the greatest maximum distance between nodes? Why might that be? The advice network has the greatest maximum distance between nodes (max = 4.1). This is probably because the data is based on advice. Structural equivalence is the extent two nodes communicate with the same people. Advice is something that is usually highly specific and doesn’t generalize very well. For example, one node may be a boss of one department; that department would go to the boss node for advice, but probably not to another department’s boss for advice.
Which network exhibits more structural equivalence? Based on the mean values, the friendship network exhibits more structural equivalence. This makes sense based on my hypothesis of advice networks and boss nodes.
Now we will perform the QAP analysis on the advice networks by looping over every network in the list of networks and compare it against the median network we created in Part I. Let’s take a look at one of those values.
##
## QAP Test Results
##
## Estimated p-values:
## p(f(perm) >= f(d)): 0
## p(f(perm) <= f(d)): 1
##
## Test Diagnostics:
## Test Value (f(d)): 0.280373
## Replications: 1000
## Distribution Summary:
## Min: -0.2120312
## 1stQ: -0.04389317
## Med: 0.004146261
## Mean: -0.001414304
## 3rdQ: 0.04017584
## Max: 0.2083139
The summary of the QAP test includes a number of values:
Estimated p-values: These estimate the probability of observing the test statistic (graph correlation in this instance) value. Qaptest will show both the probability of observing a value higher than or lower than the value observed. If the correlation is substantially higher than zero, these values will often be 1 and 0. This means that, during the QAP process no value was observed that was higher (or potentially lower) than the observed value. To confirm this, look at the Min/Max values in the distribution summary (see below).
Test value: This is the observed correlation between the two graphs.
Distribution summary: This summarizes the distribution of values calculated during the QAP process.
Look over the results that R printed to the console. Each result should begin with the respondent’s index number. Below, we’ll summarize the results of the correlation between the consensus network and each of our 21 respondents.
| 1 | 0.28 |
| 2 | 0.52 |
| 3 | 0.49 |
| 4 | 0.69 |
| 5 | 0.49 |
| 6 | 0.49 |
| 7 | 0.56 |
| 8 | 0.54 |
| 9 | 0.53 |
| 10 | 0.55 |
| 11 | 0.45 |
| 12 | 0.47 |
| 13 | 0.62 |
| 14 | 0.49 |
| 15 | 0.58 |
| 16 | 0.70 |
| 17 | 0.47 |
| 18 | 0.39 |
| 19 | 0.49 |
| 20 | 0.46 |
| 21 | 0.48 |
Examining the results from above, which respondent’s perceptions were the most/least “accurate” when compared to the median response (assuming the consensus is the ground truth)?6 Hint: look for the strongest correlation between the respondent’s network and the median network. Node 16 has a correlation of .7, followed closely by node 4 with a correlation of .69.
Let’s plot the QAP distribution for our advice networks.
Advice QAP
Based on the results of the QAP test, is the most accurate observer’s correlation with the consensus network significant or spurious? How does the graph above help you make that determination? Where would you draw a vertical line? The observer’s correlation is most definitely significant. The majority of the randomly grenerated networks falls on 0; however, all the p values for the QAP tests were 1. The line would be drawn far to the right, at the .7 mark as the line should be based on the observed score.
We will repeat this process for friendship networks. Take a look at your console output to answer the following question.
Are the results for the friendship network very similar or different from those you saw in the advice networks? Give some possible reasons why individuals have more precise representations of one kind of relation structure than another kind of relation structure. The results of the consensus advice network are significant. That is, according to QAP, the ties are probably not caused by random chance. That said, the overall test stats are quite a bit lower for the advice network than the friendship network. I think that people perceive friendship much easier than advice because advice seeking frequently happens in privacy.
Next, we will investigate the correlation between various centrality measures and the union consensus network.
## Correlation with Degree Centrality: 0.214675
## Correlation with Betweennesss Centrality: 0.1479718
## Correlation with Closeness Centrality: 0.3286186
## Correlation with Eigenvector Centrality: 0.08114582
Which centrality score of individuals in the consensus network are most highly correlated with their accuracy in predicting the consensus network? Based on the readings, suggest a rationale why individuals’ embeddedness or patterning of ties might result in different perceptions. # Identifying Most and Least Similar Respondent Viewpoints (I merged two questions.)
The correlation with closeness centrality is the highest. This is intuitive as closeness centrality is based on the sum of the length of the shortest paths between the person-node and all others in the network; in other words, closeness centrality can predict people’s ability to perceive ties inn advice or friendship network because when closeness centrality is high in one node, that node is close to others. Degree centrality is the second best correlated centrality. This is also intuitive as degree centrality is based on how connected the network is, the more connected the better sense people would have of who is connected to whom. A node with high betweennness centrality would have a limited perspective on the network as a whole, but a really good grasp on those they stand between. Eigenvector having a low correlation makes sense as people may know all about a popular node, but that doesn’t mean the popular node knows anything about the rest of the network. Similarly the rest of the network wouldn’t know much about each other.
Next, we’ll run the QAP test on the individual advice/friendship networks. Take a look at your console output to answer this question.
## Proportion of draws which were >= observed value: 0
## Proportion of draws which were <= observed value: 1
Which individual sees the two networks as the most similar? Which sees them as the least similar? Individual 16 sees them as being most similar as their test stat was .46. Individual sees the networks as being the most dissimilar as their test stat was only .03.
After knitting your file to R Pubs, copy the URL and paste it into the comment field of the Lab 2 Assignment on Canvas. Save this .Rmd file and submit it in the file portion of your Canvas assignment. Make sure to review your file and its formatting. Run spell check (built into RStudio) and proofread your answers before submitting.