NW Exercises
Exercise 1: Manager Networks
Introduction
Data: What do I get?
Background
Let the fun begin. You will analyze network datacollected from the managers of a high-tec company. This dataset, originating from the paper below, is widely used in research on organizational networks. Time to give it a shot as well.
Krackhardt D. (1987). Cognitive social structures. Social Networks, 9, 104-134. The company manufactured high-tech equipment on the west coast of the United States and had just over 100 employees with 21 managers. Each manager was asked to whom do you go to for advice and who is your friend, to whom do you report was taken from company documents.
Description
The dataset includes 4 files - 3xKrack-High-Tec and 1x High-Tec-Attributes. Krack-High-Tec includes the following three 21x3 text matrices:
- ADVICE, directed, binary
- FRIENDSHIP, directed, binary
- REPORTS_TO, directed, binary
Column 1 contains the ID of the ego (from where the edge starts), and column 2 the alter (to which the edge goes). Column 3 indicates the presence (=1) or absence (=0) of an edge.
High-Tec-Attributes includes one 21x4 valued matrix.
- ID: Numeric ID of the manager
- AGE: The managers age (in years)
- TENURE: The length of service or tenure (in years)
- LEVEL: The level in the corporate hierarchy (coded 1,2 and 3; 1 = CEO, 2 = Vice President, 3 = manager)
- DEPT: The department (coded 1,2,3,4 with the CEO in department 0, ie not in a department)
Tasks
1. Create a network
- Generate network objects for the companies organizational structure (reports to), friendship, advice
- This networks are generated from the corresponding edgelists
- Also attach node characteristics from the corresponding nodelist
2. Analysis
Make a little analysis on:
A: Network level characteristics. Find the overal network level of:
- Density
- Transistivity (Clustering Coefficient)
- Reciprocity
… for the different networks. Describe and interpret the results. Answer the following questions:
- Are relationships like friendship and advice giving usually reciprocal?
- Are friends of your friends also your friends?
- Are the employees generally more likely to be in a friendship or advice-seeking relationship?
B: Node level characteristics: Likewise, find out:
- Who is most popular in the networks. Who is the most wanted friend, and advice giver?
- Are managers in higher hirarchy more popular as friend, and advice giver?
C: Relational Characteristics: Answer the following questions:
- Are managers from the same 1. department, or on the same 2. hirarchy, 3. age, or 4. tenuere more likely to become friends or give advice? (hint: assortiativity related)
- Are friends more likely to give each others advice?
3. Visualization
Everything goes. Show us some pretty and informative plots. Choose what to plot, and how, on your own. Interpret the results and share some insights.
Exercise 2: Crime Network
Data
- In this exercise, you will analyze a crime network, which you will find in the following notebook:
- Notebook: crime network
Tasks
First of all, construct the 2-mode network (code provided). Then, project it on th two modes, so that you end up with:
- A network with persons as nodes, connected by jointly commited crimes
- A network with crimes as nodes, connected by persons jointly commiting them.
Then, try to solve th following tasks:
- find the crime(s) that have the most shared connections with other crimes
- find the individual(s) that have the most shared connections with other individuals
- Which persons are implicated in the most number of crimes?
Then, there is also a bonus exercise which is a bit more complicated:
- Find the people that can help with investigating a crime’s person: Let’s pretend that we are a detective trying to solve a crime, and that we right now need to find other individuals who were not implicated in the same exact crime as an individual was, but who might be able to give us information about that individual because they were implicated in other crimes with that individual.