Social Network Analysis Nptel Week 3 Answers
Are you looking for Social Network Analysis Nptel Week 3 Answers ? All weeks solutions of this Swayam course are available here.
Table of Contents
Social Network Analysis Nptel Week 3 Answers (July-Dec 2025)
Course link: Click here to visit course on Nptel Website
Question 1. Which of the following is a necessary condition for a network to exhibit the small-world property?
a) Average path length grows logarithmically with network size
b) Degree distribution follows a power law
c) Clustering coefficient is zero
d) Average path length grows linearly with network size
Question 2. In an Erdos-Renyi network G(N, p), the probability that a given node has degree k is described by which distribution (for large N)?
a) Poisson distribution
b) Power-law distribution
c) Exponential distribution
d) Normal distribution
Question 3. In the Watts-Strogatz model, increasing the rewiring probability from 0 toward 1 primarily:
a) Decreases average path length while initially preserving high clustering
b) Increases clustering coefficient
c) Makes the degree distribution follow a power law
d) Guarantees emergence of a giant component at any N
Question 4. The preferential-attachment mechanism in the Barabasi-Albert model implies that:
a) Nodes acquire links proportional to their current degree
b) Nodes connect randomly with equal probability
c) Nodes connect to those with the least degree
d) New edges connect only existing nodes
Question 5. For a random network, the critical average degree at which a giant component emerges is approximately:
a) 0.5
b) 1.0
c) ln(N)
d) N/2
Question 6. In an Erdos-Renyi graph G(N, p), the expected number of triangles (3-cycles) is:
a) C(N, 3) * p³
b) C(N, 3) * p²
c) N * p³
d) N * p
Question 7. Which network model best reproduces the heavy-tailed degree distributions observed in many real-world networks?
a) Erdos-Renyi model
b) Watts-Strogatz model
c) Barabasi-Albert model
d) Configuration model with a Poisson degree sequence
Question 8. In the configuration model, connectivity of the network is largely determined by which property of the degree sequence?
a) Mean degree only
b) Variance of degree
c) Presence of degree-1 nodes
d) Second moment of the degree distribution
Question 9. The assortativity coefficient of a social network measures the:
a) Tendency of nodes to cluster into communities
b) Correlation between the degrees of connected nodes
c) Average shortest path length
d) Likelihood of triadic closure
Question 10. For a scale-free network with degree exponent gamma between 2 and 3, which statement about robustness is generally true?
a) Random node failures quickly fragment the network
b) Targeted removal of high-degree hubs is less effective than random failures
c) Random node failures leave the giant component largely intact
d) The network has no hubs, so failures are uniform
These are Social Network Analysis Nptel Week 3 Answers