Computing the Loewner driving process of random curves in the half plane
Tom Kennedy
Abstract
We simulate several models of random curves in the half plane and numerically compute their stochastic driving process (as given by the Loewner equation). Our models include models whose scaling limit is the Schramm-Loewner evolution (SLE) and models for which it is not. We study several tests of whether the driving process is Brownian motion. We find that just testing the normality of the process at a fixed time is not effective at determining if the process is Brownian motion. Tests that involve the independence of the increments of Brownian motion are much more effective. We also study the zipper algorithm for numerically computing the driving function of a simple curve. We give an implementation of this algorithm which runs in a time O(N1.35) rather than the usual O(N2), where N is the number of points on the curve.
Create a lesson
Related papers
Boolean Small-Ball Inequalities for Discrepancy Theory
Emrullah Akbas, Suvrit Sra
Markovian renormalisation for percolation in high-dimension: Semi-decidability of mean field behavior
Arthur Blanc-Renaudie
Point process convergence of large inradii of Poisson-Laguerre tessellations
Matthias Schulte, Martina Švarc Petráková
Interpolation of Gaussian Free Fields via Random Matrices
Gabriel Raposo
Almost-Uniform Bayesian Convergence to the Truth Is Not Characterized by Countable Additivity on Conditional Hitting Times
M. Ali Khan, Arthur Paul Pedersen, Maxwell B. Stinchcombe
The skeleton-blocks decomposition of Bienaymé trees, and applications to their local convergence
Marc Bernard, Robin Stephenson