blob: b9c4584a01a7ea3b8b25a2044c347fe9b3868b68 (
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
|
####
##
## Compute the participation coefficient of each node of a multiplex
##
##
import sys
import networkx as net
import collections
from compiler.ast import flatten
if len(sys.argv) < 3:
print "Usage: %s <layer1> <layer2> [<layer3>...]" % sys.argv[0]
sys.exit(1)
layers = []
for f in sys.argv[1:]:
G = net.Graph(net.read_edgelist(f, nodetype=int))
layers.append(G)
nodes = flatten([x for j in layers for x in j.nodes()])
#nodes.sort()
nodes = set(nodes)
M = len(layers)
#print nodes
for n in nodes:
deg_alpha_square = 0
deg = 0
col = 0
print n,
for l in layers:
val = l.degree([n])
if not val:
col = 2* col
continue
col *= 2
col += 1
val = val[n]
deg += val
deg_alpha_square += val*val
if deg > 0:
print deg, 1.0 * M / (M-1) * (1.0 - 1.0 * deg_alpha_square/(deg * deg)) , col
else:
print 0 , 0, col
|
