Social Networks | Week 12

Social Networks Week 12 Assignment 12 Answers

Course Link: Social Networks | Week 12

Q1. Considering myopic search, which of the following propositions is true?
Globally optimal solutions are always identified by myopic search.
Locally optimal solutions are always discovered through myopic search, but not always the most ideal ones worldwide.
A depth-first search algorithm is a type of myopic search.
Myopic search is a form of heuristic search algorithm that calculates the distance to the target using a heuristic function.

Q2. What is the diameter of the given network H?

Answer 4

Q3. Which of the following is INCORRECT when creating edges that represent homophily in the network?
add edges to one node on the left and one on the left of every node in a ring network
add edges to two nodes on the left and two on the left of every node in a ring network
add random edges between any two nodes in the network
add edges between nodes that are geographically close

Q4. Consider a large network, what happens to the diameter of such a network when we keep adding long links to it?
increases steadily
increases drastically
decreases steadily
decreases drastically

Q5. Which of the following statements is true?
Statement I – Myopic search requires more computational resources as compared to optimal search
Satement II – Myopic search may not find the optimal solution
I only
II only
Both
none

Q6. Pick out the factor that does not affect the popularity of an Internet meme.
Novelty of meme
Key nodes start spreading the meme
Network structure
Age distribution of the network

Q7. Select all the characteristics of the Decentralised search.
Collaborative effort in searching
There is a central node which exactly performs the search
Google is an example of a Decentralised search engine
effort is distributed across multiple nodes

Q8. What is the characteristic to find the key node in a network?
highest degree
closeness centrality
high betweenness
core nodes

Q9. Which of the following contains the most influential nodes according to the K -shell algorithm?
Higher shell number
Lower shell number
Shell number 1
None of the above

Q10. Which of the following statements are true?
Statement I – The influential power of a set of nodes is the probability with which they cannot spread disease if they get injected with it first.
Statement II – The influential power of a set of nodes X is the number of nodes that get infected with the disease if the disease starts with X.
I only
II only
Both
None