blob: bd81dcdd21f7afe42ed03e48485f5181c1ad21ba (
plain)
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
|
# 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/>.
####
##
##
## Take a file with the degree sequence of nodes which are active on
## both layers, and compute \overline{k}(q) and \overline{q}(k),
## i.e. the two inter-layer correlation functions, where we call "k"
## the degree on the first column, and "q" the degree on the second
## column
##
##
import sys
if len(sys.argv) < 2:
print "Usage: %s <filein>" % sys.argv[0]
sys.exit(1)
qnn_k = {}
knn_q = {}
with open(sys.argv[1]) as f:
for l in f:
k, q = [int(x) for x in l.strip(" \n").split(" ")]
if qnn_k.has_key(k):
qnn_k[k].append(q)
else:
qnn_k[k] = [q]
if knn_q.has_key(q):
knn_q[q].append(k)
else:
knn_q[q] = [k]
keys= qnn_k.keys()
keys.sort()
for k in keys:
print k, 1.0 * sum(qnn_k[k])/len(qnn_k[k])
keys= knn_q.keys()
keys.sort()
for q in keys:
sys.stderr.write("%d %f\n" % (q, 1.0 * sum(knn_q[q])/len(knn_q[q])))
|
