Social Networks | Week 3
Course Name: Social Networks
Table of Contents
Course Link: Click Here
Nptel Social Networks Week 3 Assignment 3 Answers (Jan-Apr 2025)
- Which of the following best explains the concept of strength of weak ties in social networks?
a. Weak ties are not important in social networks.
b. Weak ties connect different groups, facilitating the flow of new information.
c. Weak ties are more trustworthy than strong ties.
d. Weak ties only exist within closely connected groups.
- In a social network, a triad refers to:
a. A group of three nodes where all are connected.
b. A set of three nodes connected by a single edge.
c. A group of three nodes with no connections.
d. A set of three nodes, with exactly two connected.
- Neighborhood overlap in a graph is best described as:
a. The number of edges between two nodes.
b. The number of common neighbors two nodes share.
c. The degree of a node.
d. The shortest path between two nodes.
- In the context of social network analysis, a bridge is:
a. An edge that connects two components.
b. An isolated node in the graph.
c. A node that connects two communities.
d. An edge that connects two nodes with no common neighbors.
- A local bridge is an edge that:
a. Connects two nodes with high degree.
b. Has the highest betweenness centrality in the graph.
c. Connects two nodes that have few or no other connections between them.
d. Connects two nodes that belong to the same community.
- In the context of social networks, embeddedness refers to:
a. The number of connections a node has.
b. The degree to which a relationship is supported by a network of other relationships.
c. The isolation of a node in the network.
d. The shortest path between two nodes in the graph.
- A structural hole in a network refers to:
a. A complete graph with no isolated nodes.
b. A gap between two groups that are not directly connected.
c. A node with the highest centrality in the network.
d. A cluster of nodes that are all connected to each other.
- Social capital in a network context refers to:
a. The total number of edges in the graph.
b. The sum of all the connections a node has.
c. The resources available to an individual through their social connections.
d. The average degree of the nodes in the network.
- In the brute-force method for community detection, the number of possible ways to divide a graph with nn nodes into two distinct communities is:
a. —
b. —
c. —
d. —
- The Girvan-Newman algorithm for community detection works by:
a. Removing edges with the lowest betweenness centrality.
b. Removing edges with the highest degree.
c. Removing edges with the highest betweenness centrality.
d. Randomly removing edges until the network splits into communities.
Course Link: Click Here
Nptel Social Networks Week 3 Assignment 3 Answers JULY-DEC 2023
Q1. Given each node in the following Figure 4 represents an individual, a solid line between the nodes represents the existing friendship and the dotted line represents the formation of a new friendship, Which of the following is the reason for such a friendship?
Triadic Closure
Membership closure
Focal closure
selection closure
Answer: Triadic Closure
Q3. Choose the correct statement.
Clustering Coefficient denotes the probability of two nodes to become friends with each other
Triadic Closure phenomenon is rare in all kinds of networks
There is no likelihood for a person to become friend in future if he is not a friend in the present
Acquaintances lead to strong ties
Answer: Clustering Coefficient denotes the probability of two nodes to become friends with each other
Q3. In Girvan Newman Algorithm, Edge G-H get removed after D-E what does this imply?
G-H has high betweenness than D-E
D-E has high betweenness than G-H
G-H has more shortest paths
Both edge are of same betweenness
Answer: D-E has high betweenness than G-H
These are Nptel Social Networks Week 3 Assignment 3 Answers
Q4. Let us consider Node A has strong tie with B and C, Violation of strong Triadic closure takes place when there is ——– edge between two neighbours.
One
No
One strong
One weak
Answer: No
Q5. Which edge will be removed first based on Girvan Newman method?
3-7
4-5
4-6
1-2
Answer: 3-7
Q6. The measure of betweenness centrality is based on the
longest path through node
shortest path through node
longest path between node and high degree node
shortest path between node and high degree node
Answer: shortest path through node
These are Nptel Social Networks Week 3 Assignment 3 Answers
Q7. What role/property of social networks is at display here in network K?
I. Structural hole
II. V2 monopolises
III. Brokerage
I and II only
II and III only
I and III only
I, II and III
Answer: I, II and III
Q8. Consider two nodes with P and Q set of friends each, the equation |P∩Q|/|P∪Q|describes the
Clustering coefficient
Social Capital
Neighbourhood Overlap
Centrality Measure
Answer: Neighbourhood Overlap
Q9. Given that neighbourhood overlap of an edge m is equal to 0. Then m is
a strong tie
a local bridge
edge with high betweenness
a triad
Answer: a local bridge
These are Nptel Social Networks Week 3 Assignment 3 Answers
Q10. What is the embeddedness between the nodes v0 and v2 in the given friendship network?
0
1
2
3
Answer: 3
These are Nptel Social Networks Week 3 Assignment 3 Answers
More Weeks of Social Networks: Click here
More Nptel Courses: Click here
Session: JAN-APR 2023
Course Name: Social Networks
Course Link: Click Here
These are Nptel Social Networks Week 3 Assignment 3 Answers
Q1. Which of the following algorithm is used to detect communities in a network?
a. Girvan Newman
b. Page Rank
c. Hits
d. Both Girvan Newman and Page Rank
Answer: a. Girvan Newman
Q2. Identify the mechanism that ensures if two people in a social network have a friend in common, then there is an increased likelihood that they will become friends themselves at some point in the future.
a. Social Capital
b. Structural hole
c. Triadic closure
d. Neighborhood overlap
Answer: c. Triadic closure
These are Nptel Social Networks Week 3 Assignment 3 Answers
Q3. Which of the following is True for the edge AB in Graph H?
I. It is a strong tie
II. It is a local bridge
III. It is a weak tie
a. Only I
b. Both I and II
c. Both II and III
d. I, II and III
Answer: c. Both II and III
These are Nptel Social Networks Week 3 Assignment 3 Answers
Q4. Compute the embeddedness of the edge AB in the graph H in Figure 1.
a. 0
b. 1
c. 3
d. 4
Answer: a. 0
Q5. Find the Neighborhood overlap of of the edge connecting V0 and V2 in the graph P. in Figure 2
a. 3/5
b. 3/4
c. 1/4
d. 1
Answer: b. 3/4
Q6. Consider a large social network where we have two communities that are connected by only through two nodes P and Q. Apart from being a weak tie, this also exhibits a property called
a. Social Capital
b. Structural hole
c. Triadic closure
d. Neighborhood overlap
Answer: b. Structural hole
These are Nptel Social Networks Week 3 Assignment 3 Answers
Q7. We have a community A supporting a popular hero A and another community B that supports a popular hero B in Facebook, we see that they play an important role that makes the content on Facebook all the more popular. Identify those properties.
a. Closure
b. less diameter
c. High density
d. Brokerage
Answer: a, d
Q8. Which of the following conditions is ideal for a good community?
a. ratio of intra-community edges to inter-community edge should be high
b. ratio of intra-community edges to inter-community edge should be low
c. ratio of intra-community edges to inter-community edge should be 1
d. ratio of intra-community edges to inter-community edge should be 0
Answer: a. ratio of intra-community edges to inter-community edge should be high
These are Nptel Social Networks Week 3 Assignment 3 Answers
Q9. Pick out the statement that best describes betweenness centrality.
a. All the shortest paths between the given node and the highest degree node.
b. All the longest paths between the given node and the highest degree node.
c. All the shortest paths that pass through the given node.
d. All the longest paths that pass through the given node.
Answer: c. All the shortest paths that pass through the given node.
Q10. While implementing the Girvan Newman algorithm on a certain graph G, you observe that edge E1 gets removed after edge E2. What can you comment about them?
a. E1 has higher betweenness than E2
b. E2 has higher betweenness than E1
c. E2 has higher embeddedness than E1
d. E1 has higher embeddedness than E2
Answer: b. E2 has higher betweenness than E1
These are Nptel Social Networks Week 3 Assignment 3 Answers
More Solutions of Social Networks: Click Here
More NPTEL Solutions: https://progiez.com/nptel-assignment-answers/
