Consider the decision model/game theoretic model from Chapter 19 for the spread of a new behavior through a social network. Suppose we have the social network depicted in Figure 2; suppose that each node starts with the behavior B, and each node has a threshold of q = 2/5 for switching to behavior A. Now, let c and d form a two-node set S of initial adopters of behavior A. If other nodes follow the threshold rule for choosing behaviors, which nodes will eventually switch to A? Give a brief (1-2 sentence) explanation for your answer. Find a cluster of density greater than 1 − q = 3/5 in the part of the graph outside S that blocks behavior A from spreading to all nodes, starting from S, at threshold q. Give a brief (1-2 sentence) explanation for your answer. Suppose you were allowed to add a single edge to the given network, connecting one of nodes c or d to any one node that it is not currently connected to. Could you do this in such a way that now behavior A, starting from S and spreading with a threshold of 2/5, would reach all nodes? Give a brief explanation for your answer.
Consider the decision model/game theoretic model from Chapter 19 for the spread of a new behavior through a social network. Suppose we have the social network depicted in Figure 2; suppose that each node starts with the behavior B, and each node has a threshold of q = 2/5 for switching to behavior A. Now, let c and d form a two-node set S of initial adopters of behavior A. If other nodes follow the threshold rule for choosing behaviors, which nodes will eventually switch to A? Give a brief (1-2 sentence) explanation for your answer. Find a cluster of density greater than 1 − q = 3/5 in the part of the graph outside S that blocks behavior A from spreading to all nodes, starting from S, at threshold q. Give a brief (1-2 sentence) explanation for your answer. Suppose you were allowed to add a single edge to the given network, connecting one of nodes c or d to any one node that it is not currently connected to. Could you do this in such a way that now behavior A, starting from S and spreading with a threshold of 2/5, would reach all nodes? Give a brief explanation for your answer.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
- Consider the decision model/game theoretic model from Chapter 19 for the spread of a new behavior through a social network. Suppose we have the social network depicted in Figure 2; suppose that each node starts with the behavior B, and each node has a threshold of q = 2/5 for switching to behavior A.
- Now, let c and d form a two-node set S of initial adopters of behavior A. If other nodes follow the threshold rule for choosing behaviors, which nodes will eventually switch to A? Give a brief (1-2 sentence) explanation for your answer.
- Find a cluster of density greater than 1 − q = 3/5 in the part of the graph outside S that blocks behavior A from spreading to all nodes, starting from S, at threshold q. Give a brief (1-2 sentence) explanation for your answer.
- Suppose you were allowed to add a single edge to the given network, connecting one of nodes c or d to any one node that it is not currently connected to. Could you do this in such a way that now behavior A, starting from S and spreading with a threshold of 2/5, would reach all nodes? Give a brief explanation for your answer.

Transcribed Image Text:k
Figure 2: Starting from nodes c and d, the new behavior A fails to spread to the entire
graph.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 3 images

Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education