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.
Exact Sampling of Self-avoiding Paths via Discrete Schramm-Loewner Evolution / M. Gherardi. - In: JOURNAL OF STATISTICAL PHYSICS. - ISSN 0022-4715. - 140:6(2010), pp. 1115-1129. [10.1007/s10955-010-0031-8]
Exact Sampling of Self-avoiding Paths via Discrete Schramm-Loewner Evolution
M. Gherardi
2010
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.File | Dimensione | Formato | |
---|---|---|---|
10.1007%2Fs10955-010-0031-8.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
501.01 kB
Formato
Adobe PDF
|
501.01 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.