1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
|
/*
* This file is part of MAMMULT: Metrics And Models for Multilayer Networks
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or (at
* your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "utils.h"
int main(int argc, char *argv[]){
if (argc < 6){
printf("Usage: %s <layer1> <layer2> <overlapping network> <N nodes> <b_p> <b_o>\n", argv[0]);
exit(1);
}
FILE *filein0,*filein1,*filein2,*filein3,*filein4,*filein5,*filein6,*filein7,*filein8,*filein9, *filein, *fileout;
unsigned int N0, K0,N1, K1,N2, K2,N3, K3,N4, K4,N5, K5,N6, K6,N7, K7,N8, K8,N9, K9, N, K;
unsigned int *J_slap0, *r_slap0, *J_slap1, *r_slap1,*J_slap2, *r_slap2, *J_slap3, *r_slap3,*J_slap4, *r_slap4, *J_slap5, *r_slap5,*J_slap6, *r_slap6, *J_slap7, *r_slap7,*J_slap8, *r_slap8, *J_slap9, *r_slap9, *J_slap, *r_slap;
double *w_slap;
int i, j;
double c_i, d_i, f_i, f_i_2;
double alpha = (atof(argv[5]));
double beta = (atof(argv[6]));
int ov;
int deg0, deg1,deg2, deg3,deg4, deg5,deg6, deg7,deg8, deg9;
double degM, part, f_j, f_j_2;
double degMrid, maxdegM = 200.0;
double num1, num2, den, h;
int number_nodes=(atoi(argv[4]));
double M=2.0;
filein0 = openfile_or_exit(argv[1], "r", 2);
read_slap(filein0, &K0, &N0, &J_slap0, &r_slap0);
filein1 = openfile_or_exit(argv[2], "r", 2);
read_slap(filein1, &K1, &N1, &J_slap1, &r_slap1);
filein = openfile_or_exit(argv[3], "r", 2);
read_slap_w(filein, &K, &N, &J_slap, &r_slap,&w_slap);
int r_slap0_n[N+1],r_slap1_n[N+1],r_slap2_n[N+1],r_slap3_n[N+1],r_slap4_n[N+1],r_slap5_n[N+1],r_slap6_n[N+1],r_slap7_n[N+1],r_slap8_n[N+1],r_slap9_n[N+1];
for (i=0; i<=N; i++) {
if (i<=N0) {
r_slap0_n[i]=r_slap0[i];
}
else {
r_slap0_n[i]=r_slap0[N0];
}
if (i<=N1) {
r_slap1_n[i]=r_slap1[i];
}
else {
r_slap1_n[i]=r_slap1[N1];
}
}
double c_i_vec[N];
double d_i_vec[N];
double f_i_vec[N];
for (i=0; i<N; i++) {
c_i=0;
d_i=0;
for (j=r_slap[i]; j<r_slap[i+1]; j++) {
ov = w_slap[j];
deg0=r_slap0_n[J_slap[j]+1]-r_slap0_n[J_slap[j]];
deg1=r_slap1_n[J_slap[j]+1]-r_slap1_n[J_slap[j]];
degM=(deg0+deg1)*1.0;
part = (M/(M-1))* (1-(pow((deg0/degM),2))-(pow((deg1/degM),2)) );
if (part>0.0000000001) {
f_j = pow (part, alpha);
}
else {
f_j = 0;
}
f_j_2 = pow (degM, beta);
c_i+=ov*f_j*f_j_2;
if (part>0.0000000001) {
d_i+=ov*f_j*f_j_2*log((ov*f_j*f_j_2));
}
}
c_i_vec[i]=c_i;
d_i_vec[i]=d_i;
deg0=r_slap0_n[i+1]-r_slap0_n[i];
deg1=r_slap1_n[i+1]-r_slap1_n[i];
degM=(deg0+deg1)*1.0;
part = (M/(M-1))* (1-(pow((deg0/degM),2))-(pow((deg1/degM),2)));
if (part>0.0000000001) {
f_i = pow (part, alpha);
}
else {
f_i = 0;
}
f_i_2 = pow (degM, beta);
f_i_vec[i]=f_i*f_i_2;
}
num1=0;
num2=0;
den=0;
for (i=0; i<N; i++) {
if (c_i_vec[i]>0.0) {
num1+=f_i_vec[i]*c_i_vec[i]*log(c_i_vec[i]);
}
num2=num2+f_i_vec[i]*d_i_vec[i];
den=den+f_i_vec[i]*c_i_vec[i];
}
h=(num1-num2)/den*1.0;
printf("%f %f %f\n", h, alpha, beta);
}
|
