NPTEL Social Networks Week 11 Assignment Answers 2025
1. The Small World Effect suggests that the average shortest path length between any two people in a large network is:
- Proportional to the size of the network
- Proportional to the logarithm of the network size
- Independent of the network size
- Proportional to the square root of the network size
Answer :- For Answers Click Here
2. In Milgram’s Small World Experiment, what was the key observation about the path length between two randomly selected individuals?
- Most people were directly connected
- The average chain length was around 6 degrees of separation
- Only a few people were reachable
- The experiment proved the small-world phenomenon in all networks
Answer :-
3. What was a limitation of Milgram’s experiment in studying real-world networks?
- The study was conducted only in the USA
- Many messages never reached the destination
- The network was not truly random
- All of the above
Answer :-
4. Which characteristic of a network is necessary for both the small-world effect and efficient decentralized search?
- High clustering coefficient
- Short average path length
- Scale-free degree distribution
- Both A and B
Answer :-
5. The Generative Model for small-world networks (Watts-Strogatz model) is based on what key operation?
- Adding edges between distant nodes
- Randomly rewiring some edges in a regular lattice
- Removing edges from a fully connected graph
- Forcing hubs to emerge
Answer :- For Answers Click Here
6. What happens when we increase the rewiring probability § in the Watts-Strogatz model?
- The network moves from regular to random, reducing path length
- The clustering coefficient increases
- The network remains regular
- The network becomes disconnected
Answer :-
7. Which feature makes Watts-Strogatz small-world networks different from random graphs?
- High clustering despite short average path length
- Low clustering and short path lengths
- The degree distribution follows a power law
- The network is always scale-free
Answer :-
8. In Kleinberg’s model of decentralized search, what type of connections enable efficient navigation?
- Purely random long-range links
- Links proportional to geographic distance
- Links following an inverse power law with distance
- No additional long-range links
Answer :-
9. Why is decentralized search difficult in random networks?
- There is no clear structure for efficient navigation
- The clustering coefficient is too high
- Random networks have too many shortcuts
- Random networks never form hubs
Answer :-
10. Which real-world phenomenon is best explained using Kleinberg’s decentralized search model?
- Human navigation in social networks
- The spread of rumors on social media
- Routing in peer-to-peer networks
- All of the above
Answer :- For Answers Click Here
