-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathanalysis.js
More file actions
468 lines (414 loc) · 13.4 KB
/
Copy pathanalysis.js
File metadata and controls
468 lines (414 loc) · 13.4 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
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
/**
* @fileoverview Advanced statistical analysis tools for CD48 data
* @module analysis
*/
/**
* Statistical analysis utilities for count data
* @namespace Statistics
*/
export const Statistics = {
/**
* Calculate mean (average) of an array of numbers
* @param {number[]} data - Array of numeric values
* @returns {number} Mean value
*/
mean(data) {
if (!data || data.length === 0) return 0;
return data.reduce((sum, val) => sum + val, 0) / data.length;
},
/**
* Calculate median of an array of numbers
* @param {number[]} data - Array of numeric values
* @returns {number} Median value
*/
median(data) {
if (!data || data.length === 0) return 0;
const sorted = [...data].sort((a, b) => a - b);
const mid = Math.floor(sorted.length / 2);
return sorted.length % 2 === 0
? (sorted[mid - 1] + sorted[mid]) / 2
: sorted[mid];
},
/**
* Calculate standard deviation
* @param {number[]} data - Array of numeric values
* @param {boolean} [sample=true] - Use sample standard deviation (n-1)
* @returns {number} Standard deviation
*/
standardDeviation(data, sample = true) {
if (!data || data.length === 0) return 0;
const avg = this.mean(data);
const squareDiffs = data.map((value) => Math.pow(value - avg, 2));
const avgSquareDiff =
squareDiffs.reduce((sum, val) => sum + val, 0) /
(sample ? data.length - 1 : data.length);
return Math.sqrt(avgSquareDiff);
},
/**
* Calculate variance
* @param {number[]} data - Array of numeric values
* @param {boolean} [sample=true] - Use sample variance (n-1)
* @returns {number} Variance
*/
variance(data, sample = true) {
const std = this.standardDeviation(data, sample);
return std * std;
},
/**
* Calculate Poisson uncertainty (sqrt(N))
* @param {number} count - Count value
* @returns {number} Poisson uncertainty
*/
poissonUncertainty(count) {
return Math.sqrt(Math.max(0, count));
},
/**
* Calculate statistical significance between two count rates
* @param {number} count1 - First count
* @param {number} count2 - Second count
* @returns {number} Z-score
*/
zScore(count1, count2) {
const uncertainty = Math.sqrt(count1 + count2);
if (uncertainty === 0) return 0;
return Math.abs(count1 - count2) / uncertainty;
},
/**
* Perform linear regression on time-series data
* @param {number[]} x - X values (e.g., time)
* @param {number[]} y - Y values (e.g., counts)
* @returns {{slope: number, intercept: number, r2: number}} Regression results
*/
linearRegression(x, y) {
if (!x || !y || x.length !== y.length || x.length === 0) {
return { slope: 0, intercept: 0, r2: 0 };
}
const n = x.length;
const sumX = x.reduce((a, b) => a + b, 0);
const sumY = y.reduce((a, b) => a + b, 0);
const sumXY = x.reduce((sum, xi, i) => sum + xi * y[i], 0);
const sumXX = x.reduce((sum, xi) => sum + xi * xi, 0);
const sumYY = y.reduce((sum, yi) => sum + yi * yi, 0);
const slope = (n * sumXY - sumX * sumY) / (n * sumXX - sumX * sumX);
const intercept = (sumY - slope * sumX) / n;
// Calculate R-squared
const yMean = sumY / n;
const ssTotal = sumYY - n * yMean * yMean;
const ssResidual = y.reduce((sum, yi, i) => {
const predicted = slope * x[i] + intercept;
return sum + Math.pow(yi - predicted, 2);
}, 0);
const r2 = 1 - ssResidual / ssTotal;
return { slope, intercept, r2 };
},
/**
* Calculate all basic statistics for a dataset
* @param {number[]} data - Array of numeric values
* @returns {Object} Object containing mean, median, std, variance, min, max
*/
summary(data) {
if (!data || data.length === 0) {
return {
mean: 0,
median: 0,
std: 0,
variance: 0,
min: 0,
max: 0,
count: 0,
};
}
return {
mean: this.mean(data),
median: this.median(data),
std: this.standardDeviation(data),
variance: this.variance(data),
min: Math.min(...data),
max: Math.max(...data),
count: data.length,
};
},
};
/**
* Histogram generation utilities
* @namespace Histogram
*/
export const Histogram = {
/**
* Create a histogram from data
* @param {number[]} data - Array of numeric values
* @param {Object} options - Histogram options
* @param {number} [options.bins=10] - Number of bins
* @param {number} [options.min] - Minimum value (auto-detected if not provided)
* @param {number} [options.max] - Maximum value (auto-detected if not provided)
* @returns {Object} Histogram data with bins, counts, and edges
*/
create(data, options = {}) {
if (!data || data.length === 0) {
return { bins: [], counts: [], edges: [], binWidth: 0 };
}
const bins = options.bins || 10;
const min = options.min !== undefined ? options.min : Math.min(...data);
const max = options.max !== undefined ? options.max : Math.max(...data);
const binWidth = (max - min) / bins;
const counts = new Array(bins).fill(0);
const edges = Array.from(
{ length: bins + 1 },
(_, i) => min + i * binWidth
);
// Count values in each bin
data.forEach((value) => {
if (value < min || value > max) return;
let binIndex = Math.floor((value - min) / binWidth);
if (binIndex === bins) binIndex = bins - 1; // Handle max value
counts[binIndex]++;
});
// Calculate bin centers
const binCenters = edges.slice(0, -1).map((edge) => edge + binWidth / 2);
return {
bins: binCenters,
counts,
edges,
binWidth,
};
},
/**
* Create histogram with automatic binning using Sturges' rule
* @param {number[]} data - Array of numeric values
* @returns {Object} Histogram data
*/
autobin(data) {
if (!data || data.length === 0) {
return this.create([], {});
}
const bins = Math.ceil(Math.log2(data.length) + 1);
return this.create(data, { bins });
},
/**
* Create histogram with Freedman-Diaconis rule for bin width
* @param {number[]} data - Array of numeric values
* @returns {Object} Histogram data
*/
freedmanDiaconis(data) {
if (!data || data.length === 0) {
return this.create([], {});
}
const sorted = [...data].sort((a, b) => a - b);
const q1 = sorted[Math.floor(sorted.length * 0.25)];
const q3 = sorted[Math.floor(sorted.length * 0.75)];
const iqr = q3 - q1;
const binWidth = (2 * iqr) / Math.pow(data.length, 1 / 3);
const min = Math.min(...data);
const max = Math.max(...data);
const bins = Math.ceil((max - min) / binWidth) || 1;
return this.create(data, { bins, min, max });
},
/**
* Calculate cumulative histogram
* @param {number[]} data - Array of numeric values
* @param {Object} options - Histogram options
* @returns {Object} Cumulative histogram data
*/
cumulative(data, options = {}) {
const hist = this.create(data, options);
const cumulativeCounts = [];
let sum = 0;
for (const count of hist.counts) {
sum += count;
cumulativeCounts.push(sum);
}
return {
...hist,
counts: cumulativeCounts,
normalized: cumulativeCounts.map((c) => c / sum),
};
},
};
/**
* Time-series analysis helpers
* @namespace TimeSeries
*/
export const TimeSeries = {
/**
* Calculate moving average
* @param {number[]} data - Time series data
* @param {number} window - Window size
* @returns {number[]} Smoothed data
*/
movingAverage(data, window) {
if (!data || data.length === 0 || window < 1) return [];
const result = [];
for (let i = 0; i < data.length; i++) {
const start = Math.max(0, i - Math.floor(window / 2));
const end = Math.min(data.length, i + Math.ceil(window / 2));
const slice = data.slice(start, end);
result.push(Statistics.mean(slice));
}
return result;
},
/**
* Calculate exponential moving average
* @param {number[]} data - Time series data
* @param {number} alpha - Smoothing factor (0-1)
* @returns {number[]} Smoothed data
*/
exponentialMovingAverage(data, alpha = 0.3) {
if (!data || data.length === 0) return [];
if (alpha < 0 || alpha > 1) {
throw new Error('Alpha must be between 0 and 1');
}
const result = [data[0]];
for (let i = 1; i < data.length; i++) {
result.push(alpha * data[i] + (1 - alpha) * result[i - 1]);
}
return result;
},
/**
* Detect outliers using z-score method
* @param {number[]} data - Time series data
* @param {number} [threshold=3] - Z-score threshold
* @returns {number[]} Indices of outliers
*/
detectOutliers(data, threshold = 3) {
if (!data || data.length === 0) return [];
const mean = Statistics.mean(data);
const std = Statistics.standardDeviation(data);
if (std === 0) return [];
const outliers = [];
data.forEach((value, index) => {
const z = Math.abs((value - mean) / std);
if (z > threshold) {
outliers.push(index);
}
});
return outliers;
},
/**
* Calculate rate of change
* @param {number[]} data - Time series data
* @param {number[]} [times] - Time values (optional)
* @returns {number[]} Rate of change
*/
rateOfChange(data, times = null) {
if (!data || data.length < 2) return [];
const result = [];
for (let i = 1; i < data.length; i++) {
const dt = times ? times[i] - times[i - 1] : 1;
result.push((data[i] - data[i - 1]) / dt);
}
return result;
},
/**
* Calculate autocorrelation
* @param {number[]} data - Time series data
* @param {number} lag - Lag value
* @returns {number} Autocorrelation coefficient
*/
autocorrelation(data, lag) {
if (!data || data.length === 0 || lag >= data.length) return 0;
const mean = Statistics.mean(data);
let numerator = 0;
let denominator = 0;
for (let i = 0; i < data.length - lag; i++) {
numerator += (data[i] - mean) * (data[i + lag] - mean);
}
for (let i = 0; i < data.length; i++) {
denominator += Math.pow(data[i] - mean, 2);
}
return denominator === 0 ? 0 : numerator / denominator;
},
/**
* Resample time series data
* @param {number[]} data - Time series data
* @param {number[]} times - Original time values
* @param {number[]} newTimes - New time values to interpolate to
* @returns {number[]} Resampled data
*/
resample(data, times, newTimes) {
if (!data || !times || !newTimes || data.length !== times.length) {
return [];
}
return newTimes.map((newTime) => {
// Find surrounding points
let i = 0;
while (i < times.length && times[i] < newTime) i++;
if (i === 0) return data[0];
if (i === times.length) return data[data.length - 1];
// Linear interpolation
const t0 = times[i - 1];
const t1 = times[i];
const v0 = data[i - 1];
const v1 = data[i];
const fraction = (newTime - t0) / (t1 - t0);
return v0 + fraction * (v1 - v0);
});
},
/**
* Calculate dead time correction
* @param {number} observedRate - Observed count rate (counts/sec)
* @param {number} deadTime - Dead time in seconds
* @returns {number} Corrected count rate
*/
deadTimeCorrection(observedRate, deadTime) {
// Using the formula: true_rate = observed_rate / (1 - observed_rate * dead_time)
const denominator = 1 - observedRate * deadTime;
if (denominator <= 0) {
throw new Error('Dead time correction overflow - rate too high');
}
return observedRate / denominator;
},
};
/**
* Coincidence analysis utilities
* @namespace Coincidence
*/
export const Coincidence = {
/**
* Calculate expected accidental coincidence rate
* @param {number} rate1 - Rate of first detector (counts/sec)
* @param {number} rate2 - Rate of second detector (counts/sec)
* @param {number} coincidenceWindow - Coincidence window in seconds
* @returns {number} Expected accidental rate (counts/sec)
*/
accidentalRate(rate1, rate2, coincidenceWindow) {
return 2 * rate1 * rate2 * coincidenceWindow;
},
/**
* Calculate true coincidence rate
* @param {number} measuredRate - Measured coincidence rate
* @param {number} rate1 - Rate of first detector
* @param {number} rate2 - Rate of second detector
* @param {number} coincidenceWindow - Coincidence window in seconds
* @returns {number} True coincidence rate
*/
trueRate(measuredRate, rate1, rate2, coincidenceWindow) {
const accidental = this.accidentalRate(rate1, rate2, coincidenceWindow);
return Math.max(0, measuredRate - accidental);
},
/**
* Calculate signal-to-noise ratio
* @param {number} trueRate - True coincidence rate
* @param {number} accidentalRate - Accidental coincidence rate
* @returns {number} Signal-to-noise ratio
*/
signalToNoise(trueRate, accidentalRate) {
return accidentalRate === 0 ? Infinity : trueRate / accidentalRate;
},
/**
* Calculate optimal coincidence window
* @param {number} rate1 - Rate of first detector
* @param {number} rate2 - Rate of second detector
* @param {number} targetSNR - Target signal-to-noise ratio
* @returns {number} Optimal window in seconds
*/
optimalWindow(rate1, rate2, targetSNR = 10) {
// Simplified estimation - actual optimal depends on specific application
return 1 / (2 * targetSNR * Math.sqrt(rate1 * rate2));
},
};
export default {
Statistics,
Histogram,
TimeSeries,
Coincidence,
};