Luminary Research Archive
Luminary Research ArchiveIndependent scholarship
Luminary Portal

All Research

Research

8 papers
Browse papers
  1. RH: Complete Signed Certificates and Canonical Null SynthesisScott SchubrEdition 12 · 2026-11-01 Public
  2. Fourier computation of empirical diffusion metricsScott SchubrEdition 2 · 2026-10-30 Public
  3. Relative tail payment and spectral enclosuresScott SchubrEdition 1 · 2026-10-29 Public
  4. Signed Frequency Certificates and Constraint Costs for Odd Weil FormsScott SchubrEdition 1 · 2026-10-27 Public
  5. Relative finite optimization of arithmetic approximation distancesScott SchubrEdition 2 · 2026-10-27 Public
  6. Certified source elimination for localized odd Weil formsScott SchubrEdition 2 · 2026-10-27 Public
  7. RH, Approximately: Certified Lower Bounds for Odd Weil PositivityScott SchubrEdition 1 · 2026-10-27 Public
  8. Certified negative-band approximation for odd Weil formsScott SchubrEdition 1 · 2026-10-26 Public

Fourier computation of empirical diffusion metrics

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.