Disease dynamics in a stochastic network game: a little empathy goes a long way in averting outbreaks

Size: px
Start display at page:

Download "Disease dynamics in a stochastic network game: a little empathy goes a long way in averting outbreaks"

Transcription

1 Disease dyamics i a stochastic etwork game: a little empathy goes a log way i avertig outbreaks Supplemetary Material Ceyhu Eksi, Jeff S. Shamma ad Joshua S. Weitz A Existece of a MMPE strategy profile We recall the utility fuctio of idividual i defied i the Methods sectio below, u i a i,{a j } j Ni,st = a i β c 0 c s i t a j s j t c 2 s i t a j s j t. S Defie the space of probability distributios o the actio space 0 a i [0,] as [0,]. A mixed strategy profile σ is a fuctio that maps the state s {0,} to the space of probability distributios o the actios space, i.e., σ i : {0,} [0,]. The defiitio of a mixed MMPE strategy profile σ := {σi : {0,} [0,]} is a distributio o the actio space that satisfies the followig, for all t =, 2,..., ad i N, u i σ i st,σ N i st,st u i σ i st,σ N i st,st for ay σ i {0,} [0,] where σn i := {σ j : j N i }. From the existece of a mixed Nash equilibrium i games with cotiuous payoffs, we kow that a mixed MMPE exists for the game with payoffs S. I the followig we costructively show that i the stochastic disease etwork game with payoffs i S, a degeerate pure MMPE strategy profile σ := {σi : {0,} [0,]} that satisfies the above relatio i S2 exists. Note that a degeerate distributio puts weight oe o a sigle actio value, that is, the strategy profile correspods to a sigle actio profile for ay state. Sice i the stochastic game populatio respose is determied by the curret state of the disease oly, i.e., equilibrium is statioary, it suffices to show the existece of a pure Nash equilibrium strategy for the stage game with state s {0,}. A pure Nash equilibrium NE strategy profile σ : {0,} [0,] of the stage game with payoffs S ad state s satisfies u i σ i,σ N i,s u i σ i,σ N i,s for ay σ i {0,} [0,]. We defie the correspodig equilibrium actio profile as a := σ s for a give state s. For a give idividual i with state s i {0,}, eighbors state s Ni := {s j } j Ni, ad eighbor actio profile a Ni we have the best respose of idividual i as follows, BR i a Ni,s i,s Ni := argmaxu i a i,a Ni,s Ni = a i [0,] c 0 > c s i a j s j + c 2 s i a j s j where is the idicator fuctio. Sice the payoffs are liear i self-actios, the actios that maximize the payoffs are i the extremes a i = or a i = 0 depedig o the states ad actios of their eighbors. We ca equivaletly represet the NE defiitio i S3 as a fixed poit equatio by usig the best respose defiitio, S2 S3 S4 S5 a i = BR i a N i,s i,s Ni i N. S6 I the followig we defie the cocept of strictly domiated actio which will be a useful i fidig the Nash equilibrium. Defiitio Strictly domiated actio For a give state s {0,}, a actio a i [0,] is strictly domiated if ad oly if there exists a actio a i [0,] such that u i a i,a Ni,s > u i a i,a Ni,s a Ni S7

2 Figure S. The iterated elimiatio process i Defiitio 3 o a 5 idividual etwork. The payoff costats are such that 2c > c 0 > c ad c 0 > 2c 2. Idividuals ad 2 are sick s =, s 2 = ad the rest are healthy. The cotact etwork is show at k = 0. At step k =, idividuals i = {,2,4,5} elimiate all actios except by S9 give c 0 > c ad c 0 > 2c 2. Idividual 3 caot elimiate ay actio from the space. At step k = 2, idividual 3 elimiates all actios except 0 by S0. Sice all idividuals have sigleto o-domiated actio spaces, i.e., N \ 2 = /0, the process eds. Furthermore, the correspodig actio profile is a Nash equilibrium of the stage game i S by Lemma 2. If a actio a i is strictly domiated the there exists a more preferable actio a i for ay circumstace. It is clear that if a actio is strictly domiated the it caot be a ratioal actio from S6. I a game we ca iteratively remove the strictly domiated actios, this process is called the iterated elimiatio of strictly domiated strategies ad is defied below. Defiitio 2 Iterated elimiatio of strictly domiated actios Set the iitial set of actios A 0 i = [0,] for all i, ad for ay k N set A k i = {a i A k i ai is ot strictly domiated give ay a Ni A k N i } S8 We deote the set of actios of idividual i that survive the iterated elimiatio by A i := k=0 A k i. Whe A i has a sigle elemet, we say A i is a sigleto. We formally state a iterated elimiatio process for the game i S. Defiitio 3 A iterated elimiatio process for the epidemic game Begi with actio spaces A 0 i = [0,] for all i N. Fix s {0,}. Iterate k =,2,... [k = odd] Let A k i = for all i k where { k := i N \ k l= l : c 0 > 2 [k = eve] Let A k i = 0 for all i k where { k := i N \ k l= l : c 0 < c s i c s i \ l=eve l l=odd l s j + c 2 s i s j + c 2 s i \ l=eve l s j l=odd l s j } } S9 S0 If k = /0 the stop iteratio of k. Our ext result shows that the process described above elimiates all strictly domiated strategies i fiite time. Lemma Cosider the process described i Defiitio 3. There exists a iteratio step k such that {A k i } i N actios that are ot strictly domiated for the game with payoffs S ad state s {0,}. are the set of Proof: First cosider the odd iteratio steps, k = odd. If the coditio iside the bracket i S9 holds the for ay actio that idividual j N i \ l=eve l takes, a i = domiates ay other actio a i [0,] \ {} by Defiitio. To see this first 2/4

3 recall the best respose of idividual i S5. Note that by the eve steps, idividuals j l=eve l have a j = 0 as the oly ot domiated actio. Hece the best respose of idividual i ca be rewritte as c 0 > c s i \ l=eve l a j s j + c 2 s i \ l=eve l a j s j where we remove eighbors that oly have zero as the ot domiated actio. If the iequality iside the idicator fuctio is true eve whe the remaiig eighbors of i take actio, the a i = domiates all the other actios [0, of i, that is, for all a j [0,] for j N \ i, c 0 > c 0 > c s i c s i \ l=eve l s j + c 2 s i \ l=eve l \ l=eve l a j s j + c 2 s i s j \ l=eve l a j s j Assumig the left had side of the above iequality is oe the by the defiitio of strictly domiated actio i Defiitio, a i = is the oly actio that is ot domiated. Next, we cosider the eve iteratio steps, k = eve. If the coditio iside the bracket i S0 holds the for ay actio that idividual j N i \ l=odd l takes, a i = 0 domiates a i [0,] \ {0} by Defiitio. To see this first recall the best respose of idividual i S5. Note that by the odd steps, idividuals j l=odd l have a j = as the oly ot domiated actio. Hece the best respose of idividual i ca be rewritte as c 0 > + c 2 s i c s i \ l=odd l \ l=odd l a j s j + a j s j + l=odd l l=odd l s j S S2 s j S3 where we separate eighbors j N i l=odd l that oly have a j = as the ot domiated actio from the other eighbors j N i \ l=odd l. If the iequality iside the idicator fuctio is false eve whe the remaiig eighbors of i take actio 0, the a i = 0 domiates all the other actios 0,] of i, that is, for ay a j [0,] for j N i \ l=odd l c 0 < c s i s j l=odd l c 0 < c s i + c 2 s i \ l=odd l \ l=odd l + c 2 s i a j s j + a j s j + l=odd l l=odd l l=odd l s j s j s j S4 Assumig the left had side of the above iequality is oe the by the defiitio of strictly domiated actio i Defiitio, a i = 0 is the oly actio that is ot domiated. Further if o idividual ca elimiate a domiated strategy k = /0 at a iteratio k the at followig iteratios k +,k + 2,... there wo t be ay idividuals that elimiate ay actios as strictly domiated. To see this, assume the opposite is true, that is, k + /0. Sice k = /0 the the coditio i k + is idetical to the coditios iside S9 or S0 for k depedig o whether k + is odd or eve, respectively. There caot be a idividual that satisfies the coditios at iteratio k + because k + is selected amog idividuals that have ot bee previously i ay set, i.e., i N \ k l= l. This cotradicts k + /0. As a result, at each iteratio k the umber of idividuals i k has to be positive util a iteratio step k at which either there is o idividual left N \ k l= l = /0 or there is o idividual that satisfies the coditio after the colo i S9 or S0. Suppose ow that the process stops at iteratio k, i.e., k = /0, but there exists a idividual i N \ k l= l with strictly domiated actio S7 a i A k i. Suppose k is odd the by S2, ay actio a i A k i \ {} must be domiated by a i =. Suppose k is eve, the by S4 ay actio a i A k i \ {0} must be domiated by a i = 0. The k /0 which is a cotradictio. This 3/4

4 together with the fact that if k = /0 the l = /0 for l > k implies that if the process i Defiitio 3 stops all the strictly domiated strategies are elimiated. Fially, the fact that the umber of elemets of k is positive at every iteratio except the last iteratio i Defiitio 3 implies that the iteratio eds i at most iteratios. The followig Lemma shows that oce all the strictly domiated strategies are elimiated, the actio profile that assigs socialize to susceptible idividuals ad do ot socialize to ifected idividuals is a pure Nash equilibrium strategy profile. Lemma 2 Cosider the game defied by the payoffs i S give state s {0,} ad the iterated elimiatio process i Defiitio 3. Deote the actio space of i N that is ot strictly domiated by A i. Let a i = A i if A i is a sigleto. If A i is ot a sigleto the let a i = for s i = 0 ad a i = 0 for s i =. The resultig actio profile a is a pure Nash equilibrium of the game. Proof: We will use the followig equivalet defiitio i S6 of Nash equilibrium for the stage game i S, a i = c 0 > c s i a js j + c 2 s i a j s j. S5 Note that at the ed of the elimiatio process i Defiitio 3, the actio space of a idividual i is either a sigleto or is equal to A i = [0,]. A strictly domiated actio caot satisfy the above equatio, hece the equilibrium actio of a idividual with a sigleto o-domiated actio space is give by a i = A i. Now cosider i N such that A i = [0,]. Suppose a i = for a susceptible idividual s i = 0 is ot a Nash equilibrium actio. The idividual i ca deviate ad by the above equatio it must be that a i = 0 is a Nash equilibrium actio because c 0 < c a js j. S6 Note that by our assumptio a j = 0 for all the ifected idividuals s j = at which 0 is ot a strictly domiated actio, i.e., whe A j = [0,]. Hece i the right had side of the above iequality oly idividuals that do ot have 0 i their ot domiated actio set will matter. Furthermore, if 0 is a strictly domiated actio, socialize actio is the oly remaiig ot strictly domiated actio. Hece, we ca write the above iequality as follows, c 0 < c s j. :{0}/ A j S7 Now ote that if the above iequality is true the should be strictly domiated by actio 0 for idividual i. Hece, it is a cotradictio to the fact that the actio space is ot a sigleto, A i [0,]. A similar cotradictio argumet ca be made for the ifected idividuals s i = ad the equilibrium actio a i = 0. Therefore, the actio profile described i the statemet must be a pure Nash equilibrium of the game. Lemma shows that the process i Defiitio 3 elimiates all domiated actios i fiite time. Furthermore, if all idividuals are icluded i the process, i.e., if N = k= k the we ed up with a sigleto actio profile that is ot strictly domiated. This meas the game has a uique pure Nash equilibrium by defiitio of strictly domiated actio. If at the ed of the process i Defiitio 3, if all idividuals are ot icluded i the process, i.e., N \ k= k /0 the the set of ot strictly domiated actios is ot a sigleto. Lemma 2 proposes a pure strategy profile that is a Nash equilibrium of the game i S for the case that actio spaces of idividuals that survive strict elimiatio process are ot all sigleto. Lemmas ad 2 cosidered the stage game with payoffs S give state s {0,}. A MMPE strategy profile σ is a mappig from ay state to the actio space. We ca obtai a pure MMPE strategy profile usig Lemma 2 for all possible states s {0,}. That is, we use the elimiatio process i Defiitio 3 ad the actio assigmet give i Lemma 2 for all the states to costruct a MMPE strategy profile. I our simulatios, i this paper, we costruct the MMPE equilibrium strategy profiles followig this process see Fig. S for a example. B Price of Aarchy of the stage game I this sectio, we cosider the sub-optimality of the decisios of idividuals that play accordig to a MMPE strategy profile. By the defiitio of MMPE strategy, idividuals cosider curret payoffs ad play accordig Nash equilibrium strategy of that stage game. I the followig we show the worst stage game Nash equilibrium strategy ca be fold worse tha the optimal actio profile give a etwork ad state. 4/4

5 Defie the stage game Γs,G,c with payoffs i S parametrized by the disease state s, cotact etwork G ad utility costats c := {c 0,c,c 2 }. The welfare value of the actio profile a i this game is the sum of utilities of the idividuals, Wa,st = i= u i a i,a Ni,st = i= c 0 a i c + c 2 i, j E s i ts j ta i a j. S8 Note that the first summatio is over all the idividuals ad the secod summatio is over all the edges E i the etwork G. We defie the optimum actio profile as the maximizer of the welfare fuctio above, i.e., a opt = argmax a Wa,st. We deote the set of Nash equilibrium actio profiles by A ad defie the price of aarchy PoA as the ratio of the worst possible Nash actio profile to the optimum actio profile, PoA := mi a A Wa Wa opt. Obviously, PoA. I the followig we provide a lower boud o the price of aarchy. Propositio For a game Γs,G,c, the price of aarchy S9 has the followig lower boud PoA max i N N i maxc,c 2 c 0 where N i is the degree coectivity of i. Proof: Cosider the derivatives of u i i S ad W i S8 with respect to a i, respectively, u i = c 0 c s i s j a j + c 2 s i s j a j W = c 0 c + c 2 First ote that u i W W = u i s i s j a j + s i s j a j for ay s ad a i because c 2 s i s j a j + c s i s j a j S9 S20 S2. S22. S23 Therefore, give actios of others a i ad state s, it could be that u i > 0 while W < 0. Cosider the optimal ad equilibrium actio profiles where a opt j = a j for j N \ i, ad aopt i = 0 but a i =. That is, we have u j a j < 0 ad W a j < 0 for all j i but u i > 0 while W < 0. The, the differece betwee the equilibrium profile welfare Wa,s ad optimal actio profile welfare Wa opt,s is equal to S23, that is, Wa,s Wa opt,s = W We divide the differece above by Wa opt,s to get S24 + Wa W,s Wa opt,s = Wa opt,s. S25 Now assume u i = ε > 0 to get Wa ε c 2 s i,s j Ni s j a j + c s i j Ni s j a j Wa opt,s = + Wa opt. S26,s A trivial lower boud o the term for the umerator above is maxc,c 2 N i for ay state s. Furthermore a trivial upper boud for Wa opt,s is c 0. Usig these bouds we obtai a boud for the above equality, Wa,s Wa opt,s maxc,c 2 N i c 0 S27 5/4

6 Figure S2. Price of aarchy i the star etwork Example. We cosider the strog empathy c 0 < c 2 ad strog averseess c 0 < c case i Figure 2d of the mai mauscript. Left ad right figures show the two stage game pure Nash equilibria. The Nash equilibrium actio profile show by the right figure is optimal with welfare equal to c 0. The Nash equilibrium actio profile show by the left figure attais a welfare equal to c 0. The PoA is equal to /. Now ote that the choice of the idividual i is arbitrary. Whe this idividual is the idividual with the largest umber of eighbors we get a lower boud o the right had side of the above iequality which is the worst case lower boud o the price of aarchy i S20. Note that this upper boud ca be arbitrarily bad, i.e., i the order of /. I the discussio followig Figure 2d i the mai text we show that this boud is tight. We repeat this example below. Example Cosider a star etwork with idividuals. The ceter idividual with eighbors is the oly ifected idividual. Payoff costats are such that c 0 < c ad c 0 < c 2. There are two stage game Nash equilibria: a opt i = if s i = 0 ad a opt i = 0 if s i =, ad 2 a i = 0 if s i = 0 ad a i = if s i =. The first Nash equilibrium is also the optimal actio profile a opt yieldig a welfare of c 0. The secod Nash equilibrium a obtais a welfare of c 0 resultig i a PoA of Aother example o a star etwork follows. Example 2 Cosider the star etwork show i Figure S2. The ceter idividual has eighbors ad is the oly ifected idividual. Costats are such that c 0 = c + ρ ad c 0 = c 2 + ρ 2 for arbitrarily small positive costats ρ > 0 ad ρ 2 > 0, so that c 0 < c + c 2. The uique NE actio profile is that all idividuals are social, a i = for all i N. The welfare for the NE is Wa = c 0 c + c 2 = ρ + ρ 2. The optimal actio profile is that oly the susceptible odes are social a opt i = for i ad a opt = 0. The welfare for the a opt is Wa opt = c 0. The PoA ρ /c 0 for large. Here, we see that PoA is determied by the closeess of c to c 0. Note that i this example, equilibrium is uique ad, ulike Example, the optimal actio profile is ot a Nash equilibrium. Aother otio that eables us to gauge the optimality of equilibria is the Price of Stability PoS. PoS is the ratio of the best possible Nash actio profile to the optimum actio profile,. PoS := max a A Wa Wa opt S28 Note that PoS by defiitio of a opt. We remark that i Example 2, the equilibrium is uique, meaig PoS = PoA. Therefore, ot oly the PoA but also the PoS ca be arbitrarily bad. C R 0 boud We formally defie the reproductive ratio R 0 i the followig. 6/4

7 Defiitio 4 Let the iitial state of the populatio be give by s where s i =, otherwise s j = 0 for all j i for some radomly selected idividual i. The R 0 is the expected umber of idividuals that cotract the disease from the radomly selected idividual i util i heals, [ R 0 := E E [ t= j= s j t + s j t =,i js i l = for l < t s ]] where s j t + s j t =,i j is the idicator fuctio that is oe if idividual j trasitios to a ifected state at time t ad i is the oe ifectig j, ad s i l = for l < t is the idicator fuctio that is oe if idividual i has ot healed yet. The outside expectatio is with respect to the uiform distributio that selects the iitial ifected idividual, ad the iside expectatio is with respect to the trasitio probabilities of the Markov chai. I the followig, we derive bouds for R 0 give that idividuals act accordig to a MMPE strategy profile ad we select the iitial ifected idividual radomly from the etwork. Theorem Cosider a etwork with degree distributio Pk. Assume the ifected idividual is chose from the populatio uiformly at radom. Scale c 0 with β for coveiece, i.e., c 0 := βc 0, ad assume c 0 > c.assume c 0 > c. The R 0 defied i S29 has the followig upper boud, R 0 β δ K k= kpk where K := mi c 0 /c 2,. Proof: We start by movig the secod expectatio iside the sum i the defiitio of R 0 S29 to get the followig, R 0 = E [ t= j= E [ s j t + s j t =,i js i l = for l < t s ] ]. Now cosider the coditioal expectatio iside the summatio which we ca equivaletly represet as the followig coditioal probability E[s j t + s j t =,i js i l = for l < t s] S29 S30 S3 = P s j t + s j t =,i j,s i l = for l < t s. S32 Note that the above coditioal probability is the probability that j is ifected by i at time t ad i remaied ifected util time t give i is ifected at t = 0. Usig the chai rule ad law of total probability, we ca write the above coditioal probability as follows Ps j t + s j t =,i j,s i l = for l < t s = P s j t + s j t =,i j s i t =,s j t = 0,s Ps i t =,s j t = 0 s i l = for l < t,s + P s j t + s j t =,i j si t = 0,s j t = 0,s Ps i t = 0,s j t = 0 si l = for l < t,s + P s j t + s j t =,i j si t =,s j t =,s Ps i t =,s j t = si l = for l < t,s + P s j t + s j t =,i j s i t = 0,s j t =,s Ps i t = 0,s j t = s i l = for l < t,s P s i l = for l < t s Note that the first four lies o the right had side equal to the probability that i ifects j at time t give that i remaied ifected util t by law of total probability. The last lie is the probability that i remaied ifected give that i started ifected sice s i =. Observe that the probability that i ifects j is zero if idividual i is susceptible at time t or idividual j is ifected, i.e., P s j t + s j t =,i j s i t = 0 = 0 or P s j t + s j t =,i j s j t = = 0. Hece oly the first lie of the four lie expressio is ozero which simplifies the idetity above as follows Ps j t + s j t =,i j,s i l = for l < t s = P s j t + s j t =,i j si t =,s j t = 0,s Ps i t =,s j t = 0 si l = for l < t,s P s i l = for l < t s S33 S34 7/4

8 The probability of healig at each step is idepedet, hece the last coditioal probability is equal to δ t. The coditioal probability that i remais ifected ad j is ifected at time t give that i is ifected util time t is less tha δ by the argumet below, Ps i t =,s j t = 0 s i l = for l < t,s = Ps j t = 0 s i t =,s i l = for l < t,sps i t = s i l = for l < t,s S35 Ps i t = si l = for l < t,s = δ. The first equality above follows by chai rule. The iequality follows by the fact that the probability is less tha oe. The secod equality is true by the trasitio probability of idividual i from a ifected state. Substitutig these idetities iside the equatio S34 we obtai the followig S36 S37 Ps j t + s j t =,i j,s i l = for l < t s P s j t + s j t =,i j si t =,s j t = 0,s δ t. S38 Now cosider the coditioal probability o the right had side of S38, the probability that j is ifected at time t + by i give that j is susceptible ad i is ifected at time t. We have the followig upper boud, Ps j t + s j t =,i j si t =,s j t = 0,s = P s j t + =,i j si t =,s j t = 0,s = P s j t + =,i j a i t =,a jt =,s i t =,s j t = 0,s P a i t =,a jt = s i t =,s j t = 0,s P s j t + =,i j a i t =,a jt =,s i t =,s j t = 0,s P a i t = si t =,s j t = 0,s = β j N i P a i t = si t =,s j t = 0,s S39 The first equality is by the fact that s j t + = if s j t = 0 ad s j t + s j t =. The secod equality above is by the law of total probability ad by the fact that if i or j takes a actio to self-isolate, i.e., a j t = 0 or a i t = 0, the i caot ifect j. The iequality follows by the fact that P a i t =,a j t = si t =,s j t = 0 P a i t = si t =,s j t = 0. The last equality follows because if both agets socialize at ormal levels the the ifectio probability is β whe aget j ad i are coected, j N i. Now we cosider a i t. We kow that the MMPE actio of idividual i is a best respose to best respose actios of eighbors from S6 where best respose fuctio is give by S5. Specifically from the perspective of a ifected idividual i, the best respose actio is give by the followig a i t = c 0 > c 2 a jt s j t S40 Cosider t =. If c 0 > c, the a j = for all j N i. Hece, if c 0 > c 2 N i the a i =, i.e., a i = c 0 > c 2 N i. Also ote that if a i = the a i t = for all t >. Moreover, if a i = 0 the i ever ifects aother ode if it is the oly iitially ifected idividual. Hece, we have a i t = a i for all t. That is, the actio of aget i at time t is determied by the iitial actio ad is idepedet of the state at time t. Therefore, we ca write P a i t = si t =,s j t = 0,s = P a i = s = c 0 > c 2 N i. S4 Substitutig the above idetity i S39 ad usig S39 i S38, which the we substitute to S32, we get the followig upper boud for R 0 i S3, R 0 E [ t= j= βc 0 > c 2 N i j N i δ t ]. S42 8/4

9 Now ote the idicator fuctio terms deped o the etwork of idividual i but they do ot deped o the idetities of the eighbors. I fact, j= j N i is equal to the umber of eighbors of i, i.e., N i. I additio, we have t= δt = /δ. Usig these idetities, we ca write the above boud as follows, R 0 β δ E [ N i c 0 > c 2 N i ] S43 Idividual i is chose uiformly radom ad it has k eighbors with probability Pk, therefore, the expectatio o the right had side is equal to the followig, R 0 β δ k= kk < c 0 c 2 Pk S44 Boud i S30 follows. D R 0 boud scale-free Corollary Cosider a radom scale free etwork where the degree distributio follows Pk k γ for γ = 2. The R 0 defied i S29 has the followig upper boud, R 0 β 2 δ logmi c 0/c 2, +. S45 Proof: We directly use the boud i S30 ad substitute i Pk = L 2,k 2 where L 2, = k= k 2 is the ormalizatio costat for the scale-free distributio R 0 L 2, β δ mi c 0 /c 2, k k= S46 We first upper boud the ormalizatio costat L 2, by the fact that k= k 2 > 2. Hece, L 2, 2. Next we ote that the summatio behaves logarithmically which yields the desired boud i S45. E R boud We formally defie the reproductive ratio R i the followig. Defiitio 5 Let the iitial state of the populatio be give by s where s i =, otherwise s j = 0 for all j i for some kpk k kpk. radomly selected idividual i. The probability that we select a iitial sick idividual with degree k is give by Qk := The R is the expected umber of idividuals that cotract the disease from a radomly selected idividual i util i heals, [ R := E E s j t + s j t =,i js i l = for l < t ]] s S47 [ t= j= where s j t + s j t =,i j is the idicator fuctio that is oe if idividual j trasitios to a ifected state at time t ad i is the oe ifectig j, ad s i l = for l < t is the idicator fuctio that is oe if idividual i has ot healed yet. The outside expectatio is with respect to the probability distributio Qk, ad the iside expectatio is with respect to the trasitio probabilities of the Markov chai. Below we preset a boud for R for a geeric etwork. Theorem 2 Cosider a etwork with degree coectivity distributio Pk. Assume c 0 > c. The R defied i Defiitio 5 has the followig upper boud, R β δ mi c 0 /c 2, k= k 2 Pk k= kpk S48 9/4

10 β = 0. β = 0.2 β = 0.3 Figure S3. Effect of risk averseess c ad empathy c 2 costats o mea eradicatio time. We fix the healig rate to δ = 0.2 ad the populatio size to = 00. The ifectio rate β values equal to 0.,0.2, ad 0.3 for figures left, middle, ad right, respectively. We let c 0 = for each figure. The axes i the figures correspod to the costat values of c ad c 2. For a give value of c ad c 2, we geerate 50 scale-free etworks usig the preferetial attachmet algorithm ad ru the stochastic disease etwork game for 200 steps for each etwork. Each ru starts with all idividuals ifected. The grid color represets the average eradicatio time amog rus where we let eradicatio time be equal to 200 if the disease is ot eradicated. The eradicatio time decreases as c or c 2 icreases i the regio where disease is eradicated fast, i.e., R >. Proof: First ote that the oly differece betwee the R 0 defiitio ad R is the differece i probability distributios of selectig the iitial ifected idividual. Hece, the boud i S43 applies to R which we repeat here for coveiece, R β δ E [ N i c 0 > c 2 N i ] S49 where ow the expectatio is with respect to the distributio Qk. Therefore, the expectatio o the right had side is equal to the followig, R β δ k= kk < c 0 c 2 Qk S50 Boud i S48 follows by usig the defiitio of Qk = F R boud scale-free kpk k kpk. Corollary 2 Cosider a radom scale free etwork where the degree distributio follows Pk k γ for γ = 2. The R give by Defiitio 5 has the followig upper boud, R β δ mi c 0 /c 2,. log S5 Proof: We directly use the boud i S48 ad substitute i Pk = L 2,k 2 where L 2, = k= k 2 is the ormalizatio costat for the scale-free distributio R β δ mi c 0 /c 2, k= L 2, L 2, l= l = β δ mi c 0 /c 2, k= l= l. S52 The boud i S5 follows by otig that l= l log. G Mea eradicatio time See Figure S3 for the effect of parameters c, c 2, β o eradicatio time. H Average ifectivity levels See Figure S4 for the effect of parameters c, c 2, β o ifectivity level. 0/4

11 β = 0. β = 0.2 β = 0.3 Figure S4. Effect of risk averseess c ad empathy c 2 costats o average ifectivity level. We fix the healig rate to δ = 0.2 ad the populatio size to = 00. The ifectio rate β values equal to 0.,0.2, ad 0.3 for figures left, middle, ad right, respectively. We let c 0 = for each figure. The axes i the figures correspod to the costat values of c ad c 2. For a give value of c ad c 2, we geerate 50 scale-free etworks usig the preferetial attachmet algorithm ad ru the stochastic disease etwork game for 200 steps for each etwork. Each ru starts with all idividuals ifected. The grid color represets the average of ifectivity level at time t = 200 amog rus. Icreasig c reduces the average umber of ifected i the populatio whether the disease is edemic or ot. I Critical empathy thresholds for modified scale-free etworks I the preferetial attachmet model, used i Figures 4-6 of the mai text, a ode is added at each step ad is coected to a existig ode selected radomly proportioal to their degree see the Barabasi-Albert algorithm. A modificatio to this algorithm is whe each added ode is coected to two existig odes selected radomly proportioal to their degree. This modified algorithm geerates scale-free etworks with a expected scalig degree of γ = 2.3 while the o-modified preferetial attachmet algorithm geerates a expected scalig degree of γ = 2. I Figure S5, we test the accuracy of the bouds for R 0 ad R i equatios S30 ad S48 equatios ad 4 i the mai text for scale-free etworks geerated accordig to the modified preferetial attachmet algorithm. Usig these iequalities ad substitutig for Pk = L 2.3,k 2.3 where L 2.3, is a ormalizig costat, we solve for empathy costat values c 2 that make the right had side of equatios ad 4 less tha oe see the captio of Fig. S5 for the critical empathy values. We ote that the closed form critical thresholds of the empathy costat c 2 i equatios S45 ad S5 equatios 3 ad 6 of mai text are obtaied whe the etwork is scale-free with scalig degree γ = 2. The critical empathy values obtaied for γ = 2.3 are greater tha the critical empathy values whe γ = 2. Numerical experimets show that the critical empathy costats that make R < are still good idicators of fast disease eradicatio. J Sesitivity to iitial level of ifectivity We assess the robustess of the critical empathy threshold to iitial coditios by cosiderig iitial ifectivity levels of {5%,20%,50%} i Figure S6. Besides the differece i iitial coditios, the umerical setup is idetical to Figure 6 i mai text. The umerical experimets cofirm that the critical empathy threshold for R i S5 is a good idicator for disease eradicatio. There are oly a few rus which fail to eradicate the disease withi 200 time steps whe the critical empathy for R < is exceeded refer to the captio of Figure S6 for details. K Epidemic threshold whe c 2 = 0 If c 2 = 0, a MMPE actio profile at time t ca simply be writte as follows, a i t = c 0 > c s i t s j t. S53 That is, the ifected will socialize ormally at all times ad a susceptible aget will socialize if the umber ifected aroud is less tha c 0 c. Give the MMPE profile above, the ifectio probability of a susceptible idividual i is give by p i 0 t = Ps it + = s i t = 0 = βa i ts j t. S54 /4

12 Figure S5. Effect of risk averseess c ad empathy c 2 costats o disease eradicatio with scale-free etworks with higher scalig degree. We cosider = 00 idividuals, ad let δ = 0.2, ad c 0 =. The scale-free etwork is geerated accordig to the modified preferetial attachmet algorithm resultig i a scale-free etwork with average scalig degree of γ = 2.3. The average ode degree is The critical values of c 2 {0.04,0.35,.0} that make R 0 < for β = {0.,0.2,0.3} calculated usig equatio S30 are marked with white dotted dashed lies. The critical values of the empathy costat, c 2 = {0.2,0.27,0.35} marked with red solid lies, that make R < for β = {0.,0.2,0.3} calculated usig equatio S48 are still accurate i determiig fast eradicatio. 2/4

13 Figure S6. Effect of risk averseess c ad empathy c 2 costats o disease eradicatio whe iitial umber of ifected is 5% top, 20% middle, ad 50% bottom of the populatio. We cosider = 00 idividuals, ad let δ = 0.2, ad c 0 =. For a give value of c ad c 2, we geerate 50 scale-free etworks usig the preferetial attachmet algorithm ad ru the stochastic disease etwork game for 200 steps for each etwork. The grid color represets the ratio of rus i which disease is eradicated withi 200 steps. For figures left, middle, ad right the eradicatio of threshold βλ max A/δ is equal to 2.65, 5.3, ad 8, respectively. The critical values of c 2 {0.02,0.6,0.36} that make R 0 < for β = {0.,0.2,0.3} calculated usig equatio S45 are marked with white dotted dashed lies. The critical values of the empathy costat, c 2 = {0.,0.22,0.33}, that make R < for β = {0.,0.2,0.3} calculated usig equatio S5 are accurate i determiig fast eradicatio for ay value of c marked with red solid lies. The rate of disease eradicatio is above 95% amog 50 trials whe the value of the empathy costat is above the threshold that makes R <. That is, for c 2 that make R < there are oly a few trials that fail to eradicate the disease withi 200 steps which are observed whe β = 0. ad 20% iitially ifected, ad whe β = {0.2,0.3}. 3/4

14 We ca boud the above coditioal probability as follows by usig the relatio j Ni βa i a j s j t βa i j Ni a j s j t, p i 0 t βa i t s j t. S55 Next we obtai a -state approximatio of the Markov chai dyamics see for a similar approximatio 2. Defie the probability of ifectio of idividual i at time t p i t = E[s i t]. Let pt [0,] be ifectio probability vector of the populatio. By law of total probability, p i t + = p i t δ + p i tp i 0 t. S56 Usig the upper boud above for p i 0 t ad otig that a i = c 0 > βc j Ni s j t from S53 if s i t = 0, we obtai p i t + p i t δ + p i tβ c 0 > c s j t s j t. S57 We ow approximate the above boud by replacig s j t terms with p j t to get p i t + p i t δ + p i tβ c 0 > c p j t p j t. S58 Whe we liearize the dyamics of pt defied by S58 aroud the fixed poit origi 0, i.e., the state of disease eradicatio p i t = 0 for all i, we get the followig, pt + = δi + βapt S59 where I is the idetity matrix ad A [0,] is the adjacecy matrix of the cotact etwork, i.e., its i jth elemet A i j = if j N i, otherwise A i j = 0. The approximate disease dyamics i S59 is liear. Furthermore, the origi 0 is a globally stable fixed poit if ad oly if λ max δi + βa < 3. We ca equivaletly write this coditio as β δ λ maxa <. This result implies that the state of disease eradicatio is ustable if β δ λ maxa >. Note that this threshold does ot deped o the risk averseess costat c. This implies that risk aversio caot by stop a outbreak whe c 2 = 0, except i the extreme case of c 0 < c. Refereces. Barabási, A.-L. & Albert, R. Emergece of scalig i radom etworks. Sciece 286, Paarpor, K., Eksi, C., Weitz, J. S. & Shamma, J. S. Epidemic spread over etworks with aget awareess ad social distacig. I Proceedigs of the 53rd Aual Allerto Coferece o Commuicatios, Cotrol, ad Computig, 5 57 Allerto, Illiois, USA, Va Mieghem, P., Omic, J. & Kooij, R. Virus spread i etworks. IEEE/ACM Trasactios o Networkig 7, DOI 0.09/TNET /4

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ. 2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For

More information

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4. 4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad

More information

Generalized Semi- Markov Processes (GSMP)

Generalized Semi- Markov Processes (GSMP) Geeralized Semi- Markov Processes (GSMP) Summary Some Defiitios Markov ad Semi-Markov Processes The Poisso Process Properties of the Poisso Process Iterarrival times Memoryless property ad the residual

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak

More information

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

Markov Decision Processes

Markov Decision Processes Markov Decisio Processes Defiitios; Statioary policies; Value improvemet algorithm, Policy improvemet algorithm, ad liear programmig for discouted cost ad average cost criteria. Markov Decisio Processes

More information

Econ 325/327 Notes on Sample Mean, Sample Proportion, Central Limit Theorem, Chi-square Distribution, Student s t distribution 1.

Econ 325/327 Notes on Sample Mean, Sample Proportion, Central Limit Theorem, Chi-square Distribution, Student s t distribution 1. Eco 325/327 Notes o Sample Mea, Sample Proportio, Cetral Limit Theorem, Chi-square Distributio, Studet s t distributio 1 Sample Mea By Hiro Kasahara We cosider a radom sample from a populatio. Defiitio

More information

CS284A: Representations and Algorithms in Molecular Biology

CS284A: Representations and Algorithms in Molecular Biology CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by

More information

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1 EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum

More information

SRC Technical Note June 17, Tight Thresholds for The Pure Literal Rule. Michael Mitzenmacher. d i g i t a l

SRC Technical Note June 17, Tight Thresholds for The Pure Literal Rule. Michael Mitzenmacher. d i g i t a l SRC Techical Note 1997-011 Jue 17, 1997 Tight Thresholds for The Pure Literal Rule Michael Mitzemacher d i g i t a l Systems Research Ceter 130 Lytto Aveue Palo Alto, Califoria 94301 http://www.research.digital.com/src/

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Random Models. Tusheng Zhang. February 14, 2013

Random Models. Tusheng Zhang. February 14, 2013 Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the

More information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

Basics of Probability Theory (for Theory of Computation courses)

Basics of Probability Theory (for Theory of Computation courses) Basics of Probability Theory (for Theory of Computatio courses) Oded Goldreich Departmet of Computer Sciece Weizma Istitute of Sciece Rehovot, Israel. oded.goldreich@weizma.ac.il November 24, 2008 Preface.

More information

10-701/ Machine Learning Mid-term Exam Solution

10-701/ Machine Learning Mid-term Exam Solution 0-70/5-78 Machie Learig Mid-term Exam Solutio Your Name: Your Adrew ID: True or False (Give oe setece explaatio) (20%). (F) For a cotiuous radom variable x ad its probability distributio fuctio p(x), it

More information

CS322: Network Analysis. Problem Set 2 - Fall 2009

CS322: Network Analysis. Problem Set 2 - Fall 2009 Due October 9 009 i class CS3: Network Aalysis Problem Set - Fall 009 If you have ay questios regardig the problems set, sed a email to the course assistats: simlac@staford.edu ad peleato@staford.edu.

More information

1 Games in Normal Form (Strategic Form)

1 Games in Normal Form (Strategic Form) 1 Games i Normal Form Strategic Form) A Game i Normal strategic) Form cosists of three compoets: 1 A set of players For each player, a set of strategies called actios i textbook) The iterpretatio is that

More information

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense, 3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [

More information

Ω ). Then the following inequality takes place:

Ω ). Then the following inequality takes place: Lecture 8 Lemma 5. Let f : R R be a cotiuously differetiable covex fuctio. Choose a costat δ > ad cosider the subset Ωδ = { R f δ } R. Let Ωδ ad assume that f < δ, i.e., is ot o the boudary of f = δ, i.e.,

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

Because it tests for differences between multiple pairs of means in one test, it is called an omnibus test.

Because it tests for differences between multiple pairs of means in one test, it is called an omnibus test. Math 308 Sprig 018 Classes 19 ad 0: Aalysis of Variace (ANOVA) Page 1 of 6 Itroductio ANOVA is a statistical procedure for determiig whether three or more sample meas were draw from populatios with equal

More information

Optimally Sparse SVMs

Optimally Sparse SVMs A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but

More information

Problem Set 4 Due Oct, 12

Problem Set 4 Due Oct, 12 EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios

More information

Lecture 19: Convergence

Lecture 19: Convergence Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may

More information

Rademacher Complexity

Rademacher Complexity EECS 598: Statistical Learig Theory, Witer 204 Topic 0 Rademacher Complexity Lecturer: Clayto Scott Scribe: Ya Deg, Kevi Moo Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved for

More information

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios

More information

1. By using truth tables prove that, for all statements P and Q, the statement

1. By using truth tables prove that, for all statements P and Q, the statement Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3

More information

1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable

More information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

4. Partial Sums and the Central Limit Theorem

4. Partial Sums and the Central Limit Theorem 1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

Random Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.

Random Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A. Radom Walks o Discrete ad Cotiuous Circles by Jeffrey S. Rosethal School of Mathematics, Uiversity of Miesota, Mieapolis, MN, U.S.A. 55455 (Appeared i Joural of Applied Probability 30 (1993), 780 789.)

More information

Lecture 2. The Lovász Local Lemma

Lecture 2. The Lovász Local Lemma Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio

More information

# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf.

# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf. Combiatorics Graph Theory Coutig labelled ad ulabelled graphs There are 2 ( 2) labelled graphs of order. The ulabelled graphs of order correspod to orbits of the actio of S o the set of labelled graphs.

More information

2 Markov Chain Monte Carlo Sampling

2 Markov Chain Monte Carlo Sampling 22 Part I. Markov Chais ad Stochastic Samplig Figure 10: Hard-core colourig of a lattice. 2 Markov Chai Mote Carlo Samplig We ow itroduce Markov chai Mote Carlo (MCMC) samplig, which is a extremely importat

More information

Distribution of Random Samples & Limit theorems

Distribution of Random Samples & Limit theorems STAT/MATH 395 A - PROBABILITY II UW Witer Quarter 2017 Néhémy Lim Distributio of Radom Samples & Limit theorems 1 Distributio of i.i.d. Samples Motivatig example. Assume that the goal of a study is to

More information

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f. Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,

More information

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai

More information

1 Introduction to reducing variance in Monte Carlo simulations

1 Introduction to reducing variance in Monte Carlo simulations Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

The multiplicative structure of finite field and a construction of LRC

The multiplicative structure of finite field and a construction of LRC IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio

More information

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory 1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.

More information

Intro to Learning Theory

Intro to Learning Theory Lecture 1, October 18, 2016 Itro to Learig Theory Ruth Urer 1 Machie Learig ad Learig Theory Comig soo 2 Formal Framework 21 Basic otios I our formal model for machie learig, the istaces to be classified

More information

Lecture Notes for Analysis Class

Lecture Notes for Analysis Class Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios

More information

Properties and Hypothesis Testing

Properties and Hypothesis Testing Chapter 3 Properties ad Hypothesis Testig 3.1 Types of data The regressio techiques developed i previous chapters ca be applied to three differet kids of data. 1. Cross-sectioal data. 2. Time series data.

More information

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) = AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,

More information

Polynomial identity testing and global minimum cut

Polynomial identity testing and global minimum cut CHAPTER 6 Polyomial idetity testig ad global miimum cut I this lecture we will cosider two further problems that ca be solved usig probabilistic algorithms. I the first half, we will cosider the problem

More information

Stability Analysis of the Euler Discretization for SIR Epidemic Model

Stability Analysis of the Euler Discretization for SIR Epidemic Model Stability Aalysis of the Euler Discretizatio for SIR Epidemic Model Agus Suryato Departmet of Mathematics, Faculty of Scieces, Brawijaya Uiversity, Jl Vetera Malag 6545 Idoesia Abstract I this paper we

More information

Optimization Methods MIT 2.098/6.255/ Final exam

Optimization Methods MIT 2.098/6.255/ Final exam Optimizatio Methods MIT 2.098/6.255/15.093 Fial exam Date Give: December 19th, 2006 P1. [30 pts] Classify the followig statemets as true or false. All aswers must be well-justified, either through a short

More information

TERMWISE DERIVATIVES OF COMPLEX FUNCTIONS

TERMWISE DERIVATIVES OF COMPLEX FUNCTIONS TERMWISE DERIVATIVES OF COMPLEX FUNCTIONS This writeup proves a result that has as oe cosequece that ay complex power series ca be differetiated term-by-term withi its disk of covergece The result has

More information

Notes for Lecture 11

Notes for Lecture 11 U.C. Berkeley CS78: Computatioal Complexity Hadout N Professor Luca Trevisa 3/4/008 Notes for Lecture Eigevalues, Expasio, ad Radom Walks As usual by ow, let G = (V, E) be a udirected d-regular graph with

More information

Chapter 6 Principles of Data Reduction

Chapter 6 Principles of Data Reduction Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a

More information

Math 312 Lecture Notes One Dimensional Maps

Math 312 Lecture Notes One Dimensional Maps Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,

More information

Discrete Mathematics for CS Spring 2008 David Wagner Note 22

Discrete Mathematics for CS Spring 2008 David Wagner Note 22 CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 22 I.I.D. Radom Variables Estimatig the bias of a coi Questio: We wat to estimate the proportio p of Democrats i the US populatio, by takig

More information

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

( ) = p and P( i = b) = q.

( ) = p and P( i = b) = q. MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of

More information

Fastest mixing Markov chain on a path

Fastest mixing Markov chain on a path Fastest mixig Markov chai o a path Stephe Boyd Persi Diacois Ju Su Li Xiao Revised July 2004 Abstract We ider the problem of assigig trasitio probabilities to the edges of a path, so the resultig Markov

More information

Lecture 7: October 18, 2017

Lecture 7: October 18, 2017 Iformatio ad Codig Theory Autum 207 Lecturer: Madhur Tulsiai Lecture 7: October 8, 207 Biary hypothesis testig I this lecture, we apply the tools developed i the past few lectures to uderstad the problem

More information

Time-Domain Representations of LTI Systems

Time-Domain Representations of LTI Systems 2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable

More information

MA131 - Analysis 1. Workbook 2 Sequences I

MA131 - Analysis 1. Workbook 2 Sequences I MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................

More information

Chapter 2 The Monte Carlo Method

Chapter 2 The Monte Carlo Method Chapter 2 The Mote Carlo Method The Mote Carlo Method stads for a broad class of computatioal algorithms that rely o radom sampligs. It is ofte used i physical ad mathematical problems ad is most useful

More information

Principle Of Superposition

Principle Of Superposition ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give

More information

Statistics 511 Additional Materials

Statistics 511 Additional Materials Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability

More information

Lesson 10: Limits and Continuity

Lesson 10: Limits and Continuity www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals

More information

1 Convergence in Probability and the Weak Law of Large Numbers

1 Convergence in Probability and the Weak Law of Large Numbers 36-752 Advaced Probability Overview Sprig 2018 8. Covergece Cocepts: i Probability, i L p ad Almost Surely Istructor: Alessadro Rialdo Associated readig: Sec 2.4, 2.5, ad 4.11 of Ash ad Doléas-Dade; Sec

More information

Math F215: Induction April 7, 2013

Math F215: Induction April 7, 2013 Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

The standard deviation of the mean

The standard deviation of the mean Physics 6C Fall 20 The stadard deviatio of the mea These otes provide some clarificatio o the distictio betwee the stadard deviatio ad the stadard deviatio of the mea.. The sample mea ad variace Cosider

More information

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5 Ma 42: Itroductio to Lebesgue Itegratio Solutios to Homework Assigmet 5 Prof. Wickerhauser Due Thursday, April th, 23 Please retur your solutios to the istructor by the ed of class o the due date. You

More information

Lecture 6 Simple alternatives and the Neyman-Pearson lemma

Lecture 6 Simple alternatives and the Neyman-Pearson lemma STATS 00: Itroductio to Statistical Iferece Autum 06 Lecture 6 Simple alteratives ad the Neyma-Pearso lemma Last lecture, we discussed a umber of ways to costruct test statistics for testig a simple ull

More information

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io Chapter 9 - CD compaio CHAPTER NINE CD-9.2 CD-9.2. Stages With Voltage ad Curret Gai A Geeric Implemetatio; The Commo-Merge Amplifier The advaced method preseted i the text for approximatig cutoff frequecies

More information

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said

More information

Math 299 Supplement: Real Analysis Nov 2013

Math 299 Supplement: Real Analysis Nov 2013 Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality

More information

Posted-Price, Sealed-Bid Auctions

Posted-Price, Sealed-Bid Auctions Posted-Price, Sealed-Bid Auctios Professors Greewald ad Oyakawa 207-02-08 We itroduce the posted-price, sealed-bid auctio. This auctio format itroduces the idea of approximatios. We describe how well this

More information

Fundamental Theorem of Algebra. Yvonne Lai March 2010

Fundamental Theorem of Algebra. Yvonne Lai March 2010 Fudametal Theorem of Algebra Yvoe Lai March 010 We prove the Fudametal Theorem of Algebra: Fudametal Theorem of Algebra. Let f be a o-costat polyomial with real coefficiets. The f has at least oe complex

More information

Beurling Integers: Part 2

Beurling Integers: Part 2 Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers

More information

A Proof of Birkhoff s Ergodic Theorem

A Proof of Birkhoff s Ergodic Theorem A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed

More information

Frequentist Inference

Frequentist Inference Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for

More information

Resolution Proofs of Generalized Pigeonhole Principles

Resolution Proofs of Generalized Pigeonhole Principles Resolutio Proofs of Geeralized Pigeohole Priciples Samuel R. Buss Departmet of Mathematics Uiversity of Califoria, Berkeley Győrgy Turá Departmet of Mathematics, Statistics, ad Computer Sciece Uiversity

More information

The Growth of Functions. Theoretical Supplement

The Growth of Functions. Theoretical Supplement The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that

More information

A Note on Matrix Rigidity

A Note on Matrix Rigidity A Note o Matrix Rigidity Joel Friedma Departmet of Computer Sciece Priceto Uiversity Priceto, NJ 08544 Jue 25, 1990 Revised October 25, 1991 Abstract I this paper we give a explicit costructio of matrices

More information

Output Analysis and Run-Length Control

Output Analysis and Run-Length Control IEOR E4703: Mote Carlo Simulatio Columbia Uiversity c 2017 by Marti Haugh Output Aalysis ad Ru-Legth Cotrol I these otes we describe how the Cetral Limit Theorem ca be used to costruct approximate (1 α%

More information

Lecture 7: Properties of Random Samples

Lecture 7: Properties of Random Samples Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ

More information

MINIMAX RATES OF CONVERGENCE AND OPTIMALITY OF BAYES FACTOR WAVELET REGRESSION ESTIMATORS UNDER POINTWISE RISKS

MINIMAX RATES OF CONVERGENCE AND OPTIMALITY OF BAYES FACTOR WAVELET REGRESSION ESTIMATORS UNDER POINTWISE RISKS Statistica Siica 19 (2009) 1389 1406: Supplemet S1 S17 1 MINIMAX RATES OF ONVERGENE AND OPTIMALITY OF BAYES FATOR WAVELET REGRESSION ESTIMATORS UNDER POINTWISE RISKS Natalia Bochkia ad Theofais Sapatias

More information

Discrete probability distributions

Discrete probability distributions Discrete probability distributios I the chapter o probability we used the classical method to calculate the probability of various values of a radom variable. I some cases, however, we may be able to develop

More information

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

CS / MCS 401 Homework 3 grader solutions

CS / MCS 401 Homework 3 grader solutions CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of

More information

Math 61CM - Solutions to homework 3

Math 61CM - Solutions to homework 3 Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig

More information