##Intorduction This document looks at the topic of network analysis. In particular, it tries to answer the following question, “Do you like to work with your coworker?” This question was given a 1 for yes and 0 for no. The data that was analyzed came from the sociogram-employees-un.csv, which came from the R-Exercises website. This document also uses techniques that were mentioned in chapter 20.

soc <- graph.adjacency(as.matrix(sociogram), mode="directed")
V(soc)$name <- LETTERS[1:NCOL(sociogram)]
V(soc)$color <- "orange"
V(soc)$shape <- "circle"
E(soc)$color <- "black"
E(soc)$arrow.size <- 0.2
plot(soc)

data.frame(V(soc)$name,degree(soc)) 
##   V.soc..name degree.soc.
## A           A          23
## B           B          24
## C           C          20
## D           D          31
## E           E          20
## F           F          17
## G           G          23
## H           H          19
## I           I          26
## J           J          19
## K           K          26
## L           L          25
## M           M          17
## N           N          26
## O           O          22
## P           P          22
## Q           Q          22
## R           R          20
## S           S          19
## T           T          15
## U           U          22
## V           V          29
## W           W          21
## X           X          25
## Y           Y          21
data.frame(V(soc)$name,betweenness(soc)) 
##   V.soc..name betweenness.soc.
## A           A        14.502778
## B           B        11.270292
## C           C         7.842857
## D           D        19.619336
## E           E        12.630375
## F           F         4.927597
## G           G        15.974206
## H           H         8.464286
## I           I        24.039286
## J           J         8.769444
## K           K        14.848485
## L           L        16.810390
## M           M         4.822222
## N           N        29.663961
## O           O        16.949657
## P           P        13.821663
## Q           Q         9.975433
## R           R         7.228211
## S           S         4.923413
## T           T         5.193651
## U           U        18.105610
## V           V        17.816739
## W           W         7.581602
## X           X        20.760967
## Y           Y         9.457540

Conclusion

It was shown that the the group with the highest degree and and the group with the highest betweenness were different. It was shown that the group with the highest degree, or number of edges was Person V, which had a total of 29 edges. This was a good indication that person V was connected to 29 other people. This could indicate that person v is either a popular person to work with, or is someone that nobody likes at to work with. In regards to the betweenness, it was shown that person N had the highest value with 29.66. This indicated that person N has the greatest graph connectivity, and that it has quite an influence over the connections that occur with other nodes. Overall, while person V was the most connected person, person N had the highest influence over which nodes connected to other nodes.