SearcharxivSearch

arXiv · 1912.06424

An asymptotic radius of convergence for the Loewner equation and simulation of $SLE_k$ traces via splitting

Abstract

In this paper, we shall study the convergence of Taylor approximations for the backward Loewner differential equation (driven by Brownian motion) near the origin. More concretely, whenever the initial condition of the backward Loewner equation (which lies in the upper half plane) is small and has the form $Z_{0} = \varepsilon i$, we show these approximations exhibit an $O(\varepsilon)$ error provided the time horizon is $\varepsilon^{2+\delta}$ for $\delta > 0$. Statements of this theorem will be given using both rough path and $L^{2}(\mathbb{P})$ estimates. Furthermore, over the time horizon of $\varepsilon^{2-\delta}$, we shall see that "higher degree" terms within the Taylor expansion become larger than "lower degree" terms for small $\varepsilon$. In this sense, the time horizon on which approximations are accurate scales like $\varepsilon^{2}$. This scaling comes naturally from the Loewner equation when growing vector field derivatives are balanced against decaying iterated integrals of the Brownian motion. As well as being of theoretical interest, this scaling may be used as a guiding principle for developing adaptive step size strategies which perform efficiently near the origin. In addition, this result highlights the limitations of using stochastic Taylor methods (such as the Euler-Maruyama and Milstein methods) for approximating $SLE_{\kappa}$ traces. Due to the analytically tractable vector fields of the Loewner equation, we will show Ninomiya-Victoir (or Strang) splitting is particularly well suited for SLE simulation. As the singularity at the origin can lead to large numerical errors, we shall employ the adaptive step size proposed by Tom Kennedy to discretize $SLE_{\kappa}$ traces using this splitting. We believe that the Ninomiya-Victoir scheme is the first high order numerical method that has been successfully applied to $SLE_{\kappa}$ traces.

Explore related subjects

Keep this discovery

BibTeXRIS

James Foster, Terry Lyons, Vlad Margarint. 2019-12-13. An asymptotic radius of convergence for the Loewner equation and simulation of $SLE_k$ traces via splitting. https://doi.org/10.1007/s10955-022-02979-3

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