Diffusion-limit convergence of calibrated binomial trees

Determine whether, when option data are consistent with a continuous-time local-volatility model, a sequence of calibrated recombining binomial trees with increasingly fine time grids converges to that continuous-time local-volatility model as the number of tree steps tends to infinity, under suitable scaling of tree-design parameters such as the asset-price bounds and admissibility margin.

Background

The paper proves existence of global minimizers for the finite-dimensional penalized calibration problem on compact subsets of a class of strictly admissible recombining binomial trees. The authors distinguish this finite-dimensional well-posedness result from a possible asymptotic connection with continuous-time local-volatility models.

The unresolved question concerns a sequence of calibrated trees whose number of time steps increases and whose design parameters may depend on the discretization level. The remark identifies potential sufficient conditions—uniformly vanishing log-price increments, convergence of conditional first and second moments, a negligible third-moment remainder, tightness of the induced processes, and well-posedness of the limiting martingale problem—that could support weak convergence to the corresponding diffusion and convergence of discounted expectations for suitable European payoffs.

References

If these data are consistent with a certain local volatility model in continuous time, it is natural to ask whether a sequence of calibrated trees based on more and more option data converges, as $N_T\to\infty$, to this continuous-time local-volatility model if tree design quantities may be allowed to depend on $N_T$, for instance $m(N_T)$, $M(N_T)$, and $\eta(N_T)$.

Neural Calibration of a Complete Market Model  (2608.30867 - Molent et al., 31 Aug 2026) in Remark 4.3, Section 4 (Well-posedness of the Calibration Problem)