arXiv (OAI Expanded)
open access
Least Variability in a Polynomial-Square Class of Rational Kernels
We solve an extremal problem for positive randomization kernels that concentrate a random time as tightly as possible around a deterministic target, within the class obtained by exponentially damping the square of a polynomial. The construction, borrowed from the concentrated matrix-exponential lite
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Least Variability in a Polynomial-Square Class of Rational Kernels#793965
- Spectral boundaries of deterministic matrices deformed by rotationally invariant random non-Hermitian ensembles#925932
- Characteristic polynomial of self-normalized random matrices#784923
- Characteristic polynomial of self-normalized random matrices#783333
- Matrix Concentration and Equivalent Operators on Fock Spaces#1157330
Record · ID 789946
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive