算法模拟大致要求是随机生成n个数,这n个数的平均数为sum/n。让这些节点随机传染,使得每个个体的值无限接近于这个平均值,且有一个兴趣值和参数k,初始感染者兴趣只为1。若母体和被选中的传染者值相同,则不传染,且母体兴趣值/k;若值不相同,则使母体和被传染者的值相平均。
package gossip;
import java.util.Random;
public class gossip {
//节点的个数
private static final int SIZE = 1000;
//初始化SIZE个节点
private double nodes[] = new double[SIZE];
//初始化每个节点的传播兴趣,概率都是1
private double pros[] = new double[SIZE];
//节点随机数的最大值范围
private static final int MAX = 100;
//参数k的值
private static final double K = 1.3;
//判断两个节点相等时的允许误差
private static final double e = 0.000001;
//记录传播的轮数
private int round = 0;
//记录所有节点平均值
private double mean = 0.0;
private double sum = 0.0;
//构造函数,初始化SIZE个随机节点,并且计算出平均值mean
public gossip(){
Random random = new Random();
for(int i = 0; i < nodes.length; i++) {
nodes[i] = random.nextInt(MAX);
//初始化每个结点的兴趣值,都为1
pros[i] = 1.0;
//计算所有节点的总和
sum += nodes[i];
}
//计算出节点真实平均值
mean = sum / SIZE;
}
public void run(){
//设定有传播可能的节点总数为state
int state = SIZE;
//当state的值为0时,所有节点都无传播可能
while(state > 0){
//轮数加1
round = round + 1;
state = SIZE;
Random ramdom = new Random();
for(int i = 0; i < nodes.length; i++){
double pre = ramdom.nextDouble();
//兴趣值越大,越有机会进行新一轮的通信
//模仿概率事件,pros[i]>pre,则继续传播
if(pros[i] > pre ){
//随机找一个节点传播
int j = ramdom.nextInt(SIZE);
if((nodes[i] - nodes[j] > e) || (nodes[j] - nodes[i] > e)){
double mean = (nodes[i] + nodes[j]) / 2.0;
nodes[i] = mean;
nodes[j] = mean;
}else{
pros[i] /= K;
}
} else{
state--;
pros[i] = 0;
}
}
}
System.out.println("\n节点的个数:"+SIZE);
System.out.println("K的值:"+K);
System.out.println("收敛轮数:" + round);
System.out.println("真实平均值:" + mean);
System.out.println("节点值" + nodes[0]);
double fault = nodes[0] - mean;
System.out.println("误差值:" + fault);
}
public static void main(String[] args){
new gossip().run();
}
}