A Fast Algorithm for Simulating the Chordal Schramm-Loewner Evolution
Tom Kennedy
Abstract
The Schramm-Loewner evolution (SLE) can be simulated by dividing the time interval into N subintervals and approximating the random conformal map of the SLE by the composition of N random, but relatively simple, conformal maps. In the usual implementation the time required to compute a single point on the SLE curve is O(N). We give an algorithm for which the time to compute a single point is O(Np) with p<1. Simulations with kappa=8/3 and kappa=6 both give a value of p of approximately 0.4.
Create a lesson
Related papers
Sandpile avalanches in two dimensions are finite
Ahmed Bou-Rabee
Markov Chain Convergence in Kernel-Induced Geometry
Oleksii Kachaiev, Luc Brogat-Motte, Silvia Villa et al.
Interacting Stochastic Systems with Agent-Based Sampling and Connection-Based Reinforcement
Yogesh Dahiya, Gursharn Kaur, Neeraja Sahasrabudhe
Dimension-free Markov--Bernstein-type inequality for R2-valued polynomials
Egor Kosov
Initialization-Dependent Solution Selection by the Euler-Maruyama Scheme for a Degenerate SDE
Akihiro Tanaka
Statistical inference for rough Burgers-type stochastic partial differential equations
Simon Chony Acosta Christian Olivera Ciprian Tudor