Professional Documents
Culture Documents
reviewer1@nptel.iitm.ac.in ▼
Course
outline Week 12 - Assignment 1
.
Course Trailer
FAQ
1) Which of the following is responsible for drastically reducing the diameter of the small world 1 point
networks?
Things to Note
Homophily based edges
Accessing the
Portal Weak ties (long range contacts)
All the edges
Week 1 - None of the above
Introduction
Week 2 -
Handling Real- Accepted Answers:
world Network
Datasets Weak ties (long range contacts)
Week 8 : Link
Analysis
(Continued)
Accepted Answers:
Week -9 : Power High status people are linked in densely connected core while the low status people atomize around this
Laws and Rich- core as periphery of the network.
https://onlinecourses.nptel.ac.in/noc17_cs41/unit?unit=251&assessment=269 1/3
28/12/2017 Social Networks - - Unit 16 - Week 12- Pseudocore (How to go viral on web?)
Get-Richer 4) Pseudo-cores are the nodes 1 point
Phenomena
which belong to the core of the network (synonymous to core).
Week 10 - Power which belong to the periphery of the network (synonymous to periphery).
law (contd..) and
Epidemics which do not belong to the innermost core of the network but have equal spreading power
(cascade capacity) as the innermost core.
Week 11- Small which do not belong to the outermost periphery of the network but have equal spreading power
World (cascade capacity) as the outermost periphery.
Phenomenon
Week 12-
Pseudocore Accepted Answers:
(How to go viral
on web?) which do not belong to the innermost core of the network but have equal spreading power (cascade
capacity) as the innermost core.
Lecture 150 :
Programming 5) In a graph, node having the highest influential power tend to have highest 1 point
illustration-
Small world degree
networks : betweenness
Introduction
closeness
Lecture 151 : coreness
Base code
Lecture 152 :
Making
homophily Accepted Answers:
based edges coreness
Lecture 153 :
6) Given a graph having a maixmum of 3-cores. While applying k-shell decomposition on this 1 point
Adding weak
ties
network, a node is removed in the iteration 2. This node belongs to
Lecture 157 :
7) Given a graph having a maixmum of 3-cores. While applying k-shell decomposition on this 1 point
Myopic Search network, a node is removed in the iteration 2. The core number of this node is
comparision to
optimal search 0
1
Lecture 158 :
Time Taken by 2
Myopic Search 3
Lecture 159 :
PseudoCores :
Introduction
Accepted Answers:
Lecture 160 :
How to be Viral 2
Lecture 163 :
Coding K-Shell Accepted Answers:
Decomposition
Every node has a core number 3.
https://onlinecourses.nptel.ac.in/noc17_cs41/unit?unit=251&assessment=269 2/3
28/12/2017 Social Networks - - Unit 16 - Week 12- Pseudocore (How to go viral on web?)
Feedback for
Week 12 Previous Page End
Answers to
week 12
assignment
Funded by
Powered by
https://onlinecourses.nptel.ac.in/noc17_cs41/unit?unit=251&assessment=269 3/3