-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathto_plot_eraes.py
133 lines (121 loc) · 4.49 KB
/
to_plot_eraes.py
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
import networkx as nx
import matplotlib.pyplot as plt
import matplotlib.animation as animation
import random
import numpy as np
from networkx.algorithms.graphical import is_graphical
from networkx.utils.random_sequence import powerlaw_sequence
def sim_eraes(d,c,p,n,dd,iters):
edge_lists = []
G = nx.empty_graph(n)
i = 0
while i<iters:
nodes = G.nodes()
neighs = {u: list(G.neighbors(u)) for u in nodes}
for u in nodes:
deg = len(neighs[u])
if deg < dd[u]:
delta = [v for v in nodes if v != u]
add_neighs = {random.choice(delta) for _ in range(dd[u]-deg)}
for v in add_neighs:
G.add_edge(u,v)
if deg > int(c*dd[u]):
del_neighs = {random.choice(neighs[u]) for _ in range(deg - int(c*dd[u]))}
for v in del_neighs:
if G.has_edge(u,v):
G.remove_edge(u,v)
el = nx.generate_edgelist(G,data=False)
edge_lists.append([])
for line in el:
edge_lists[i].append(line)
i+=1
for e in list(G.edges()):
if (random.random() < p):
G.remove_edge(e[0], e[1])
#G = step_evolution(G,d,c,p)
el = nx.generate_edgelist(G,data=False)
edge_lists.append([])
for line in el:
edge_lists[i].append(line)
i+=1
return edge_lists
def step_evolution(G,d,c,p):
nodes = G.nodes()
neighs = {u: list(G.neighbors(u)) for u in nodes}
for u in nodes:
deg = len(neighs[u])
if deg < d:
delta = [v for v in nodes if v != u]
add_neighs = {random.choice(delta) for _ in range(d-deg)}
for v in add_neighs:
G.add_edge(u,v)
if deg > c*d:
del_neighs = {random.choice(neighs[u]) for _ in range(deg - int(c*d))}
for v in del_neighs:
if G.has_edge(u,v):
G.remove_edge(u,v)
for e in list(G.edges()):
if (random.random() < p):
G.remove_edge(e[0], e[1])
return G
if __name__ == '__main__':
n = 64
d = 4
c = 1.5
p = 0.5
iters = 400
iterate = True
gamma = 2.5
dd = []
while iterate: # Continue generating sequences until one of them is graphical
dd = sorted([int(round(d)) for d in powerlaw_sequence(n, gamma)], reverse=True) # Round to nearest integer to obtain DISCRETE degree sequence
if is_graphical(dd):
iterate = False
els = sim_eraes(d,c,p,n,dd,iters)
temporal_el = []
t = 1
edges = []
for elem in els:
for line in elem:
temporal_el.append([int(line.split(" ")[0]),int(line.split(" ")[1]),t])
edges.append((int(line.split(" ")[0]),int(line.split(" ")[1])))
t+=1
edge_set = set(edges)
time_dict = {}
edge_index = {}
i = 1
for key in temporal_el:
if ((key[0],key[1]) in time_dict):
time_dict[(key[0],key[1])].append(key[2])
else:
time_dict[(key[0],key[1])]=[key[2]]
edge_index[(key[0],key[1])] = i
i+=1
temporal_file = []
for key in time_dict:
timestart = 0
actual_time = 0
for i in range(0,len(time_dict[key])):
if (i == 0):
actual_time = time_dict[key][i]
timestart = time_dict[key][i]
else:
if time_dict[key][i] == time_dict[key][i-1]+1:
actual_time = time_dict[key][i]
else:
temporal_file.append([key[0],key[1],timestart,time_dict[key][i-1]])
timestart = time_dict[key][i]
actual_time = time_dict[key][i]
if i == len(time_dict[key])-1 and time_dict[key][i] == time_dict[key][i-1]+1:
temporal_file.append([key[0],key[1],timestart,time_dict[key][i]])
# write temporal edgelist
with open('eraes_'+str(n)+"_"+str(p)+".csv", 'w+') as f:
f.write("onset,terminus,tail,head,onset.censored,terminus.censored,edge.id\n")
for tedge in temporal_file:
f.write(str(tedge[2])+","+str(tedge[3])+","+str(tedge[1]+1)+","+str(tedge[0]+1)+",False,False,"+str(edge_index[(tedge[0],tedge[1])])+"\n")
with open('eraes_edges_'+str(n)+"_"+str(p)+".csv", 'w+') as f:
for key in edge_index.keys():
f.write(str(key[0]+1)+","+str(key[1]+1)+"\n")
print(temporal_el)
print(time_dict)
print(temporal_file)