Jupyter notebook dataset (1)/Assignment 2: Friendship Network.ipynb
Friendship Network, Part II
Cassandra Saenz, Bayard Bergmann, Pietro Bartoli, Lovely Olivier
Part 1: Complete Exploratory Analysis
Compute Local Properties
Compute Global Properties
Creating Visuals
Part 2: Programming Exploratory Analysis
Find the 3 highest betweenness values using a for or while loop that goes through the betweenness list and finds the 3 highest values (different values), stores them in a list and prints them. Then print out the number of nodes with these 3 high betweenness values. Repeat the process for clustering coefficient.
Hypotheses
Hypothesis 1 : The hamster/node with the highest degree is also the the hamster with the highest betweenness. In other words, it is the hamster with the most important connections and theoretically the one that is most crucial to the social structure of the network.
Hypothesis 2 : If hamster/node with the highest degree is removed from the graph, the average degree will diminish by 10%.
Significance
H1 : If our hypothesis is correct, we will have proved that there is a single hamster/node that is singularly the most important to the network/group of hamsters. It having the highest betweenness means that it is the best conduit for relationships between the other members of the group.
H2 : By putting a value on this specific hamster's contribution to the properties of the graph we can learn how skewed and dependent the graph is on one individual. If it is correct, it shows how the average degree of a graph can be misleading if it is heavily reliant on a small amount of nodes. This would also highligh the hamster's dominance within the group and give us important clues to the social hierarchy of the hamster horde.
Hypothesis 1
In this case, we went back to our original degree list to see that there is a single node with the single highest degree value of 272. The second half of our hypothesis see if this node also has the highest betweenness. If it does, this may signify his or her dominance in the social hierarchy of the hamster horde and give us further insight into how the group of hamsters conduct themselves socially.
We have now found that the highest betweenness is 137089.189234. We must now see if the highest degree node matches up with this node.
We have found that the node with the max degree is not the same as the node with the max betweenness, indicating that our hypothesis is incorrect. There are at least two hamsters, if not more, with high incidences of social influence and connections within the network of our hamster horde. There is no kingpin of the hamster horde.
Hypothesis 2
We are creating a new list, which is exactly the same as the original except we have removed the node with the highest degree to test our second hypothesis.
In this code we removed the '272' degree value from the degree list. We will now compute the new average degree and compare it to the orginal as to test our second hypothesis.
As it turns out, our second hypothesis was incorrect as well. Removing the hamster with the single highest degree did not come close to causing a 10% decrease in the average degree of the network. This shows, once again, as our first experiment showed, that the hamster horde does not have a central memeber that dominates its social scene. Although removing that single hamster does cause some difference, it is not as great as we expected. Apparently there is no alpha hamster that heavily influences the characteristics of the horde. This leaves us with some answers but more questions about the social dynamics of the hamster horde and we are excited to move forward.