Indexed metadata

Initialization-Dependent Solution Selection by the Euler-Maruyama Scheme for a Degenerate SDE

Akihiro Tanaka

Source record

Source: arXiv

Published: Oct 9, 2026

arXiv: 2610.13800

Open original source ↗

Source abstract

We study the Euler-Maruyama approximation of the degenerate stochastic differential equation dXt=∣Xt∣α dWtdX_t = |X_t|^α\,dW_t, 0<α<1/20 < α< 1/2, X0=0X_0 = 0, for which uniqueness in law fails. The Euler scheme started exactly from zero is trapped by the absorbing solution, whereas a nonzero initialization xh→0x_h \to 0 can select a different weak solution. We identify the initialization-dependent limiting regimes. The critical spatial scale is rh=h1/[2(1−α)]r_h = h^{1/[2(1-α)]}, and the relevant depth parameter is Θh=hlog⁡(1+log⁡+(rh/∣xh∣))Θ_h = h\log(1+\log^+(r_h/|x_h|)). If Θh→0Θ_h \to 0, the scheme converges to the non-sticky weak solution. If Θh→θ∈(0,∞)Θ_h \to θ\in (0,\infty), it converges to the solution that stays at zero for the deterministic time θ/∣log⁡α∣θ/|\logα| and then evolves as the non-sticky solution. If Θh→∞Θ_h \to \infty, the scheme converges to the absorbing solution. The proof is based on an exact scale-invariant Euler chain, a logarithmic exit-time law of large numbers, a discrete Tanaka occupation estimate, and a compact-uniform restart argument. Every finite deterministic delay can be obtained by a suitable vanishing initialization, while oscillating depth parameters yield process-level nonconvergence. Thus a vanishing initialization can survive in the limit as a macroscopic deterministic delay and thereby act as a solution selector for the Euler-Maruyama approximation.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.