惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Martin Fowler
Martin Fowler
Y
Y Combinator Blog
M
MIT News - Artificial intelligence
The Cloudflare Blog
WordPress大学
WordPress大学
H
Hackread – Cybersecurity News, Data Breaches, AI and More
博客园 - 司徒正美
小众软件
小众软件
Blog — PlanetScale
Blog — PlanetScale
雷峰网
雷峰网
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
J
Java Code Geeks
云风的 BLOG
云风的 BLOG
C
Check Point Blog
D
DataBreaches.Net
T
The Blog of Author Tim Ferriss
V
V2EX
F
Fortinet All Blogs
B
Blog
大猫的无限游戏
大猫的无限游戏
N
Netflix TechBlog - Medium
B
Blog RSS Feed
A
About on SuperTechFans
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC

math.PR updates on arXiv.org

Visibility in the Boolean Model on Harmonic Manifolds Global estimates on the Brenier map Geodesics and Wandering Exponents in Brochette First-Passage Percolation State-dependent inverse-subordinator time changes of regenerative processes: Excursion structure and multiscale occupation-time limits Randomly twisted transfer operators and singular values statistics Generalized Bessel-Dunkl diffusions An almost sure invariance principle for the Takagi-van der Waerden class functions Central limit theorems for high dimensional lattice polytopes: cosmological polytopes Convergence rate estimates for semigroups and heat kernels associated with resistance forms Second-order Poincaré inequalities and localization on the Poisson space Maximum Probability of Independence in Transitive Matroids On global solutions to the semidiscrete stochastic heat equation The Poisson Tail Conjecture for primes in short intervals A Complete Spectral Analysis of the CEV Operator with Applications to Arbitrage Holographic functions and neural networks From Betting to Empirical Bernstein LIL Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise Pointwise Generalization in Deep Neural Networks Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors Wasserstein bounds for denoising diffusion probabilistic models via the Föllmer process A note on connections between the Föllmer process and the denoising diffusion probabilistic model Simple Approximation and Derivative Free Inference-Time Scaling for Diffusion Models via Sequential Monte Carlo on Path Measures Diffusion-Based Stochastic Operator Networks for Uncertainty Quantification in Stochastic Partial Differential Equations A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights Propagation of Chaos in Contextual Flow Maps Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixtures $α$-TCAV: A Unified Framework for Testing with Concept Activation Vectors Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model On the Limits of Latent Reuse in Diffusion Models State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives
Using the slowest observable in one-dimensional Markov pr...
[Submitted on 17 Apr 2026 (v1), last revised 1 Sep 2026 (this ve · 2026-04-17 · via math.PR updates on arXiv.org

View PDF HTML (experimental)

Abstract:The construction of Quasi-Exactly-Solvable quantum Hamiltonians where only the first two eigenstates $\Phi_0(x)$ and $\Phi_1(x)$ of energies $E_0$ and $E_1$ are explicit is revisited from the point of view of one-dimensional Markov processes satisfying detailed-balance, whose generators are related to quantum Hamiltonians via similarity transformations. Here, the lowest energy vanishes $E_0=0$ and is associated with the conservation of probability and with the steady state $P_*(x)$, while $E_1>0$ is the rate that governs the exponential relaxation towards the steady-state, and is associated with the slowest observable $L_1(x)$ that corresponds to the ratio $ \frac{\Phi_1(x) }{\Phi_0(x)}$ of the two quantum eigenstates. Our main conclusion is that the Markov perspective leads to interesting re-interpretations and that the construction of quasi-exactly-solvable models with $N=2$ explicit levels is more intuitive and technically simpler when one takes the slowest observable $L_1(x)$ as the central object from which all the other properties can be reconstructed. This general approach is then applied to Fokker-Planck generators in continuous space and to Markov jump generators on the lattice.

Submission history

From: Cecile Monthus [view email]
[v1] Fri, 17 Apr 2026 10:06:07 UTC (31 KB)
[v2] Tue, 1 Sep 2026 15:42:16 UTC (34 KB)