-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathsyntheticThreeLayerGraph_time.py
More file actions
285 lines (228 loc) · 9.09 KB
/
Copy pathsyntheticThreeLayerGraph_time.py
File metadata and controls
285 lines (228 loc) · 9.09 KB
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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
__author__ = "Moses A. Boudourides & Sergios T. Lenis"
__copyright__ = "Copyright (C) 2015 Moses A. Boudourides & Sergios T. Lenis"
__license__ = "Public Domain"
__version__ = "1.0"
'''
This script constructs a temporal random graph with 3 time slices.
'''
import networkx as nx
import matplotlib.pyplot as plt
from networkx.algorithms import bipartite
from matplotlib.patches import Ellipse, Polygon
import matplotlib
def synthetic_three_level(n,p1,p2,p3,J_isolates=False,F_isolates=False,D_isolates=False):#,isolate_up=True,isolate_down=True):
k=n
J=nx.erdos_renyi_graph(n,p1) #The first layer graph
Jis = nx.isolates(J)
F=nx.erdos_renyi_graph(n,p2) #The second layer graph
Fis = nx.isolates(F)
D=nx.erdos_renyi_graph(n,p3) #The third layer graph
Dis = nx.isolates(D)
def translation_graph(J,F,D):
H1=nx.Graph()
H2=nx.Graph()
for i in range(n):
H1.add_edges_from([(J.nodes()[i],F.nodes()[i])])
H2.add_edges_from([(F.nodes()[i],D.nodes()[i])])
return H1, H2
Jed = set(J.edges())
Fed = set(F.edges())
Ded = set(D.edges())
l=[Jed,Fed,Ded]
lu = list(set.union(*l))
JFD=nx.Graph()
JFD.add_edges_from(lu)
G=nx.Graph() #The synthetic two-layer graph
# Relabing nodes maps
mappingF={}
for i in range(2*n):
mappingF[i]=n+i
FF=nx.relabel_nodes(F,mappingF,copy=True)
mappingD={}
for i in range(2*n):
if i >n-1:
mappingD[i]=i-n
else:
mappingD[i]=2*n+i
DD=nx.relabel_nodes(D,mappingD,copy=True)
H1, HH2 = translation_graph(J,FF,DD)
G.add_edges_from(J.edges())
G.add_edges_from(H1.edges())
G.add_edges_from(DD.edges())
G.add_edges_from(HH2.edges())
G.add_edges_from(FF.edges())
edgeList = []
for e in H1.edges():
edgeList.append(e)
for e in HH2.edges():
edgeList.append(e)
return G, J, FF, DD, JFD, edgeList
def plot_graph(n,G,J,FF,DD,JFD,d1=0.8,d2=5.0,nodesize=1000,withlabels=True,edgelist=[],layout=True,b_alpha=0.5):
if layout:
pos=nx.spring_layout(JFD)
else:
pos=nx.random_layout(JFD)
minPos=min(pos.keys())
top_set=set()
bottom_set=set()
middle_set=set()
level1=[]
level2=[]
level3=[]
created_pos={}
for j in range(3):
for i in range(len(pos)):
npos=pos[pos.keys()[i]]
if j==0:
ij=i
created_pos[ij]=[d2*npos[0],d2*(npos[1]-d1)]
bottom_set.add(i)
level3.append(created_pos[i])
elif j==1:
ij=i+n
created_pos[ij]=[d2*(npos[0]),d2*(npos[1])]
middle_set.add(ij)
level1.append(created_pos[ij])
else:
ij=i+2*n
created_pos[ij]=[d2*(npos[0]),d2*(npos[1]+d1)]
top_set.add(ij)
level2.append(created_pos[ij])
xlevel2=[i[0] for i in level2]
ylevel2=[i[1] for i in level2]
alevel2 = [min(xlevel2)-d1/2.-0.7,max(ylevel2)+d1/2.]
blevel2 = [max(xlevel2)+d1/2.-0.7,max(ylevel2)+d1/2.]
clevel2 = [max(xlevel2)+d1/2.,min(ylevel2)-d1/2.]
dlevel2 = [min(xlevel2)-d1/2.,min(ylevel2)-d1/2.]
xlevel3=[i[0] for i in level3]
ylevel3=[i[1] for i in level3]
alevel3 = [min(xlevel3)-d1/2.-0.7,max(ylevel3)+d1/2.]
blevel3 = [max(xlevel3)+d1/2.-0.7,max(ylevel3)+d1/2.]
clevel3 = [max(xlevel3)+d1/2.,min(ylevel3)-d1/2.]
dlevel3 = [min(xlevel3)-d1/2.,min(ylevel3)-d1/2.]
xlevel1=[i[0] for i in level1]
ylevel1=[i[1] for i in level1]
alevel1 = [min(xlevel1)-d1/2.-0.7,max(ylevel1)+d1/2.]
blevel1 = [max(xlevel1)+d1/2.-0.7,max(ylevel1)+d1/2.]
clevel1 = [max(xlevel1)+d1/2.,min(ylevel1)-d1/2.]
dlevel1 = [min(xlevel1)-d1/2.,min(ylevel1)-d1/2.]
fig=plt.figure(figsize=(20,20))
ax=fig.add_subplot(111)
ax.add_patch(Polygon([alevel2,blevel2,clevel2,dlevel2],color='b',alpha=0.1))
plt.plot([alevel2[0],blevel2[0],clevel2[0],dlevel2[0],alevel2[0]],[alevel2[1],blevel2[1],clevel2[1],dlevel2[1],alevel2[1]],'-b')
ax.add_patch(Polygon([alevel3,blevel3,clevel3,dlevel3],color='r',alpha=0.1))
plt.plot([alevel3[0],blevel3[0],clevel3[0],dlevel3[0],alevel3[0]],[alevel3[1],blevel3[1],clevel3[1],dlevel3[1],alevel3[1]],'-r')
ax.add_patch(Polygon([alevel1,blevel1,clevel1,dlevel1],color='g',alpha=0.1))
plt.plot([alevel1[0],blevel1[0],clevel1[0],dlevel1[0],alevel1[0]],[alevel1[1],blevel1[1],clevel1[1],dlevel1[1],alevel1[1]],'-g')
nx.draw(J,created_pos, with_labels=withlabels,nodelist=list(bottom_set),node_color='r',node_size=nodesize,edge_color='r',alpha=0.2)
nx.draw(FF,created_pos, with_labels=withlabels,nodelist=list(middle_set),node_color='g',node_size=nodesize,edge_color='g',alpha=0.2)
nx.draw(DD,created_pos, with_labels=withlabels,nodelist=list(top_set),node_color='b',node_size=nodesize,edge_color='b',alpha=0.2)
nx.draw_networkx_edges(G,created_pos,edgelist=edgelist,edge_color='k',alpha=0.2)
plt.show()
return created_pos
def synthetic_multi_level(k,n,p=[],No_isolates=True):
list_of_Graphs=[]
list_of_isolates=[]
list_of_Graphs_final=[]
for ij in range(k):
list_of_Graphs.append(nx.erdos_renyi_graph(n,p[ij]))
list_of_isolates.append(nx.isolates(list_of_Graphs[ij]))
Gagr=nx.Graph()
for i in list_of_Graphs:
Gagr.add_edges_from(i.edges())
Gagr.add_nodes_from(i.nodes())
G=nx.Graph() #The synthetic two-layer graph
# Relabing nodes maps
for i in range(k):
mapping={}
for ij in range(n):
mapping[ij]=ij+i*n
list_of_Graphs_final.append(nx.relabel_nodes(list_of_Graphs[i],mapping,copy=True))
list_of_translation_graphs=[]
for ij in range(k-1):
H1=nx.Graph()
#### A small fix to pain in the ass
g1=sorted(list_of_Graphs_final[ij].nodes())
g2=sorted(list_of_Graphs_final[ij+1].nodes())
#######
for ji in range(n):
H1.add_edge(g1[ji],g2[ji]) #a small fix
list_of_translation_graphs.append(H1)
luf=set()
for i in list_of_Graphs_final:
luf=luf.union(set(i.edges()))
luf=list(luf)
G.add_edges_from(luf)
luf=set()
for i in list_of_translation_graphs:
luf=luf.union(set(i.edges()))
edgeList=list(luf)
G.add_edges_from(luf)
return G, list_of_Graphs_final, Gagr, edgeList #F
def plot_graph_k(k,n,G,list_of_Graphs_final, Gagr,d1=0.8,d2=5.0,nodesize=1000,withlabels=True,edgelist=[],layout=True,b_alpha=0.5):
'''
Plotting the synthetic graph after increasing the distance among layers by a parameter d1
and dilating each layer by a parameter d1
'''
if layout:
pos=nx.spring_layout(Gagr)
else:
pos=nx.random_layout(Gagr)
minPos=min(pos.keys())
top_set=set()
bottom_set=set()
middle_set=set()
levels=dict()
created_pos={}
colors=[name for name,hex in matplotlib.colors.cnames.iteritems()]
for j in range(k):
sset=set()
pos_lis=[]
for i in range(n):
ij=i+j*n
npos=pos[i]
created_pos[ij]=[d2*npos[0],d2*(npos[1]+j*n*d1)]
sset.add(ij)
pos_lis.append(created_pos[ij])
col_li=colors[j]
levels[j]=(sset,pos_lis,col_li)
xylevels={}
for i in range(k):
xlevel2=[ij[0] for ij in levels[i][1]]
ylevel2=[ij[1] for ij in levels[i][1]]
alevel2 = [min(xlevel2)-d1/2.-0.7,max(ylevel2)+d1/2.]
blevel2 = [max(xlevel2)+d1/2.-0.7,max(ylevel2)+d1/2.]
clevel2 = [max(xlevel2)+d1/2.,min(ylevel2)-d1/2.]
dlevel2 = [min(xlevel2)-d1/2.,min(ylevel2)-d1/2.]
xylevels[i]=[alevel2,blevel2,clevel2,dlevel2]
fig=plt.figure()#figsize=(20,20))
ax=fig.add_subplot(111)
for i in range(k):
ax.add_patch(Polygon(xylevels[i],color=levels[i][2],alpha=0.1))
xa=[j[0] for j in xylevels[i]]
xa.append(xylevels[i][0][0])
ya=[j[1] for j in xylevels[i]]
ya.append(xylevels[i][0][1])
plt.plot(xa,ya,'-',color=levels[i][2])
nx.draw(list_of_Graphs_final[i],created_pos,with_labels=withlabels,nodelist=list(levels[i][0]),node_color=levels[i][2],node_size=nodesize,edge_color=levels[i][2],alpha=0.2)
nx.draw_networkx_edges(G,created_pos,edgelist=edgelist,edge_color='k',alpha=0.2)
plt.show()
return created_pos
# p1=p2=p3=0.1
# n=500
# G,J,FF,DD,JFD,edgeList = synthetic_three_level(n,p1,p2,p3,J_isolates=False,F_isolates= False, D_isolates= False)
# # print JFD.nodes()
# # print JFD.edges()
# # print F.nodes()
# # print F.edges()
# # print G.nodes()
# # print edgeList
# # print aaaa
# # print nx.isolates(G)
# # plot_graph(n,G,J,FF,DD,F,d1=2.,d2=3.,nodesize=100,withlabels=False,edgelist=edgeList,layout=True,b_alpha=0.5)
# plot_graph(n,G,J,FF,DD,JFD,d1=2.,d2=3.,nodesize=50,withlabels=False,edgelist=edgeList,layout=False,b_alpha=0.15)
# k=5
# n=10
# pp=[0.1,.1,.1,.1,.4]
# G, list_of_Graphs_final, Gagr, edgeList=synthetic_multi_level(k,n,p=pp,No_isolates=True)
# plot_graph_k(k,n,G, list_of_Graphs_final, Gagr, edgelist=edgeList)