-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfinal.py
More file actions
256 lines (204 loc) · 8.69 KB
/
Copy pathfinal.py
File metadata and controls
256 lines (204 loc) · 8.69 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
import matplotlib; matplotlib.use('Agg')
import matplotlib.pyplot as plt
import matplotlib.patches as mpatches
import seaborn as sns
from scipy import stats, optimize
import numpy as np
import helpers
from save_data import Counts
import os
sns.set_style('whitegrid')
dirplots = os.path.join(os.curdir, 'plots')
dirdata = os.path.join(os.curdir, 'all_data')
def bpl(x, xc, a, b):
"""Broken power law"""
n = (xc**(1-a)*(a-b) + b-1)/((a-1)*(b-1))
y1 = (x**(-a)/n)[x < xc]
y2 = (xc**(-a+b) * x**(-b)/n)[x >= xc]
y = np.concatenate((y1, y2))
return y
def bpl_sf(x, xc, a, b):
"""Broken power law survival function"""
n = (xc**(1-a)*(a-b) + b-1)/((a-1)*(b-1))
y1 = ((1-x**(1-a))/(n*(a-1)))[x < xc]
y2 = ((1-xc**(1-a))/(n*(a-1)) +
(xc**(1-a)-xc**(b-a)*x**(1-b))/(n*(b-1)))[x >= xc]
y = np.concatenate((y1, y2))
return 1-y
def fit_bpl(data):
"""Maximum likelihood fit to data. Doesn't always get what we expect"""
counts = data.counts
popt = optimize.fmin(lambda p: - np.sum(np.log(bpl(counts, *p))), (data.Ncat, 1., 2.))
return popt
def plot_AD(data):
"""Anderson-Darling test, given a Counts object"""
# Notice that the stats.anderson function does not admit lognorm
# With KS, I checked that using empirical KS test is the same, so I use it here as well
counts = data.counts
Ncat = data.Ncat
fiducial = data.generate_mc(100)
ln_par = data.lognorm_par()
ad_ln = helpers.my_ad([counts, np.random.lognormal(np.log(ln_par[2]), ln_par[0], size=Ncat)])
# ad_ln = stats.anderson(np.log(counts), 'norm')
print("AD lognorm: "+str(ad_ln))
ad_data = [helpers.my_ad([np.log(counts), np.log(mc)]) for mc in fiducial]
# Plot Anderson-Darling
fig = plt.figure(figsize=[10, 6.18])
plt.title('Anderson-Darling statistics')
plt.hist(ad_data, bins=10, label='MC', alpha=0.5)
# plt.axvline(ks_tree[0], c='Purple', label = 'Tree model')
plt.axvline(ad_ln[0], c='Orange', label='Lognormal')
plt.legend(loc='best')
# plt.savefig(os.path.join('all_data', 'AD_'+name+'.png'))
return
def plot_KS(data):
"""KS test, given a Counts object"""
counts = data.counts
fiducial = data.generate_mc(100)
ks_ln = stats.kstest(counts, 'lognorm', args=data.lognorm_par())
ks_data = [stats.ks_2samp(counts, mc)[0] for mc in fiducial]
# Plot KS
fig = plt.figure(figsize=[10, 6.18])
plt.title('Kolmogorov-Smirnov statistics')
plt.hist(ks_data, bins=10, label='MC', alpha=0.5)
# plt.axvline(ks_tree[0], c='Purple', label = 'Tree model')
plt.axvline(ks_ln[0], c='Orange', label = 'Lognormal')
plt.legend(loc='best')
# plt.savefig(os.path.join('all_data', 'KS_'+name+'.png'))
return fig
def plot_KL(data):
"""Kullback-Leibler divergence, given a Dataset object.
The 'true' distribution is the data one"""
frequencies = data.frequencies
Ncat = data.Ncat
fiducial = data.generate_mc(100)
sh, loc, sc = data.lognorm_par()
freq_ln = [np.sort(stats.lognorm.rvs(sh, scale=sc, size=Ncat, random_state=s))[::-1]
for s in range(1, 1001)]
kl_ln = [stats.entropy(frequencies, r) for r in freq_ln]
lengths = [min(Ncat, len(mc)) for mc in fiducial] # Cut to the minimum Ncat
kl_data = [stats.entropy(frequencies[:lengths[i]], mc[:lengths[i]]) for i, mc in enumerate(fiducial)]
# Plot KL divergence. Use kdeplot instead of histogram
fig = plt.figure(figsize=[10, 6.18])
plt.title('Kullback-Leibler divergence')
# plt.hist(kl_data, bins=10, normed=True, label='MC', alpha=0.5)
# plt.hist(kl_ln, bins=10, normed=True, label='Lognormal', alpha=0.5, color='Blue')
sns.kdeplot(np.array(kl_data), label='MC', alpha=0.6, color='Blue')
sns.kdeplot(np.array(kl_ln), label='Lognormal', alpha=0.6, color='Orange')
plt.xlim(xmin=0.)
# plt.axvline(ks_tree[0], c='Purple', label = 'Tree model')
# plt.axvline(kl_ln, c='Orange', label = 'Lognormal')
plt.legend(loc='best')
# plt.savefig(os.path.join('all_data', 'KL_'+data.name+'.png'))
return
def plot_loglog(data):
"""Plot data, given a Counts object"""
counts = data.counts
Ncat = data.Ncat
ranks = data.ranks
fiducial = data.generate_mc(100)
cdf = data.get_cdf()
fig = plt.figure(figsize=[10, 6.18])
ax = fig.gca()
ax.set_xscale('log')
ax.set_yscale('log')
ax.set_xlim([.5, max(counts)*10.])
ax.set_ylim([1., Ncat*1.2])
for f in fiducial:
ax.plot(f, np.arange(1, len(f)+1),
'o', ms=3, color='Gray', alpha=0.1, rasterized=True)
ax.plot(counts, ranks,
's', ms=3, color='Orange', rasterized=True,
label='Data')
ax.plot(cdf[0], Ncat*cdf[1],
ls='--', color='Magenta', linewidth=3, label='Tree distr.')
ax.plot(counts, Ncat*data.lognorm_sf(),
ls='-.', color='Blue', linewidth=3, label='Lognormal')
par = fit_bpl(data)
ax.plot(np.sort(counts), Ncat*bpl_sf(np.sort(counts), *par),
ls=':', color='Crimson', linewidth=3, label='Broken PL')
avg = helpers.avg_mc(fiducial, counts)
Nc = len(avg)
ax.plot(avg, np.arange(1, Nc+1),
ls='-', color='Lime', linewidth=3, label='Average')
gray_patch = mpatches.Patch(color='Gray', label='MC')
orange_patch = mpatches.Patch(color='Orange', label='Data')
green_patch = mpatches.Patch(color='Lime', label='Average')
magenta_patch = mpatches.Patch(color='Magenta', label='Tree distr.')
blue_patch = mpatches.Patch(color='Blue', label='Lognormal')
brown_patch = mpatches.Patch(color='Crimson', label='Broken PL')
plt.legend(handles=[gray_patch, orange_patch, green_patch,
magenta_patch, blue_patch, brown_patch])
return fig
def plot_loglin(data):
"""Plot data, given a Counts object"""
counts = data.counts
Ncat = data.Ncat
ranks = data.ranks
fiducial = data.generate_mc(100)
cdf = data.get_cdf()
fig = plt.figure(figsize=[10, 6.18])
ax = fig.gca()
ax.set_xscale('log')
ax.set_xlim([.5, max(counts)*10.])
ax.set_ylim([1., Ncat*1.2])
for f in fiducial:
ax.plot(f, np.arange(1, len(f)+1),
'o', ms=3, color='Gray', alpha=0.1, rasterized=True)
ax.plot(counts, ranks,
's', ms=3, color='Orange', rasterized=True,
label='Data')
ax.plot(cdf[0], Ncat*cdf[1],
ls='--', color='Magenta', linewidth=3, label='Tree distr.')
ax.plot(counts, Ncat*data.lognorm_sf(),
ls='-.', color='Blue', linewidth=3, label='Lognormal')
par = fit_bpl(data)
ax.plot(np.sort(counts), Ncat*bpl_sf(np.sort(counts), *par),
ls=':', color='Crimson', linewidth=3, label='Broken PL')
avg = helpers.avg_mc(fiducial, counts)
Nc = len(avg)
ax.plot(avg, np.arange(1, Nc+1),
ls='-', color='Lime', linewidth=3, label='Average')
gray_patch = mpatches.Patch(color='Gray', label='MC')
orange_patch = mpatches.Patch(color='Orange', label='Data')
green_patch = mpatches.Patch(color='Lime', label='Average')
magenta_patch = mpatches.Patch(color='Magenta', label='Tree distr.')
blue_patch = mpatches.Patch(color='Blue', label='Lognormal')
brown_patch = mpatches.Patch(color='Crimson', label='Broken PL')
plt.legend(handles=[gray_patch, orange_patch, green_patch,
magenta_patch, blue_patch, brown_patch])
return fig
def main():
names = ('sample',)
sigma_Ncat = np.empty((len(names), 4))
for i, name in enumerate(names):
print('\nDoing '+name+'.....')
data = Counts(os.path.join(os.curdir, 'counts_'+name+'.dat'))
counts = data.counts
ranks = data.ranks
Ncat = data.Ncat
Nitems = data.Nitems
factor = data.get_factor()
print("Ncat = ", Ncat, "\tNitems = ", Nitems)
print("factor = ", factor)
# sigma_Ncat[i, 0] = Ncat
# sigma_Ncat[i, 1] = data.lognorm_par()[0]
# sigma_Ncat[i, 2] = np.var(np.log(counts))
# # Check that we have all non-zero categories
# print("Categories with zero count:",
# np.sum([m[m == 0].shape for m in data.fiducial]))
# sigma_Ncat[i, 3] = np.mean([np.var(np.log(m)) for m in data.fiducial])
chao_est, chao_sigma = helpers.chao(data)
print('Chao estimator: ', chao_est)
print('Chao std: ', chao_sigma)
print('Our estimated Q: ', factor * data.Ncat)
print('Ratio Q/Chao: ', factor * data.Ncat/chao_est)
print('Sigma/Est for Chao: ', chao_sigma/chao_est)
fig = plot_KL(data)
plt.savefig('KL_plot.png')
fig = plot_loglog(data)
plt.savefig('loglog_plot.png')
fig = plot_loglin(data)
plt.savefig('loglin_plot.png')
if __name__ == "__main__":
main()