-
Notifications
You must be signed in to change notification settings - Fork 1
/
createNetworkDescriptors2.py
159 lines (127 loc) · 5.25 KB
/
createNetworkDescriptors2.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
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
# DELIVERABLE FOR THE PROJECT:
# "KINEMATICS OF MOBILITY"
# David Pastor-Escuredo (Life D Lab)
# Licencia MIT
#Copyright <2019> <David Pastor Escuredo>
#Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
#The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
#THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
import pandas as pd
import numpy as np
import json
from nltk.tokenize import word_tokenize
import re
import geopandas as gpd
import networkx as nx
import matplotlib.pyplot as plt
import collections
from sklearn.cluster import KMeans
from PIL import Image
import time
from datetime import datetime, timedelta, date
from os import listdir
from os.path import isfile, join
from geopandas import GeoDataFrame
from shapely.geometry import Point
import pickle
import math
from timeit import default_timer as timer
def getday(d):
if d<10:
ds='0'+str(d)
else:
ds=str(d)
return ds
def distAntenna(origvector,desvector):
d=math.pow((origvector[0]-desvector[0]),2)+math.pow((origvector[1]-desvector[1]),2)
d=math.sqrt(d)
#Creates mobility network descriptors
datapath='/home/davidpastor/TEF_mob/'
netpath=datapath+'nets/'
GD={}
for yDay in range(17,36):
print(yDay)
start = timer()
with open(netpath+'Net'+'_'+str(yDay)+'.cnf', 'rb') as fpp:
G=pickle.load(fpp)
with open(netpath+'Netu'+'_'+str(yDay)+'.cnf', 'rb') as fpp:
Gu=pickle.load(fpp)
my_ns=G.nodes
#Algorithms to compute different types of centrality
Grev=G.reverse()
#Betweenness centrality
#BFCN=nx.current_flow_betweenness_centrality(Gu)
#BFCN=nx.current_flow_betweenness_centrality(Gu, weight='weight')
BICN=nx.betweenness_centrality(G, weight='weight')
BOCN=nx.betweenness_centrality(Grev, weight='weight')
#BOCN=nx.current_flow_betweenness_centrality(Grev,weight='weight')
#Closeness centrality
#CFCN=nx.current_flow_closeness_centrality(Gu,weight='weight')
CCN=nx.closeness_centrality(Gu, distance='distance')
#COCN=nx.current_flow_closeness_centrality(Grev,weight='weight')
#Degree centrality
DICN=nx.in_degree_centrality(G)
DOCN=nx.out_degree_centrality(G)
#Eigenvalue centrality
EICN=nx.eigenvector_centrality(G,weight='weight')
EOCN=nx.eigenvector_centrality(Grev,weight='weight')
for n in my_ns:
#print(n)
if n not in GD:
GD[n]={}
#Descriptor degree
ind=G.in_degree(n)
outd=G.out_degree(n)
GD[n]['ind']=ind
GD[n]['outd']=outd
#Centrality
GD[n]['in_eigenvalue']=EICN[n]
GD[n]['out_eigenvalue']=EOCN[n]
GD[n]['in_degree']=DICN[n]
GD[n]['out_degree']=DOCN[n]
#GD[n]['cfbetweenness']=BFCN[n]
GD[n]['in_betweenness']=BICN[n]
GD[n]['out_betweenness']=BOCN[n]
#GD[n]['cfcloseness']=CFCN[n]
GD[n]['closeness']=CCN[n]
#Edge descriptors statistics: Flow, distance, time
succ=G.successors(n)
lensuc=len(succ)
pred=G.predecessors(n)
lenpred=len(pred)
out_flow=0
in_flow=0
out_dis=0
in_dis=0
out_delta=0
in_delta=0
for ns in succ:
out_flow=out_flow+G[n][ns]['weight']
out_dis=out_dis+G[n][ns]['distance']
out_delta=out_delta+G[n][ns]['time']
out_delta=out_delta/out_flow
for np in pred:
in_flow=in_flow+G[np][n]['weight']
in_dis=in_dis+G[np][n]['distance']
in_delta=in_delta+G[np][n]['time']
in_delta=in_delta/in_flow
ave_out_flow=out_flow/lensuc
ave_in_flow=in_flow/lenpred
out_dis=out_dis/lensuc
in_dis=in_dis/lenpred
out_delta=out_delta/lensuc
in_delta=in_delta/lenpred
GD[n]['out_flow']=out_flow
GD[n]['in_flow']=in_flow
GD[n]['out_ave_flow']=ave_out_flow
GD[n]['in_ave_flow']=ave_in_flow
GD[n]['out_distace']=out_dist
GD[n]['in_distace']=in_dist
GD[n]['out_time']=out_delta
GD[n]['in_time']=in_delta
#We could add socio-economic descriptors to the node
with open(netpath+'/ND_'+str(yDay)+'.cnf', 'wb') as handle:
pickle.dump(GD, handle, protocol=pickle.HIGHEST_PROTOCOL)
print('Finished '+str(yDay))
end = timer()
print(end - start)