Question: Problem 1 0 ( 1 . 5 points ) For your favorite voting system, list: ( a ) One weakness. ( 0 . 5 point

Problem 10(1.5 points)
For your favorite voting system, list:
(a) One weakness. (0.5 point)
(b) One strength. (0.5 point)
(c) Identify an alternative system that addresses the weakness but doesn't have the same strength. Explain briefly why this system has these properties. (0.5 point)
Problem 11(1.5 points)
Below we depict a social network in Figure 4 showing interactions at different times. All edges depict the timespan when two nodes interacted. For two of these edges, the b-d edge and the d-e edge, we don't know the ending time of the interaction. We will study how this impacts the spread of an Figure 4: Network depicting social interactions at different times. If node 1 is infected at time \(\mathbf{t}\), and it shares an edge \([\mathbf{a},\mathbf{b}]\) with node 2, such that \(\mathbf{a}\leq \mathbf{t}\leq \mathbf{b}\), then node 2 will with a probability \(\mathrm{p}>0\) be infected by node 1.
infectious disease, that spread with probability \(\mathrm{p}>0\). We assume that node \( a \) is infected at time \( t=0\).
(a) Assume first that \( x=1\) and \( y=1\). Could the entire network become infected with these values? (0.5 point)
(b) Find (some other) values of \( x \) and \( y \) such that the entire network could become infected. Additionally list for each node the earliest point it could be infected (0.5 point)
(c) We learn that in fact \( x=1\) an \( y=1\), however we also learn that we are missing an edge with start time and stop time [13,20]. Can you use this edge to connect two nodes, such that the entire network could become infected? (0.5 point)
Problem 1 0 ( 1 . 5 points ) For your favorite

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!