English
Related papers

Related papers: Self-avoiding Walks of Lattice Strips

200 papers

We study a number of combinatorial and algebraic structures arising from walks on the two-dimensional integer lattice. To a given step set $X\subseteq\mathbb Z^2$, there are two naturally associated monoids: $\mathscr F_X$, the monoid of…

Combinatorics · Mathematics 2021-05-28 James East , Nicholas Ham

We investigate active lattice walks: biased continuous time random walks which perform orientational diffusion between lattice directions in one and two spatial dimensions. We study the occupation probability of an arbitrary site on the…

Statistical Mechanics · Physics 2024-02-27 Stephy Jose , Dipanjan Mandal , Mustansir Barma , Kabir Ramola

We solve the problem of a chain, modeled as a self-avoiding walk, grafted o the wall limiting a semi-infinite Bethe lattice of arbitrary coordination number q. In particular, we determine the pressure exerted by the polymer on the wall, as…

Statistical Mechanics · Physics 2015-01-21 Rafael Mynssem Brum , Jurgen F. Stilck

In this short note, we study quantum walks (QWs) on one dimensional lattice $\delta \mathbb{Z}$. Following Hong-Yang, we prove Strichartz estimates for QWs independent of the lattice width $\delta$.

Analysis of PDEs · Mathematics 2021-12-03 Takumi Aso , Masaya Maeda

In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…

Probability · Mathematics 2007-05-23 R. van der Hofstad , F. den Hollander , W. Koenig

We show that the Density of States (DoS) for lattice Self Avoiding Walks can be estimated by using an inverse algorithm, called flatIGW, whose step-growth rules are dynamically adjusted by requiring the energy histogram to be locally flat.…

Statistical Mechanics · Physics 2015-05-18 M. Ponmurugan , V. Sridhar , S. L. Narasimhan , K. P. N. Murthy

We investigate the asymptotic behaviour of a class of self-interacting nearest neighbour random walks on the one-dimensional integer lattice which are pushed by a particular linear combination of their own local time on edges in the…

Probability · Mathematics 2017-07-18 Anna Erschler , Balint Toth , Wendelin Werner

We study the localisation of lattice polymer models near a permeable interface in two dimensions. Localisation can arise due to an interaction between the polymer and the interface, and can be altered by a preference for the bulk solvent on…

Statistical Mechanics · Physics 2024-07-24 C J Bradly , N R Beaton , A L Owczarek

We enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices,…

Statistical Mechanics · Physics 2008-08-28 A. N. Rogers , C. Richard , A. J. Guttmann

We study random walks evolving in continuous time on a one-dimensional lattice where each site $x$ hosts a quenched random potential $U_x$. The potentials on different sites are independent, identically distributed Gaussian random…

Statistical Mechanics · Physics 2026-02-27 Silvio Kalaj , Enzo Marinari , Gleb Oshanin , Luca Peliti

We consider a random walk on the Manhattan lattice. The walker must follow the orientations of the bonds in this lattice, and the walker is not allowed to visit a site more than once. When both possible steps are allowed, the walker chooses…

Probability · Mathematics 2018-11-14 Tom Kennedy

We introduce a fast implementation of the pivot algorithm for self-avoiding walks, which we use to obtain large samples of walks on the cubic lattice of up to $33 \times 10^6$ steps. Consequently the critical exponent $\nu$ for…

Statistical Mechanics · Physics 2010-02-03 Nathan Clisby

We show how the theory of the critical behaviour of $d$-dimensional polymer networks gives a scaling relation for self-avoiding {\em bridges} that relates the critical exponent for bridges $\gamma_b$ to that of terminally-attached…

Statistical Mechanics · Physics 2020-01-29 Bertrand Duplantier , Anthony J Guttmann

We consider an irreducible finite range random walk on the $d$-dimensional integer lattice and study asymptotic behaviour of its transition function $p(n; x)$. In particular, for simple random walk our asymptotic formula is valid as long as…

Probability · Mathematics 2015-12-31 Bartosz Trojan

Sums of walks for charged particles (e.g. Hofstadter electrons) on a square lattice in the presence of a magnetic field are evaluated. Returning loops are systematically added to directed paths to obtain the unrestricted propagators.…

Condensed Matter · Physics 2009-10-22 Thomas Blum , Yonathan Shapir

In 2010, Duminil-Copin and Smirnov proved a long-standing conjecture of Nienhuis, made in 1982, that the growth constant of self-avoiding walks on the hexagonal (a.k.a. honeycomb) lattice is $\mu=\sqrt{2+\sqrt{2}}.$ A key identity used in…

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

Probability · Mathematics 2018-07-19 Roberto I. Oliveira , Yuval Peres

We investigate numerically lattice Weinberg - Salam model without fermions for realistic values of the fine structure constant and the Weinberg angle. We also analyze the data of the previous numerical investigations of lattice Electroweak…

High Energy Physics - Phenomenology · Physics 2009-01-14 A. I. Veselov , M. A. Zubkov

Given $d\geq2$, we construct a Zariski-dense random walk on the space of lattices SL$_d(\mathbb{R})/$SL$_d(\mathbb{Z})$ that exhibits escape of mass. This negates the suggestion of recurrence made by Benoist [Ben14] (ICM 2014) and by…

Probability · Mathematics 2025-04-16 Axel Péneau , Cagri Sert

We describe the scaling limit of the nearest neighbour prudent walk on the square lattice, which performs steps uniformly in directions in which it does not see sites already visited. We show that the scaling limit is given by the process…

Probability · Mathematics 2018-04-26 V. Beffara , S. Friedli , Y. Velenik
‹ Prev 1 8 9 10 Next ›