SET – A : SHORT ANSWER QUESTIONS

1. Define Social Network Analysis.

Social Network Analysis is the study of relationships among individuals, groups, or organizations using nodes (actors)
and edges (ties) to understand patterns of interaction.

2. What is a node and an edge?

A node (or vertex) represents an actor in a network, such as a person, group, or organization.

An edge (or link) represents the relationship or connection between two nodes.

3. Define degree of a vertex.

The degree of a vertex is the number of edges incident to (connected with) that vertex in a graph.

4. What is a path in a graph?

A path in a graph is a sequence of vertices connected by edges, where each edge joins consecutive vertices
in the sequence.

5. Define network diameter.

The network diameter is the longest shortest path between any two nodes in a network, representing the
maximum distance across the graph.

6. What is Erdős Number?

The Erdős Number measures the "collaborative distance" between a person and mathematician Paul Erdős,
based on co-authorship of research papers. Erdős himself has number 0, his direct co-authors have 1, their
co-authors have 2, and so on

7. Define centrality.

Centrality is a measure in network analysis that identifies the importance or influence of a node within a network
based on its position and connections.

8. What is degree centrality?

Degree centrality is the measure of a node’s importance in a network, defined by the number of direct
connections (edges) it has to other nodes.

9. Define closeness centrality.

Closeness centrality measures how close a node is to all other nodes in a network, calculated as the inverse
of the sum of shortest path distances from that node to every other node.

10. What is betweenness centrality?

Betweenness centrality measures how often a node lies on the shortest paths between other nodes, indicating its role as
a bridge or mediator in the network.

11. What is eigenvector centrality?

Eigenvector centrality measures a node’s importance based on both its connections and the importance of
the nodes it is connected to, giving higher scores to nodes linked with other highly influential nodes.
12. Define balance theory.

Balance theory is a psychological theory proposed by Fritz Heider, which states that people prefer balanced
relationships among themselves, others, and objects; imbalance creates tension, while balance leads to harmony.

13. What is a balanced triad?

A balanced triad is a set of three nodes where the relationships among them are consistent and harmonious,
such as “friend of my friend is my friend.”

14. Define homophily.

Homophily is the tendency of individuals to form connections with others who are similar to them in
characteristics or beliefs.

15. What is heterophily?

Heterophily is the tendency of individuals to connect with others who are different from them in attributes
or opinions.

Q16: Define random graph.

A random graph is a graph formed by creating edges between nodes at random, often used to model
unpredictable networks.

Q17: What is G(n,p) model?

The G(n,p) model is a random graph model where a graph has n nodes, and each possible edge exists
independently with probability p.

Q18: What is clustering coefficient?

The clustering coefficient measures how likely a node’s neighbors are to be connected to each other,
indicating local network density.

Q19: Define small-world network.

A small-world network is a network where most nodes are not directly connected but can be reached
through a small number of steps.

Q20: What is scale-free network?

A scale-free network is a network where some nodes (hubs) have many connections, following a power-
law degree distribution.

Q21: Define preferential attachment.

Preferential attachment is the process where new nodes are more likely to connect to already well-
connected nodes, creating hubs.

Q22: What is navigation in networks?

Navigation in networks refers to finding paths or routes between nodes using local information rather than
global knowledge.

Q23: Define greedy routing.

Greedy routing is a method where each step moves to the neighbor closest to the destination, using local
decisions only.

Q24: What is a clique?

A clique is a subset of nodes in which every node is directly connected to every other node.
Q25: Define k-core.
A k-core is a subgraph where each node has at least k connections within that subgraph.

Q26: What is a community?

A community is a group of nodes in a network that are more densely connected to each other than to the
rest of the network.

Q27: Define multidimensional scaling (MDS).

MDS is a statistical technique that represents high-dimensional data in lower dimensions while preserving
distance relationships.

Q28: What is structural equivalence?

Structural equivalence occurs when two nodes have identical patterns of connections to all other nodes in
the network.

Q29: Define role in social networks.

A role in social networks refers to the position or function a node plays based on its relationships and
interactions.

Q30: What is network growth?

Network growth is the process by which a network expands over time by adding new nodes and edges.

Perfect! Here’s a quick revision table with all the definitions we covered, formatted for easy last-minute
exam prep:

📘 Quick Revision Table – Social Network Analysis (2 Marks)

Q
Concept Definition (2 Marks Style)
No.
Study of relationships among actors using nodes and edges to understand
1 Social Network Analysis
interaction patterns.
2 Node Represents an actor (person, group, organization) in a network.
Edge Represents a relationship or connection between two nodes.
3 Degree of a Vertex Number of edges incident to a vertex.
4 Path Sequence of vertices connected by edges.
5 Network Diameter Longest shortest path between any two nodes in a network.
Collaborative distance from mathematician Paul Erdős via co-
6 Erdős Number
authorship.
7 Centrality Measure of a node’s importance in a network.
8 Degree Centrality Importance based on number of direct connections.
Importance based on proximity to all other nodes (inverse of distance
9 Closeness Centrality
sum).
Importance based on how often a node lies on shortest paths between
10 Betweenness Centrality
others.
11 Eigenvector Centrality Importance based on connections to other highly influential nodes.
12 Balance Theory Theory that people prefer balanced, harmonious relationships.
13 Balanced Triad Three nodes with consistent, harmonious relationships.
14 Homophily Tendency to connect with similar individuals.
15 Heterophily Tendency to connect with dissimilar individuals.
16 Random Graph Graph formed by edges placed randomly.
17 G(n,p) Model Random graph with n nodes, each edge existing with probability p.
18 Clustering Coefficient Likelihood that a node’s neighbors are connected to each other.
 Q
Concept Definition (2 Marks Style)
No.
Network where most nodes are connected through a small number of
19 Small-World Network
steps.
20 Scale-Free Network Network with hubs following a power-law degree distribution.
21 Preferential Attachment New nodes connect more often to well-connected nodes.
22 Navigation in Networks Finding paths using local information only.
23 Greedy Routing Routing by moving to the neighbor closest to the destination.
24 Clique Subset of nodes where every node is directly connected to every other.
25 k-Core Subgraph where each node has at least k connections.
26 Community Group of nodes more densely connected internally than externally.
Multidimensional Scaling Technique to represent high-dimensional data in lower dimensions while
27
(MDS) preserving distances.
28 Structural Equivalence Two nodes with identical connection patterns to all others.
29 Role in Social Networks Position or function of a node based on its relationships.
30 Network Growth Expansion of a network by adding nodes and edges over time.

SET – B : DESCRIPTIVE / LONG ANSWER QUESTIONS

1. Explain Social Network Analysis and its real-world applications.

Social Network Analysis (SNA) is the study of relationships among individuals, groups, or organizations
using graph theory. In SNA, actors are represented as nodes and relationships as edges. It focuses not only
on individual attributes but also on how connections shape behavior, influence, and information flow.

Applications:

 Social Media: Identifying influencers and viral trends.

 Epidemiology: Tracking disease spread and identifying super-spreaders.
 Criminology: Mapping terrorist or criminal networks.
 Business: Understanding communication patterns in organizations.
 Science: Studying collaboration networks (e.g., Erdős Number Project).

SNA is significant because it uncovers hidden structures, predicts outcomes, and helps design interventions
in complex systems.

2. Describe preliminaries and basic terminologies used in network analysis.

Network analysis relies on fundamental graph theory concepts:

 Node (Vertex): Represents an actor.

 Edge (Link): Represents a relationship.
 Degree: Number of connections a node has.
 Path: Sequence of connected nodes.
 Diameter: Longest shortest path in the network.
 Centrality: Measure of importance of a node.
 Clique: Subset of nodes fully connected.
 Community: Group of nodes densely connected internally.
 Adjacency Matrix: Mathematical representation of connections.
 Graph Types: Directed/undirected, weighted/unweighted.

These preliminaries form the foundation for analyzing and interpreting networks.
3. Explain Erdős Number Project with illustration.

The Erdős Number Project measures collaborative distance from mathematician Paul Erdős.

 Erdős himself has number 0.

 His direct co-authors have number 1.
 Their co-authors have number 2, and so on.

Illustration:

 Erdős → Author A (Erdős number 1).

 Author B co-authors with A → Erdős number 2.

Significance:

 Demonstrates collaboration patterns in mathematics.

 Highlights the interconnectedness of scientific communities.
 Inspires similar measures in other fields (e.g., Bacon Number in film).

4. Discuss various centrality measures with formulas and examples.

Centrality identifies influential nodes.

1. Degree Centrality:
[ C_D(v) = \text{deg}(v) ]
Measures direct connections.
2. Closeness Centrality:
[ C_C(v) = \frac{1}{\sum d(v,u)} ]
Measures proximity to all nodes.
3. Betweenness Centrality:
[ C_B(v) = \sum \frac{\sigma_{st}(v)}{\sigma_{st}} ]
Measures brokerage role.
4. Eigenvector Centrality:
[ x_i = \frac{1}{\lambda} \sum A_{ij} x_j ]
Measures influence based on connections to influential nodes.

Examples:

 Degree: Popular student with many friends.

 Closeness: Manager who can reach everyone quickly.
 Betweenness: Broker connecting two groups.
 Eigenvector: Influencer followed by other influencers.

5. Explain Balance Theory and its significance in social networks.

Proposed by Fritz Heider, Balance Theory explains how people prefer consistent and harmonious
relationships.

Balanced Triad:
  All positive ties.
 Two negatives + one positive.

Unbalanced Triad:

 Causes tension and instability.

Significance:

 Explains group stability.

 Predicts alliance formation.
 Helps understand conflict resolution.

Example: “Friend of my friend is my friend” is balanced; “Friend of my friend is my enemy” is unbalanced.

6. Describe Homophily and its effects on network structure.

Definition: Homophily is the tendency of individuals to connect with similar others.

Effects:

 Creates clusters of like-minded individuals.

 Reduces diversity of information.
 Strengthens group identity.
 May lead to polarization.

Applications:

 Social media echo chambers.

 Political group formation.
 Marketing strategies targeting similar demographics.

7. Explain Erdős–Rényi random graph model and its properties.

The Erdős–Rényi model (G(n,p)) constructs a graph with n nodes, where each edge exists independently
with probability p.

Properties:

 Degree distribution ~ binomial/Poisson.

 Low clustering coefficient.
 Short average path length.
 Connectivity threshold: sudden emergence of giant component.

Significance:

 Provides baseline for randomness.

 Useful for theoretical analysis.
 Contrasts with real-world networks that show clustering and hubs.
8. Compare random graphs and small-world networks.
Feature Random Graph Small-World Network
Clustering Low High
Path Length Short Short
Degree Distribution Uniform Local clustering + shortcuts
Example Erdős–Rényi Watts–Strogatz

Conclusion: Small-world networks better represent real social systems due to clustering and short paths.

9. Explain Watts–Strogatz model with diagram.

The Watts–Strogatz model starts with a regular lattice and rewires edges randomly with probability p.

Result:

 High clustering.
 Short path lengths.
 Emergence of small-world property.

Applications:

 Explains social networks, neural networks, and power grids.

Diagram (conceptual): Regular lattice → partial rewiring → small-world network.

10. Describe Barabási–Albert model and preferential attachment mechanism.

The Barabási–Albert (BA) model explains scale-free networks.

Mechanism:

 New nodes prefer to attach to already well-connected nodes.

 Probability proportional to degree.

Result:

 Power-law degree distribution.

 Emergence of hubs.

Applications:

 Internet structure.
 Citation networks.
 Airline routes.

11. Explain models of network growth in detail.

 Random Growth (Erdős–Rényi): Edges added randomly.

 Small-World Growth (Watts–Strogatz): Local clustering + shortcuts.
  Scale-Free Growth (Barabási–Albert): Preferential attachment → hubs.
 Hybrid Models: Combine randomness and clustering.

Significance: Explains evolution of networks in technology, biology, and society.

12. Discuss Navigation in Social Networks and six degrees of separation.

Navigation: Finding paths using local information.

Six Degrees of Separation: Any two people are connected by ~6 steps.

 Popularized by Milgram’s experiments.

 Confirmed by Facebook studies (average distance ~4).

Significance:

 Explains efficiency of social networks.

 Basis for viral marketing and epidemic modeling.
 Highlights importance of brokers and bridges.

13. Explain cohesive subgroups and their types.

Definition: Subsets of nodes with strong internal ties.

Types:

 Cliques: Fully connected groups.

 k-Cores: Subgraphs where each node has ≥ k connections.
 Communities: Densely connected groups.
 Factions: Groups with shared identity.

Significance: Identifies tightly-knit groups, useful in sociology, marketing, and organizational studies.

14. Describe Multidimensional Scaling (MDS) and its steps.

Definition: MDS is a technique to represent high-dimensional data in 2D/3D while preserving distances.

Steps:

1. Compute distance matrix.

2. Apply dimensional reduction.
3. Plot points in lower dimensions.

Applications:

 Visualizing similarity in networks.

 Psychology (perception studies).
 Marketing (customer segmentation).
15. Explain structural equivalence with examples.

Definition: Two nodes are structurally equivalent if they have identical ties to all other nodes.

Example: Two students connected to the same classmates.

Significance:

 Identifies interchangeable roles.

 Useful in role analysis in organizations.
 Helps detect redundancy in networks.

16. Differentiate between roles and positions in networks.

 Role: Function of a node based on interactions (leader, broker).

 Position: Location of a node in the network structure (central, peripheral).

Difference: Roles are functional; positions are structural.

Example: A central node may play the role of influencer, while a peripheral node may play the role of
outsider.

17. Compare small-world and scale-free networks.

Feature Small-World Scale-Free
Clustering High Variable
Path Length Short Short
Degree Distribution Uniform Power-law

| Example | Social networks | Internet, citation