For each time step t =1,the set St is generated as follows. For each node vESt-1St-2,for each edge (v,u)EE where u is inactive,u becomes active with probability p(,u). This u is then put in set S;of active nodes in time t. Different edges influence independently. For each inactive node u,if it has many neighbors vE St-1St-2:as long as one such v successfully influences u,u becomes active. 9◼ For each time step 𝑡 ≥ 1, the set 𝑆𝑡 is generated as follows. ❑ For each node 𝑣 ∈ 𝑆𝑡−1\𝑆𝑡−2 , for each edge 𝑣, 𝑢 ∈ 𝐸 where 𝑢 is inactive, 𝑢 becomes active with probability 𝑝 𝑣, 𝑢 . ❑ This 𝑢 is then put in set 𝑆𝑡 of active nodes in time 𝑡. ❑ Different edges influence independently. ◼ For each inactive node 𝑢, if it has many neighbors 𝑣 ∈ 𝑆𝑡−1\𝑆𝑡−2 : as long as one such 𝑣 successfully influences 𝑢, 𝑢 becomes active. 9