中文
相关论文

相关论文: A series test of the scaling limit of self-avoidin…

200 篇论文

The conjecture that the scaling limit of the two-dimensional self-avoiding walk (SAW) in a half plane is given by the stochastic Loewner evolution (SLE) with $\kappa=8/3$ leads to explicit predictions about the SAW. A remarkable feature of…

概率论 · 数学 2009-11-07 Tom Kennedy

We conjecture a relationship between the scaling limit of the fixed-length ensemble of self-avoiding walks in the upper half plane and radial SLE with kappa=8/3 in this half plane from 0 to i. The relationship is that if we take a curve…

概率论 · 数学 2015-05-27 Tom Kennedy

The scaling limit of the two-dimensional self-avoiding walk (SAW) is believed to be given by the Schramm-Loewner evolution (SLE) with the parameter kappa equal to 8/3. The scaling limit of the SAW has a natural parameterization and SLE has…

概率论 · 数学 2007-05-23 Tom Kennedy

We numerically test the correspondence between the scaling limit of self-avoiding walks (SAW) in the plane and Schramm-Loewner evolution (SLE) with k=8/3. We introduce a discrete-time process approximating SLE in the exterior of the unit…

统计力学 · 物理学 2015-05-13 Marco Gherardi

Simulations of the self-avoiding walk (SAW) are performed in a half-plane and a cut-plane (the complex plane with the positive real axis removed) using the pivot algorithm. We test the conjecture of Lawler, Schramm and Werner that the…

概率论 · 数学 2015-06-26 Tom Kennedy

A celebrated problem in numerical analysis is to consider Brownian motion originating at the centre of a $10 \times 1$ rectangle, and to evaluate the ratio of probabilities of a Brownian path hitting the short ends of the rectangle before…

数学物理 · 物理学 2012-10-31 Anthony J Guttmann , Tom Kennedy

A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In this paper we present conjectures for the…

概率论 · 数学 2007-05-23 Gregory F. Lawler , Oded Schramm , Wendelin Werner

We consider the two-dimensional self-avoiding walk (SAW) in a simply connected domain that contains the origin. The SAW starts at the origin and ends somewhere on the boundary. The distribution of the endpoint along the boundary is expected…

概率论 · 数学 2011-09-15 Tom Kennedy , Gregory F. Lawler

This article employs Schramm-Loewner Evolution to obtain intersection exponents for several chordal $SLE_{8/3}$ curves in a wedge. As $SLE_{8/3}$ is believed to describe the continuum limit of self-avoiding walks, these exponents correspond…

数学物理 · 物理学 2008-03-04 Nathan Deutscher , Murray T. Batchelor

We develop an approach for performing scaling analysis of $N$-step Random Walks (RWs). The mean square end-to-end distance, $\langle\vec{R}_{N}^{2}\rangle$, is written in terms of inner persistence lengths (IPLs), which we define by the…

统计力学 · 物理学 2016-05-18 C. R. F. Granzotti , A. S. Martinez , M. A. A. da Silva

The smart kinetic self-avoiding walk (SKSAW) is a random walk which never intersects itself and grows forever when run in the full-plane. At each time step the walk chooses the next step uniformly from among the allowable nearest neighbors…

概率论 · 数学 2015-05-20 Tom Kennedy

Let D be a domain in the plane containing the origin. We are interested in the ensemble of self-avoiding walks (SAW's) in D which start at the origin and end on the boundary of the domain. We introduce an ensemble of SAW's that we expect to…

概率论 · 数学 2015-05-30 Tom Kennedy

We consider nearest neighbour spatial random permutations on $\mathbb{Z}^d$. In this case, the energy of the system is proportional the sum of all cycle lengths, and the system can be interpreted as an ensemble of edge-weighted, mutually…

概率论 · 数学 2018-03-29 Volker Betz , Lorenzo Taggi

If the three dimensional self-avoiding walk (SAW) is conformally invariant, then one can compute the hitting densities for the SAW in a half-space and in a sphere. The ensembles of SAW's used to define these hitting densities involve walks…

数学物理 · 物理学 2015-06-22 Tom Kennedy

We study a restricted class of self-avoiding walks (SAW) which start at the origin (0, 0), end at $(L, L)$, and are entirely contained in the square $[0, L] \times [0, L]$ on the square lattice ${\mathbb Z}^2$. The number of distinct walks…

统计力学 · 物理学 2016-08-31 M. Bousquet-Mélou , A. J. Guttmann , I. Jensen

Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…

无序系统与神经网络 · 物理学 2009-11-10 Carlos P. Herrero

The $n$-vector spin model, which includes the self-avoiding walk (SAW) as a special case for the $n \rightarrow 0 $ limit, has an upper critical dimensionality at four spatial dimensions (4D). We simulate the SAW on 4D hypercubic lattices…

统计力学 · 物理学 2021-12-14 Sheng Fang , Youjin Deng , Zongzheng Zhou

We consider self-avoiding walks (SAWs) on the backbone of percolation clusters in space dimensions d=2, 3, 4. Applying numerical simulations, we show that the whole multifractal spectrum of singularities emerges in exploring the…

无序系统与神经网络 · 物理学 2009-11-13 Viktoria Blavatska , Wolfhard Janke

We study the scaling limit of planar loop erased random walk (LERW) on the percolation cluster, with occupation probability $p\geq p_c$. We numerically demonstrate that the scaling limit of planar LERW$_p$ curves, for all $p>p_c$, can be…

统计力学 · 物理学 2015-06-17 E. Daryaei

We consider random walks (RWs) and self-avoiding walks (SAWs) on disordered lattices directly at the percolation threshold. Applying numerical simulations, we study the scaling behavior of the models on the incipient percolation cluster in…

无序系统与神经网络 · 物理学 2009-11-13 Viktoria Blavatska , Wolfhard Janke
‹ 上一页 1 2 3 10 下一页 ›