SearcharxivSearch

arXiv · 2608.09712

Spectral Equality for Novikov Integrability: Recursive Criticality and Unbounded Asymptotic Depth

Abstract

We determine the finiteness boundary of the Novikov exponential moment for a one-dimensional constant-volatility mean-reverting diffusion. A localised change of measure cancels the squared drift and leaves a Brownian Feynman-Kac functional with potential $q/2$, where $q=-\lambda'$. If $q(\theta+y)\sim\kappa_\infty y^2$, the exact spectral boundary is $\kappa_\infty\sigma^2T^2=\pi^2$; for cubic drift it becomes $c\sigma^2T^2=\pi^2/3$, and equality is divergent. On the spectral equality surface, the first lower-order transition occurs at power $4/3$, where an explicit coefficient separates the two sides. For symmetric finite pure-power tails, exact tuning generates the recursion $\beta_n=1+3^{-(n+1)}$. We prove that this recursion gives a complete classification of the class. Each individual tail is decided after finitely many comparisons, but the required depth is unbounded: arbitrarily long common critical prefixes can lead to opposite outcomes. The drift-removing stochastic exponential nevertheless remains a true martingale; under the physical law it has no higher moments on the steep-drift class, while the reverse density is essentially bounded.

Explore related subjects

Keep this discovery

BibTeXRIS

Jaewoo Lee. 2026-08-10. Spectral Equality for Novikov Integrability: Recursive Criticality and Unbounded Asymptotic Depth. https://arxiv.org/abs/2608.09712

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR