logo Use SA10RAM to get 10%* Discount.
Order Now logo

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Edwin BenningLaw
(5/5)

687 Answers

Hire Me
expert
Henry SimmonsEnglish
(5/5)

742 Answers

Hire Me
expert
Dai AndrewsGeneral article writing
(5/5)

535 Answers

Hire Me
expert
Marvin BittleBusiness
(5/5)

825 Answers

Hire Me
R Programming
(5/5)

Analyzing centrality, tie strength, and distance reachability in a classroom network

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Analyzing centrality, tie strength, and distance reachability in a classroom network

Loading classroom data

For this exercise, we will analyze centrality, tie strength, and reachability measures on a different classroom network than the network of MBA students we looked at in class. This network can be read from the file social_and_task_network.csv.

In this network, we have two types of ties:

1. social_tie indicates whether a student reports having a social relationship with another student

2. task_tie indicates whether a student reports working with another student on course-related tasks inside or outside of class

This network has several important characteristics:

Both of these relationships are directed, that is, not necessarily symmetric or reciprocated. For example, Student A may report having a relationship with Student B, while Student B may not report having a relationship with Student A.

This network is in the form of an edge list, where each row represents a potential tie.

“Ego” is the focal node, or vertex, in the network—ego “sends” ties.

“Alter” is the non-focal node, or vertex, in the network—alters “receive” ties from ego.

The number given in the social_tie and social_tie columns represents the strength of each tie—this is a weight. If this number is given as 0, then no tie exists between ego and alter for this type of relationship.

1. First, consider the social and task ties as two separate networks.

(A) Use igraph to generate indegree, outdegree, closeness,  betweenness,  and  PageRank  cen- trality statistics for each individual the social and task networks. You  can  use  the page_rank() function to compute PageRank, which functions similarly to eigen_centrality.

(B) Compute the correlations of the five centrality measures you generate for the social network with the five measures generated for the task network. Which measures in the task network are most closely related to those in the socializing network? Name at least one insight can you draw from the relationships between these five measures across the two networks.

2. Next,  consider the social and task ties together,  as two distinct types of ties comprising one network. Suppose that a tie is strong if it is above the mean strength for that type, conditional on the tie existing—that is, do not include weights of 0 in the calculation of the mean.

(A) Under this definition, does the network satisfy Strong Triadic Closure? Come up with a solution that illustrates this visually, in a plot.

(B) Also come up with a solution that illustrates this programmatically, such as by giving the number or proportion of ties that are inviolation of Strong Triadic Closure.

3. Continue to treat the social and task ties as two distinct types of ties comprising one network.

(A) It is also possible to compute betweenness on the edges in a network, as well as the vertices. This is a good measure of the flow of information and resources through a network. Calculate the edge-level betweenness for both the social and task ties.

 

(B) Does it seem like edges with high betweenness tend to be strong or weak ties, according the measure of tie strength we used in Question 2? Does this result make sense given the shape of the networks?

4. Continue to treat the social and task ties as two distinct types of ties comprising one network. How many pairs of nodes do not have walks between one another? Find a solution that performs this calculation directly on the matrix—it is possible to verify this solution via igraph afterward using distances(). See also ?distances() for an explanation of igraph’s related network distance functions.

5. The network-level measure of degree centrality is a good indicator of the dispersion of the degree distribution in a network. Generate and plot a network in R in which the network-level measure of degree centrality,

 

Cdegree = Σn

 

Cdegree(v∗)−Cdegree(vi) (n−1)(n−2)

 

is equal to 1, and another where it is equal to 0. Would this relationship hold true for these networks for other measures of centrality, such as closeness or betweenness?

 

(5/5)
Attachments:

Related Questions

. The fundamental operations of create, read, update, and delete (CRUD) in either Python or Java

CS 340 Milestone One Guidelines and Rubric  Overview: For this assignment, you will implement the fundamental operations of create, read, update,

. Develop a program to emulate a purchase transaction at a retail store. This  program will have two classes, a LineItem class and a Transaction class

Retail Transaction Programming Project  Project Requirements:  Develop a program to emulate a purchase transaction at a retail store. This

. The following program contains five errors. Identify the errors and fix them

7COM1028   Secure Systems Programming   Referral Coursework: Secure

. Accepts the following from a user: Item Name Item Quantity Item Price Allows the user to create a file to store the sales receipt contents

Create a GUI program that:Accepts the following from a user:Item NameItem QuantityItem PriceAllows the user to create a file to store the sales receip

. The final project will encompass developing a web service using a software stack and implementing an industry-standard interface. Regardless of whether you choose to pursue application development goals as a pure developer or as a software engineer

CS 340 Final Project Guidelines and Rubric  Overview The final project will encompass developing a web service using a software stack and impleme

Get Free Quote!

428 Experts Online