English

Splitting algorithm and normed convergence for drawing the random fractal Loewner curves

Probability 2024-08-20 v3

Abstract

In the first part of the paper we propose and study the approximation of the SLEκSLE_\kappa trace via the Ninomiya-Victoir splitting algorithm. We prove the uniform convergence in probability with respect to the sup-norm to the distance between the SLEκSLE_\kappa trace and the output of the Ninomiya-Victoir splitting algorithm when applied in the context of the Loewner differential equation. Further investigations on the LpL^p-norm convergence is also exhibited, shedding light on the more delicate convergence structure. In the second part we show the uniform convergence of the approximation of the SLEκSLE_\kappa trace obtained using a different scheme that is based on the linear interpolation of the Brownian driving force.

Keywords

Cite

@article{arxiv.2110.10631,
  title  = {Splitting algorithm and normed convergence for drawing the random fractal Loewner curves},
  author = {Jiaming Chen and Vlad Margarint},
  journal= {arXiv preprint arXiv:2110.10631},
  year   = {2024}
}

Comments

25 pages, 1 figure; Refining of the text and of the results. Change of the title

R2 v1 2026-06-24T07:02:57.118Z