更改

where <math>A_{ji}</math> is from the adjacency matrix and <math>A_{ji}=1</math> if there is a tie from <math>i</math> to <math>j</math>, and <math>k_i= \textstyle \sum_{j=1}^N A_{ij}</math> is the [[Degree (graph theory)|degree]] for node <math>i</math>;  

where <math>A_{ji}</math> is from the adjacency matrix and <math>A_{ji}=1</math> if there is a tie from <math>i</math> to <math>j</math>, and <math>k_i= \textstyle \sum_{j=1}^N A_{ij}</math> is the [[Degree (graph theory)|degree]] for node <math>i</math>;  

    

    

|3= Then have the choice: {{ordered list|list_style_type=lower-alpha

|3= Then have the choice:  

 

      ordered list

     |1=  If node <math>j</math> is an ignorant, it becomes a spreader at a rate <math>\alpha</math>;

     |1=  If node <math>j</math> is an ignorant, it becomes a spreader at a rate <math>\alpha</math>;

     |2=  If node <math>j</math> is a spreader or stifler, then node <math>i</math> becomes a stifler at a rate <math>\beta</math>.  

     |2=  If node <math>j</math> is a spreader or stifler, then node <math>i</math> becomes a stifler at a rate <math>\beta</math>.  

|4= We pick another node who is a spreader at random, and repeat the process.

|4= We pick another node who is a spreader at random, and repeat the process.

 

     操作表

     操作表

     |1=  如果节点 <math>j</math> 是无知者，它成为一个传播者的速率是 <math>\alpha</math>；

     |1=  如果节点 <math>j</math> 是无知者，它成为一个传播者的速率是 <math>\alpha</math>；

     |2=  如果节点 <math>j</math> 是一个传播者或谣言抑制者, 那么节点<math>i</math> 成为一个谣言抑制者的速率是 <math>\beta</math>.。

     |2=  如果节点 <math>j</math> 是一个传播者或谣言抑制者, 那么节点<math>i</math> 成为一个谣言抑制者的速率是 <math>\beta</math>。

|4= 我们随机选择一个是传播者的节点, 并重复这一过程。

|4= 我们随机选择一个是传播者的节点, 并重复这一过程。