-
Notifications
You must be signed in to change notification settings - Fork 0
/
graph_stats.py
179 lines (126 loc) · 5.15 KB
/
graph_stats.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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Fri Apr 24 21:29:47 2020
@author: lukeum
"""
import argparse
import os
import networkx as nx
import networkit as nk
import numpy as np
import pandas as pd
import rapidjson as json
from networkx.readwrite import json_graph
#import powerlaw
from multiprocessing import Pool
from tqdm import tqdm
def graph_measures(G):
density = nk.graphtools.density(G)
nodes = G.numberOfNodes()
edges = G.numberOfEdges()
clustering_coef = np.mean(nk.centrality.LocalClusteringCoefficient(G).run().scores())
global_cluster = nk.globals.ClusteringCoefficient.exactGlobal(G)
largest = nk.components.ConnectedComponents.extractLargestConnectedComponent(G, True)
largest_percent = largest.numberOfNodes()/nodes
degrees = nk.centrality.DegreeCentrality(G).run().scores()
assortativity = nk.correlation.Assortativity(G,degrees).run().getCoefficient()
avg_degree = np.mean(degrees)
max_degree = np.max(degrees)
min_degree = np.min(degrees)
degrees = np.array(degrees)
singletons = np.sum(degrees==0)/nodes
return {'nodes':nodes,'edges':edges,'density':density,'assortativity':assortativity,
'local_cluster':clustering_coef, 'global_cluster':global_cluster, 'avg_degree':avg_degree,'max_degree':max_degree,'min_degree':min_degree,
'large_com':largest_percent,'singletons':singletons}
def init_empyty_df(times):
attributes = ['nodes','edges','density','assortativity','local_cluster','global_cluster' ,'avg_degree',
'max_degree','min_degree','large_com','singletons']
init = np.zeros((len(times),len(attributes)))
variations = pd.DataFrame(init,columns=attributes,index=times)
return variations
def analyze_graphs(path):
inpath, outpath = path
if not os.path.exists(outpath):
try:
with open(inpath,'r') as f:
all_graphs = json.load(f)
times = list(all_graphs.keys())
data = init_empyty_df(sorted(times))
for t, g in all_graphs.items():
G = json_graph.node_link_graph(g)
#nx.write_gexf(nxG,'2018_10.gexf')
G = nk.nxadapter.nx2nk(G)
G.removeSelfLoops()
#o = nk.overview(G)
measures = graph_measures(G)
data.loc[t] = measures
data.to_csv(outpath)
print('Save to %s'% outpath)
except:
print('Skip %s'% s)
pass
def analyze_inter_graphs(path):
inpath, outpath = path
times = os.listdir(inpath)
data = init_empyty_df(sorted(times))
for t in times:
with open(os.path.join(inpath,t),'r') as f:
G = json.load(f)
G = json_graph.node_link_graph(G)
#nx.write_gexf(nxG,'2018_10.gexf')
G = nk.nxadapter.nx2nk(G,'weight')
G.removeSelfLoops()
#o = nk.overview(G)
measures = graph_measures(G)
data.loc[t] = measures
print("Done %s"%t)
data.to_csv(outpath)
def centrality(G):
btwn = nk.centrality.Betweenness(G).run().scores()
close = nk.centrality.Closeness(G, False, nk.centrality.ClosenessVariant.Generalized).run().scores()
deg = nk.centrality.DegreeCentrality(G).run().scores()
ec = nk.centrality.EigenvectorCentrality(G).run().scores()
pr = nk.centrality.PageRank(G).run().scores()
# katz = nk.centrality.KatzCentrality(G, 0.1,1.0,1e-08).run().scores()
return {"betweenness":btwn, "closeness":close, "degree":deg, "eigen":ec,
"pagerank":pr}
def extract_centrality(paths):
inpath, outpath = paths
with open(inpath,'r') as f:
G = json.load(f)
G = json_graph.node_link_graph(G)
idmap = list(G.nodes())
G = nk.nxadapter.nx2nk(G,'weight')
cen = centrality(G)
data = pd.DataFrame()
data["Subreddits"] = idmap
for k,v in cen.items():
data[k] = v
data.to_csv(outpath)
print("Save to %s"%outpath)
if __name__ == "__main__":
parser = argparse.ArgumentParser()
parser.add_argument("--data_dir",default='./summaries/graphs',type=str)
parser.add_argument("--out_dir", default='./summaries/graph_stats',type=str)
parser.add_argument("--graph_type",default="individual",type=str)
args = parser.parse_args()
if args.graph_type == "individual":
files = os.listdir(args.data_dir)
paths = []
for f in files:
inpath = os.path.join(args.data_dir,f)
outpath = os.path.join(args.out_dir,f)
paths.append((inpath,outpath))
with Pool() as P:
P.map(analyze_graphs,paths)
else:
inpath = args.data_dir
outpath = args.out_dir
# inpath = "./summaries/bgraph3"
# outpath = "./summaries/bgraph3_stats"
# analyze_inter_graphs((inpath,outpath+'/total'))
times = os.listdir(inpath)
paths = [(os.path.join(inpath,t),os.path.join(outpath,t)) for t in times]
for p in tqdm(paths):
extract_centrality(p)