English
Related papers

Related papers: New Lower Bounds on the Self-Avoiding-Walk Connect…

200 papers

We simulate self-avoiding walks on a cubic lattice and determine the second virial coefficient for walks of different lengths. This allows us to determine the critical value of the renormalized four-point coupling constant in the…

Statistical Mechanics · Physics 2008-11-26 Andrea Pelissetto , Ettore Vicari

The Stanley-Wilf limit of the pattern 1324 is known to lie between 10.271 and 13.5. We obtain lower bounds on this limit by encoding permutations as walks in directed graphs: building a permutation by successive insertion of maxima…

Combinatorics · Mathematics 2025-12-23 Atli Fannar Franklín

We study the correction-to-scaling exponents for the two-dimensional self-avoiding walk, using a combination of series-extrapolation and Monte Carlo methods. We enumerate all self-avoiding walks up to 59 steps on the square lattice, and up…

For a symmetric, homogeneous and irreducible random walk on d-dimensional integer lattice Z^d, having zero mean and a finite variance of jumps, we study the passage times (with possible infinite values) determined by the starting point x,…

Probability · Mathematics 2013-10-29 Ekaterina Bulinskaya

We have studied self-avoiding walks contained within an $L \times L$ square whose end-points can lie anywhere within, or on, the boundaries of the square. We prove that such walks behave, asymptotically, as walks crossing a square (WCAS),…

Mathematical Physics · Physics 2022-12-23 Anthony J Guttmann , Iwan Jensen , Aleksander L Owczarek

We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…

Probability · Mathematics 2021-07-15 T. J. van Uem

We have analyzed geometric and topological features of self-avoiding walks. We introduce a new kind of walk: the loop-deleted self-avoiding walk (LDSAW) motivated by the interaction of chromatin with the nuclear lamina. Its critical…

Statistical Mechanics · Physics 2020-10-30 Jiying Jia , Dieter W. Heermann

A quantum walk on a lattice is a paradigm of a quantum search in a database. The database qubit strings are the lattice sites, qubit rotations are tunneling events, and the target site is tagged by an energy shift. For quantum walks on a…

Quantum Physics · Physics 2025-10-14 Emma C. King , Moritz Linnebacher , Peter P. Orth , Matteo Rizzi , Giovanna Morigi

We introduce a Gibbs measure on nearest-neighbour paths of length $t$ in the Euclidean $d$-dimensional lattice, where each path is penalised by a factor proportional to the size of its boundary and an inverse temperature $\beta$. We prove…

Probability · Mathematics 2018-03-28 Nathanael Berestycki , Ariel Yadin

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

Probability · Mathematics 2021-12-08 David A. Croydon , Daisuke Shiraishi

Computing dynamical response functions in interacting lattice models is a long standing challenge in condensed matter physics. In view of recent results, the dc resistivity $\rho_\mathrm{dc}$ in the weak coupling regime of the Hubbard model…

Strongly Correlated Electrons · Physics 2025-09-25 Jeremija Kovačević , Michel Ferrero , Jakša Vučičević

We have calculated long series expansions for self-avoiding walks and polygons on the honeycomb lattice, including series for metric properties such as mean-squared radius of gyration as well as series for moments of the area-distribution…

Statistical Mechanics · Physics 2009-11-11 Iwan Jensen

Self-avoiding walks (SAWs) were introduced in chemistry to model the real-life behavior of chain-like entities such as solvents and polymers, whose physical volume prohibits multiple occupation of the same spatial point. In mathematics, a…

Data Structures and Algorithms · Computer Science 2013-10-01 Franc Brglez

It is a fact simple to establish that the mixing time of the simple random walk on a d-regular graph $G_n$ with n vertices is asymptotically bounded from below by $d/ ((d-2)\log (d-1))\log n$. Such a bound is obtained by comparing the walk…

Probability · Mathematics 2021-02-17 Charles Bordenave , Hubert Lacoin

The nearest lattice point problem in $\mathbb{R}^n$ is formulated in a distributed network with $n$ nodes. The objective is to minimize the probability that an incorrect lattice point is found, subject to a constraint on inter-node…

Information Theory · Computer Science 2024-09-17 V. A. Vaishampayan , M. F. Bollauf

Expected ballisticity of a continuous self avoiding walk on hyperbolic spaces $\mathbb{H}^d$ is established.

Probability · Mathematics 2020-07-08 Itai Benjamini , Christoforos Panagiotis

We use the lace expansion to give a simple proof that the critical two-point function for weakly self-avoiding walk on $\mathbb{Z}^d$ has decay $|x|^{-(d-2)}$ in dimensions $d>4$. The proof uses elementary Fourier analysis and the…

Probability · Mathematics 2021-03-09 Gordon Slade

In this paper we study the common distance between points and the behavior of a constant length step discrete random walk on finite area hyperbolic surfaces. We show that if the second smallest eigenvalue of the Laplacian is at least 1/4,…

Geometric Topology · Mathematics 2019-06-04 Konstantin Golubev , Amitay Kamber

The critical behaviour of directed self-avoiding walks is studied on parabolic-like systems with a free boundary at x=\pm Ct^\alpha. Using a scaling argument, 1/C is shown to be a marginal variable when \alpha=\nu_\perp/\nu_\parallel=1/2,…

Statistical Mechanics · Physics 2007-05-23 L. Turban

We present improved simulations of three-dimensional self avoiding walks with one end attached to an impenetrable surface on the simple cubic lattice. This surface can either be a-thermal, having thus only an entropic effect, or attractive.…

Soft Condensed Matter · Physics 2009-11-10 Peter Grassberger