karate_degree.m

来自「复杂网络 节点度统计程序 C++ 网络中的节点度指与节点相连的边的个数」· M 代码 · 共 28 行

du_dis(1,1)=1;du_dis(1,2)=0.029412;
du_dis(2,1)=2;du_dis(2,2)=0.323529;
du_dis(3,1)=3;du_dis(3,2)=0.176471;
du_dis(4,1)=4;du_dis(4,2)=0.176471;
du_dis(5,1)=5;du_dis(5,2)=0.088235;
du_dis(6,1)=6;du_dis(6,2)=0.058824;
du_dis(7,1)=7;du_dis(7,2)=0.000000;
du_dis(8,1)=8;du_dis(8,2)=0.000000;
du_dis(9,1)=9;du_dis(9,2)=0.029412;
du_dis(10,1)=10;du_dis(10,2)=0.029412;
du_dis(11,1)=11;du_dis(11,2)=0.000000;
du_dis(12,1)=12;du_dis(12,2)=0.029412;
du_dis(13,1)=13;du_dis(13,2)=0.000000;
du_dis(14,1)=14;du_dis(14,2)=0.000000;
du_dis(15,1)=15;du_dis(15,2)=0.000000;
du_dis(16,1)=16;du_dis(16,2)=0.029412;
du_dis(17,1)=17;du_dis(17,2)=0.029412;
figure(1);
loglog(du_dis(:,1),du_dis(:,2),'*');
title('网络karate的度分布(双对数坐标系)');
legend('N=34');
xlabel('k');ylabel('p(k)');
figure(2);
plot(du_dis(:,1),du_dis(:,2),'*');
title('网络karate的度分布(正常坐标系)');
legend('N=34');
xlabel('k');ylabel('p(k)');