S_prime float64 | N_prime int64 | iteration int64 |
|---|---|---|
-1 | -1 | 1 |
-1 | -1 | 2 |
-1 | -1 | 3 |
-1 | -1 | 4 |
-1 | -1 | 5 |
-1 | -1 | 6 |
-1 | -1 | 7 |
-1 | -1 | 8 |
-1 | -1 | 9 |
-1 | -1 | 10 |
-1 | -1 | 11 |
-1 | -1 | 12 |
-1 | -1 | 13 |
-1 | -1 | 14 |
-1 | -1 | 15 |
-1 | -1 | 16 |
-1 | -1 | 17 |
-1 | -1 | 18 |
-1 | -1 | 19 |
-1 | -1 | 20 |
-1 | -1 | 21 |
-1 | -1 | 22 |
-1 | -1 | 23 |
-1 | -1 | 24 |
-1 | -1 | 25 |
-1 | -1 | 26 |
-1 | -1 | 27 |
-1 | -1 | 28 |
-1 | -1 | 29 |
-1 | -1 | 30 |
-1 | -1 | 31 |
-1 | -1 | 32 |
-1 | -1 | 33 |
-1 | -1 | 34 |
-1 | -1 | 35 |
-1 | -1 | 36 |
-1 | -1 | 37 |
-1 | -1 | 38 |
-1 | -1 | 39 |
-1 | -1 | 40 |
-1 | -1 | 41 |
-1 | -1 | 42 |
-1 | -1 | 43 |
-1 | -1 | 44 |
-1 | -1 | 45 |
-1 | -1 | 46 |
-1 | -1 | 47 |
-1 | -1 | 48 |
-1 | -1 | 49 |
-1 | -1 | 50 |
-1 | -1 | 51 |
-1 | -1 | 52 |
-1 | -1 | 53 |
-1 | -1 | 54 |
-1 | -1 | 55 |
-1 | -1 | 56 |
-1 | -1 | 57 |
-1 | -1 | 58 |
-1 | -1 | 59 |
-1 | -1 | 60 |
-1 | -1 | 61 |
-1 | -1 | 62 |
-1 | -1 | 63 |
-1 | -1 | 64 |
-1 | -1 | 65 |
-1 | -1 | 66 |
-1 | -1 | 67 |
-1 | -1 | 68 |
-1 | -1 | 69 |
-1 | -1 | 70 |
-1 | -1 | 71 |
-1 | -1 | 72 |
-1 | -1 | 73 |
-1 | -1 | 74 |
-1 | -1 | 75 |
-1 | -1 | 76 |
-1 | -1 | 77 |
-1 | -1 | 78 |
-1 | -1 | 79 |
-1 | -1 | 80 |
-1 | -1 | 81 |
-1 | -1 | 82 |
-1 | -1 | 83 |
-1 | -1 | 84 |
-1 | -1 | 85 |
-1 | -1 | 86 |
-1 | -1 | 87 |
-1 | -1 | 88 |
-1 | -1 | 89 |
-1 | -1 | 90 |
-1 | -1 | 91 |
-1 | -1 | 92 |
-1 | -1 | 93 |
-1 | -1 | 94 |
-1 | -1 | 95 |
-1 | -1 | 96 |
-1 | -1 | 97 |
-1 | -1 | 98 |
-1 | -1 | 99 |
-1 | -1 | 100 |
DBSCAN Cluster Density Ratios — CSR Simulation Data
Monte-Carlo simulation of DBSCAN clustering applied to complete-spatial-randomness (CSR) point fields. Used to characterize the null distribution of detected cluster density ratios and calibrate anomaly detection p-values (look-elsewhere correction).
Simulation parameters
| Parameter | Value |
|---|---|
| N (points per field) | 10,000 |
| Domain | Disk, radius R=100 |
| Domain area S₀ | π·100² ≈ 31,415.93 |
| Background intensity λ₀ | N/S₀ = 1/π ≈ 0.31831 |
| DBSCAN min_samples | 10 |
| Post-filter min_cluster_size | 10 |
| Post-filter min_area | 0.5 |
| eps sweep | 0.80 → 2.86 (step 0.01, 207 values) |
| Iterations per eps | ~12,000 – 1,000,000 |
Total compute: ~60 h on a single workstation (16-process parallel).
Schema
Each parquet file corresponds to one eps value (filename: data/eps_X.XX.parquet).
| Column | Type | Description |
|---|---|---|
S_prime |
float64 | Convex-hull area of detected cluster. -1.0 = no cluster found (placeholder row) |
N_prime |
int64 | Point count of detected cluster. -1 = no cluster found |
iteration |
int64 | Field index (1-based). Multiple clusters per iteration are all recorded. |
Always filter S_prime != -1 before analysis. Placeholder rows mark iterations with no
valid DBSCAN cluster (common at low eps where clustering is rare).
Key derived quantities
lambda0 = 10000 / (np.pi * 100**2) # ≈ 0.31831
R = (df.N_prime / df.S_prime) / lambda0 # density ratio (main statistic)
R_tilde = R * eps**2 # eps-collapsed statistic (eps-invariant master)
The density ratio R follows a heavy-tailed distribution (tail index α≈7). After
rescaling to R̃ = R·eps², the distribution collapses to a single master inverse-gamma
(shape≈20.5) across all eps — the central empirical finding of this dataset.
Usage
import pandas as pd
import numpy as np
# Load one eps slice
eps = 1.20
df = pd.read_parquet(f"hf://datasets/Winternewt/cluster-distribution-simdata/data/eps_{eps:.2f}.parquet")
df = df[df.S_prime != -1] # drop placeholder rows
lambda0 = 10000 / (np.pi * 100**2)
df['R'] = (df.N_prime / df.S_prime) / lambda0
df['R_tilde'] = df['R'] * eps**2
print(df.R_tilde.describe())
Repository
Source code and analysis: https://github.com/winternewt/cluster_distribution
Analytic findings: see docs/analytic_findings.md in the source repo.
- Downloads last month
- 35