0% found this document useful (0 votes)
38 views3 pages

Social Network Analysis - Unit 3 - Week 2

The document discusses a social network analysis assignment with 12 multiple choice questions about concepts like degree centrality, betweenness centrality, closeness centrality, diameter and density of a network. The questions refer to a network G1 and ask students to calculate various metrics and identify central nodes.

Uploaded by

kaif.ahmed.0210
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
38 views3 pages

Social Network Analysis - Unit 3 - Week 2

The document discusses a social network analysis assignment with 12 multiple choice questions about concepts like degree centrality, betweenness centrality, closeness centrality, diameter and density of a network. The questions refer to a network G1 and ask students to calculate various metrics and identify central nodes.

Uploaded by

kaif.ahmed.0210
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

8/10/22, 1:30 PM Social Network Analysis - - Unit 3 - Week 2

(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)

kaifahmed20@cse.iiitp.ac.in 

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Social Network Analysis (course)


Register for
Certification
exam
Week 2 : Assignment 2
(https://examform.nptel.ac.in/2022_04/exam_form/dashboard)
Assignment not submitted Due date: 2022-08-10, 23:59 IST.

1) For a directed graph G(N , V ), if kiin and kiout represent the in-degree and out- 1 point
Course degree of node i respectively, what is the number of edges present in Gw.r.t kin and kout ? i i

outline
i i
E = ∑(k +k )
How does an in out

iϵN
NPTEL
online 1
i i
course E = ∑(k
in
+k
out
)
2
work? () iϵN

1
Week 1 () E = ∑(k
i
in
∗k
i
out
)
2
iϵN

Week 2 ()
1
i
E = ∑ k
in
2
SNA Chapter iϵN

2 Lecture 1
(unit?
unit=17&lesson=48) Consider network G1 for questions 2 to 8 :

SNA Chapter
2 Lecture 2
(unit?
unit=17&lesson=49)

SNA Chapter
2 Lecture 3
(unit?
unit=17&lesson=50)

SNA Chapter
2 Lecture 4
2) Measure the degree of nodes [1,3,5,7]? 1 point
(unit?
[2, 4, 2, 1]
unit=17&lesson=51)

https://onlinecourses.nptel.ac.in/noc22_cs117/unit?unit=17&assessment=55 1/3
8/10/22, 1:30 PM Social Network Analysis - - Unit 3 - Week 2

SNA Chapter [1, 5, 3, 2]


2 Lecture 5
[2, 5, 3, 1]
(unit?
unit=17&lesson=52) [2, 4, 2, 0]

SNA Chapter 3) What is the diameter of the network? 1 point


2 Lecture 6
(unit? 2
unit=17&lesson=53) 3

Tutorial 3: 4
Introduction to 5
NetworkX -
Part II (unit? 4) What is the density of the network? 1 point
unit=17&lesson=54)
1.14
Week 2
0.8
Feedback
Form : Social 0.21
Network 0.38
Analysis (unit?
unit=17&lesson=38) 5) What is the local clustering coefficient of node 3? 1 point

Quiz: Week 2 0.1


: Assignment
0.2
2
(assessment? 0.3
name=55) 0.4

Week 3 () 6) Measure the degree centrality for nodes [1,3,5,7]? 1 point

DOWNLOAD [0.2, 0.5, 0.3, 0.1]


VIDEOS () [0.4, 1.0, 0.6, 0.2]
[0.1, 0.4, 0.2, 0.1]
[0.3, 0.9, 0.5, 0.1]

7) What is the closeness centrality for nodes 3 and 6? 1 point

Node 3: 0.85; Node 6: 0.42


Node 3: 0.80; Node 6: 0.40
Node 3: 1.0; Node 6: 0.5
Node 3: 0.9; Node 6: 0.45

8) Which pair of nodes out of (2,3,6) are closer to each other according to Jaccard 1 point
similarity?

(2,3)
(3,6)
(2,6)
All are same distance

Common Data For Questions 9 - 12:

You are a spy inside a terrorist organisation with an extensive knowledge of social network

https://onlinecourses.nptel.ac.in/noc22_cs117/unit?unit=17&assessment=55 2/3
8/10/22, 1:30 PM Social Network Analysis - - Unit 3 - Week 2

analysis. State with proper justification which centrality measure you will use in each of the
following situations:

9) To find the person who deals with the most number of people. 1 point

Degree Centrality
Eigenvector Centrality
Betweenness Centrality
Closeness Centrality

10) To find the boss of the entire network (highly influential person). 1 point

Degree Centrality
Eigenvector Centrality
Betweenness Centrality
Closeness Centrality

11) To find a person who can spread a message faster in the network. 1 point

Degree Centrality
Eigenvector Centrality
Betweenness Centrality
Closeness Centrality

12) To find a person who can spread a message as far as possible in the network. 1 point

Degree Centrality
Eigenvector Centrality
Betweenness Centrality
Closeness Centrality

You may submit any number of times before the due date. The final submission will be
considered for grading.
Submit Answers

https://onlinecourses.nptel.ac.in/noc22_cs117/unit?unit=17&assessment=55 3/3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy