Exact sampling of self-avoiding paths via discrete Schramm-Loewner evolution
From MaRDI portal
Abstract: We present an algorithm, based on the iteration of conformal maps, that produces independent samples of self-avoiding paths in the plane. It is a discrete process approximating radial Schramm-Loewner evolution growing to infinity. We focus on the problem of reproducing the parametrization corresponding to that of lattice models, namely self-avoiding walks on the lattice, and we propose a strategy that gives rise to discrete paths where consecutive points lie an approximately constant distance apart from each other. This new method allows us to tackle two non-trivial features of self-avoiding walks that critically depend on the parametrization: the asphericity of a portion of chain and the correction-to-scaling exponent.
Recommendations
- Whole-plane self-avoiding walks and radial Schramm-Loewner evolution: a numerical study
- Conformal invariance and stochastic Loewner evolution predictions for the 2D self-avoiding walk -- Monte Carlo tests
- Self-testing algorithms for self-avoiding walks
- scientific article; zbMATH DE number 2154241
- scientific article; zbMATH DE number 1003292
Cites work
- scientific article; zbMATH DE number 2154241 (Why is no real title available?)
- scientific article; zbMATH DE number 2172004 (Why is no real title available?)
- scientific article; zbMATH DE number 201032 (Why is no real title available?)
- scientific article; zbMATH DE number 2110551 (Why is no real title available?)
- A faster implementation of the pivot algorithm for self-avoiding walks
- A guide to stochastic Löwner evolution and its applications
- A natural parametrization for the Schramm-Loewner evolution
- Correction-to-scaling exponents for two-dimensional self-avoiding walks
- Discrete Löwner evolution.
- Laplacian growth as one-dimensional turbulence
- Monte Carlo methods for the self-avoiding walk
- SLE curves and natural parametrization
- SLE for theoretical physicists
- Scaling limits of loop-erased random walks and uniform spanning trees
- Square lattice
- The length of an SLE -- Monte Carlo studies
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
- Whole-plane self-avoiding walks and radial Schramm-Loewner evolution: a numerical study
Cited in
(2)
This page was built for publication: Exact sampling of self-avoiding paths via discrete Schramm-Loewner evolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q643715)
