Luminary Research Archive
Luminary Research ArchiveIndependent scholarship
Luminary Portal

All Research

Research

154 papers
Browse papers
  1. Critical-tail localization and growing theta correction inertiaScott SchubrEdition 2 · 2026-10-27 Public
  2. Pure-Point Dirichlet Spectrum in an Enlarging Cube TowerScott SchubrEdition 2 · 2026-10-27 Public
  3. Sharp permanent-derivative compensation on the flat equal-spectrum conjugate-disjoint Gram stratumScott SchubrEdition 2 · 2026-10-27 Public
  4. Geometric Blind Modes in the Weyl Asymptotics of Twisted TubesScott SchubrEdition 2 · 2026-10-27 Public
  5. Variance cancellation and two-direction bounds for six-row permanent derivativesScott SchubrEdition 2 · 2026-10-27 Public
  6. Heat-Trace Recovery of a Weyl-Blind Twisting ModeScott SchubrEdition 2 · 2026-10-27 Public
  7. Real-section permanent-derivative compensation and quadratic phase controlScott SchubrEdition 2 · 2026-10-27 Public
  8. Full-phase permanent-derivative compensation under real-part spectral pinchingScott SchubrEdition 2 · 2026-10-27 Public
  9. Phase-boundary reduction and low-rank compensation for permanent derivativesScott SchubrEdition 2 · 2026-10-27 Public
  10. Typical-value anchors for polynomial approximation and theta correction inertiaScott SchubrEdition 2 · 2026-10-27 Public
  11. All-depth root-Laguerre positivity with nonreal Fourier zerosScott SchubrEdition 3 · 2026-10-27 Public
  12. Polynomial synthesis and zero ideals for the Riemann xi-functionScott SchubrEdition 2 · 2026-10-27 Public
  13. Sharp degree exponents for polynomial detection of isolated negative atomsScott SchubrEdition 2 · 2026-10-27 Public
  14. A sixth-order obstruction to total positivity of an arithmetic theta trace kernelScott SchubrEdition 2 · 2026-10-27 Public
  15. Sharp collision laws and subexponential masking for polynomial certificatesScott SchubrEdition 2 · 2026-10-27 Public
  16. Collision geometry and concentration in polynomial sign recoveryScott SchubrEdition 2 · 2026-10-27 Public
  17. Left-Sector Mellin Certification of a Weyl-Blind Twisting ModeScott SchubrEdition 2 · 2026-10-27 Public
  18. Growing-Index Recovery and Tail Scales for Signed MeasuresScott SchubrEdition 2 · 2026-10-27 Public
  19. A Positive Corner Limit for Inverse Half-Powers of Vámos QuarticsScott SchubrEdition 2 · 2026-10-27 Public
  20. A counterexample and corrected translation-density criterion for correlation kernelsScott SchubrEdition 2 · 2026-10-27 Public
  21. Asymptotically optimal bounds for permanental cofactor matricesScott SchubrEdition 2 · 2026-10-27 Public
  22. Exact minimax estimation of homogeneous complex Gaussian energiesScott SchubrEdition 2 · 2026-10-27 Public
  23. An explicit global lower certificate for a weighted Weil operatorScott SchubrEdition 2 · 2026-10-27 Public
  24. Odd Weil-form bounds by positive exterior eliminationScott 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.