Luminary Research Archive
Luminary Research ArchiveIndependent scholarship
Luminary Portal

All Research

Research

154 papers
Browse papers
  1. Locating Quintic Obstructions in the Riemann Theta Product: A certified transition and minimum-degree theoremScott SchubrEdition 3 · 2026-10-27 Public
  2. Finite positivity and correction inertia for the Riemann theta formScott SchubrEdition 2 · 2026-10-27 Public
  3. Minimum-Degree Obstructions in the Riemann Theta Product: Classification, transition bounds and robust Gram certificatesScott SchubrEdition 3 · 2026-10-27 Public
  4. Collision and cancellation spectra for concentrated energy formsScott SchubrEdition 2 · 2026-10-27 Public
  5. Fekete convergence from balanced integer predecessors in shrinking corridorsScott SchubrEdition 2 · 2026-10-27 Public
  6. Sharp trace-degree certificates for rank-two permanent-derivative compensationScott SchubrEdition 2 · 2026-10-27 Public
  7. Residual Certificates and Empirical Sharpness for Entropic Self-Transport ScoresScott SchubrEdition 2 · 2026-10-27 Public
  8. Observation norms under double-exponential confinementScott SchubrEdition 2 · 2026-10-27 Public
  9. Residual Stopping and Pointwise Inference for Nonuniform Entropic Self-TransportScott SchubrEdition 2 · 2026-10-27 Public
  10. Finite-spectral recovery of Weyl-blind twisting modesScott SchubrEdition 2 · 2026-10-27 Public
  11. Local comparison counting for linear extensions and a bounded-range balance refinementScott SchubrEdition 2 · 2026-10-27 Public
  12. An explicit hyperbolicity threshold for xi Jensen polynomialsScott SchubrEdition 2 · 2026-10-27 Public
  13. A quantitative Chollet inequality for rank-four matrices of order sevenScott SchubrEdition 2 · 2026-10-27 Public
  14. Single-copy learning of stabilizers with correlated diagonal noiseScott SchubrEdition 2 · 2026-10-27 Public
  15. Relative finite optimization of arithmetic approximation distancesScott SchubrEdition 2 · 2026-10-27 Public
  16. Growing null subtraction and weighted Weil zero detectionScott SchubrEdition 2 · 2026-10-27 Public
  17. Frequency Localization for Weil Operator CertificatesScott SchubrEdition 3 · 2026-10-27 Public
  18. Sharp logarithmic sampling thresholds and lacunary interpolation in the Báez–Duarte step spaceScott SchubrEdition 2 · 2026-10-27 Public
  19. Joint Cutoffs and Negative-Spectrum Decay for Weighted Weil OperatorsScott SchubrEdition 3 · 2026-10-27 Public
  20. Sharp convergence of heat-kernel Sinkhorn metricsScott SchubrEdition 2 · 2026-10-27 Public
  21. Positive heat-flow observations on spherical shells: cutoffs, optimal preparation and concentrationScott SchubrEdition 2 · 2026-10-27 Public
  22. Curvature classification and certified Sinkhorn metrics for Fourier density modelsScott SchubrEdition 2 · 2026-10-27 Public
  23. Mean ergodic convergence from near-diagonal subadditivityScott SchubrEdition 2 · 2026-10-27 Public
  24. Quantitative Null-Space Compression for a Weighted Weil OperatorScott SchubrEdition 2 · 2026-10-27 Public
PublicEdition 2

Fourier computation of empirical diffusion metrics

Scott Schubr

Original PDF · First-page preview

Loading original first page…

Abstract

We give a finite Fourier algorithm for computing empirical diffusion-metric entries together with their joint uncertainty estimates. The metric is defined through an inverse weighted Laplacian and estimated by empirical heat-kernel Sinkhorn normalization. For a fixed smooth, strictly positive density on a fixed-dimensional flat torus and fixed smooth test functions, the algorithm preserves the exact estimator's population-centered Gaussian limit, joint covariance consistency and ordinary nonparametric bootstrap. For every fixed eta > 0, its deterministic work is O(n^(1+eta)) in the exact-real model, using sufficiently high fixed-order bias extrapolation. The proof controls the closing spectral gap as bandwidth decreases, the actual normalization iterations, and the errors in both the inverse metric and its influence covariance under the original empirical weights. Positive Fourier features and reduced linear solves provide the algorithm. The work bound includes feature-Gram construction and factorization; explicit finite schedules illustrate the resulting resource counts.

Read the full paper in the original PDF.