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

summary

The gist

The Euler–Maruyama approximation of the degenerate stochastic differential equation exhibits an initialization-dependent solution-selection phase transition where subcritical initialization selects…

In short

The Euler-Maruyama approximation for a specific degenerate stochastic differential equation shows that how you start the simulation matters greatly. Starting near zero selects one solution, starting at a critical scale leads to another, and starting far away chooses a third. This selection depends on a parameter derived from the initialization's size relative to specific scales.

Key concepts

Degenerate SDE
This is a type of stochastic differential equation where the diffusion term depends on the state variable itself, specifically involving its absolute value multiplied by $\alpha$. This degeneracy causes uniqueness in law to fail, meaning different starting points can lead to completely different long-term behaviors for the process.
Non-sticky solution ($X_{ns}$)
This is a specific weak solution where the process stays at zero for a deterministic time $T$ and then restarts as an independent copy of itself. It represents one possible outcome when the initialization is in the subcritical regime, meaning it converges to this behavior.
Selection Parameter ($\Theta_h$)
This parameter quantifies how far the numerical scheme's behavior is from a simple convergence to zero. It balances the spatial scale of the initialization ($|x_h|$) against the critical spatial scale ($r_h$), determining whether the scheme selects the non-sticky solution, a finite holding time solution, or an absorbing zero solution.

Terminology used across episodes

This episode discusses

The paper

Initialization-Dependent Solution Selection by the Euler-Maruyama Scheme for a Degenerate SDE · Read on arXiv

Akihiro Tanaka

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "Initialization-Dependent Solution Selection by the Euler-Maruyama Scheme for a Degenerate SDE".

Emmy: Here's the gist of the paper. The Euler–Maruyama approximation of the degenerate stochastic differential equation exhibits an initialization-dependent solution-selection phase transition where subcritical initialization selects a non-sticky solution, critical initialization leaves a finite deterministic holding time, and supercritical initialization selects an absorbing solution Distinguished Weak Solutions The paper introduces two basic weak solutions to the degenerate SDE: the identically zero process is an absorbing solution There is also a distinguished non-sticky solution Xns satisfying Z T 0 1Xns t =0 dt = 0 a.s., T < ∞ Moreover, for every deterministic d ≥ 0, one may keep the process at zero up to time d and then start an independent copy of the non-sticky solution These delayed solutions are weak solutions of the same SDE Euler Scheme and Selection Parameter The main point of this paper is that the statement “xh → 0” is far from sufficient to determine the numerical limit The critical spatial scale is rh = h 1/

2(1−α): , and the relevant depth parameter is Θh = h log 1 + log+ rhxh If Θh → 0, the scheme converges to the non-sticky weak solution If Θh → θ ∈ (0, ∞), it converges to the solution that stays at zero for the deterministic time dθ = θ/ log α and then evolves as the non-sticky solution If Θh → ∞, the scheme converges to the absorbing solution Subcritical Regime Analysis If Θh → 0, then Xh ⇒ Xns in Cloc(

0, ∞)) This convergence is established by the occupation estimate showing that for every T < ∞ there is CT < ∞, depending only on T, α and supnxn, such that for 0 < ε ≤ 1, lim sup n→∞ E Z T 0 1Xn t<ε dt ≤ CT ε 1−2α Critical and Supercritical Regimes If Θh → θ ∈ (0, ∞), then Xh ⇒ X(dθ), dθ = θ/cα, in Cloc([0, ∞)) If Θh → ∞, then Xh −→ 0 in probability in Cloc([0, ∞)) The critical convergence holds on every finite horizon Identification of the non-sticky limit The cluster set of the laws is identified as L(X(θ/cα): θ ∈ C(Θ) ∩ [0,∞): ∪ δ0: ∞ ∈ C(Θ) This implies that the Euler laws converge if and only if C(Θ) is a singleton The Euler–Maruyama approximation of dXt = Xt α dWt, 0 < α < 1/2, exhibits an initialization-dependent solution-selection phase transition where subcritical initialization selects the non-sticky solution, critical initialization leaves a finite deterministic holding time, and supercritical initialization selects the absorbing solution The mechanism separates two effects that are invisible if one only records xh → 0 The exact scale invariance used in the analysis is specific to the power-law coefficient A Exit-time estimates for the rescaled chain The exit-time law of large numbers is established by showing that for every fixed R > 0, τR(v) H(v) −→ 1 cα in probability as v → 0, v ≠ 0 The discrete occupation estimates yield the grid occupation estimate E

h Xk<Nh(T) 1Yh k<ε: ≤ CT ε 1−2α B Discrete occupation estimates The discrete Tanaka remainder provides the estimate E N X−1 k=0 Rh(Yh k, a) = EYh N − a − xh − a The annular and mesoscopic occupation estimates yield the grid occupation estimate E

h Xk<Nh(T) 1Yh k<ε: ≤ CT ε 1−2α C Tightness and identification of the non-sticky limit The Kolmogorov–Chentsov criterion gives tightness of the family of processes in C(

0, T: ) The Brownian time-change construction uniquely determines the law of a non-sticky weak solution This completes the proof of Theorem 6.2 C5 Uniqueness of the non-sticky law The Brownian time-change construction uniquely determines the law of a non-sticky weak solution The Dambis–Dubins–Schwarz theorem gives a Brownian motion B such that Xt = BQt on the stochastic interval

0, Q∞) This construction uniquely determines the law of a non-sticky weak solution Acknowledgments The author used OpenAI ChatGPT (GPT-5.6 Sol, 2026) as an assistive tool for language editing, structural suggestions, literature searches, numerical-code review, exploration of alternative formulations and proof strategies, and critical examination of mathematical arguments The author assumes full responsibility for the originality, correctness, and integrity of the manuscript References [1: Antonov, A., Konikov, M.

Ada: and Spector, M.

Emmy: (2015).

Ada: The free boundary SABR: natural extension to negative rates

2: Bafico, R.

Paper summary: Ada: So we've seen that this paper studies an equation where uniqueness in law fails because of how degenerate the diffusion coefficient is. The main thrust of "Initialization-Dependent Solution Selection by the Euler-Maruyama Scheme for a Degenerate SDE" is showing that starting at zero traps you, but starting near zero lets you choose between different types of solutions.

Emmy: It claims that they can identify this dependence through a critical spatial scale r and a depth parameter theta h. This parameter theta h tells you if the numerical approximation picks the non-sticky solution, gets stuck in a finite delay, or just vanishes.

Kolya: What's interesting is how they link this to an exact scale-invariant Euler chain. They use something called a logarithmic exit-time law of large numbers and a discrete Tanaka occupation estimate to prove these regimes. That means they aren't just guessing; they are using detailed estimates on the occupation of time intervals.

Ada: The paper lays out the trichotomy clearly: if theta h vanishes, you get the non-sticky solution, if it's finite, you get a deterministic delay d related to theta, and if it goes to infinity, you just stay near zero on every compact time interval.

Emmy: The authors emphasize that this separation of behaviors is invisible if you only look at the simple condition that the Euler step size x goes to zero. That initial condition is not enough on its own to determine the numerical limit.

Conclusion: Ada: So to wrap up, this work by Tanaka is about how sensitive numerical solutions can be when the underlying math doesn't have a unique answer. The paper shows that the way you initialize your process matters fundamentally for the resulting model you get from a numerical approximation.

Emmy: Basically, they give us a roadmap based on that depth parameter theta h. If you start close to zero but not too close, you get one type of solution; if you are very far away, or too close in a specific way, you get the absorbing solution. This is about understanding the structure behind why discretization choices matter so much.

Kolya: The implication for us is that when we see numerical results that seem to converge to zero, we need to ask what the initialization looked like relative to that critical scale r. It moves us from just checking convergence to actually characterizing which solution is physically realized by the approximation.

Ada: Exactly. We're moving beyond just saying "the scheme converges" and asking "which convergence path does it take?" This paper gives us a way to categorize those different paths based on simple initial conditions and scale comparisons.

More episodes

← Home