• Corpus ID: 220935791

Random-length Random Walks and Finite-size Scaling on high-dimensional hypercubic lattices I: Periodic Boundary Conditions

@article{Zhou2020RandomlengthRW,
  title={Random-length Random Walks and Finite-size Scaling on high-dimensional hypercubic lattices I: Periodic Boundary Conditions},
  author={Zongzheng Zhou and Jens Grimm and Youjin Deng and Timothy M. Garoni},
  journal={arXiv: Mathematical Physics},
  year={2020}
}
We study a general model of random-length random walks on discrete tori, and show that the mean walk length controls the scaling of the two-point function. We conjecture that on tori of dimension at least 5, the two-point functions of the Ising model and self-avoiding walk display the same scaling as the random-length random walk, not only at criticality, but also for a broad class of scaling windows/pseudocritical points. This conjecture is supported by extensive Monte Carlo simulations of the… 

Figures and Tables from this paper

Unwrapped two-point functions on high-dimensional tori
We study unwrapped two-point functions for the Ising model, the selfavoiding walk and a random-length loop-erased random walk on high-dimensional lattices with periodic boundary conditions. While the
The length of self-avoiding walks on the complete graph
TLDR
The leading order asymptotics of the mean and variance of the walk length are obtained, as the number of vertices goes to infinity, in the variable-length ensemble of self-avoiding walks on the complete graph.
The near-critical two-point function and the torus plateau for weakly self-avoiding walk in high dimensions
We use the lace expansion to study the long-distance decay of the two-point function of weakly self-avoiding walk on the integer lattice Z in dimensions d > 4, in the vicinity of the critical point,
The near-critical two-point function for weakly self-avoiding walk in high dimensions
We use the lace expansion to study the long-distance decay of the two-point function of weakly self-avoiding walk on the integer lattice $\mathbb{Z}^d$ in dimensions $d>4$, in the vicinity of the
The scaling limit of the weakly self-avoiding walk on a high-dimensional torus
We prove that the scaling limit of the weakly self-avoiding walk on a d-dimensional discrete torus is Brownian motion on the continuum torus if the length of the rescaled walk is o(V ) where V is the
Nonreversible Markov Chain Monte Carlo Algorithm for Efficient Generation of Self-Avoiding Walks
TLDR
An efficient nonreversible Markov chain Monte Carlo algorithm to generate self-avoiding walks with a variable endpoint that allows for three types of elementary moves on the existing self- avoidanceing walk: shorten, extend or alter conformation without changing the length of the walk.
High-dimensional near-critical percolation and the torus plateau
We consider percolation on Z and on the d-dimensional discrete torus, in dimensions d ≥ 11 for the nearest-neighbour model and in dimensions d > 6 for spread-out models. For Z, we employ a wide range
Anomalous finite-size scaling in the Fortuin-Kasteleyn clusters of the five-dimensional Ising model with periodic boundary conditions
We present a Monte Carlo study of the Fortuin-Kasteleyn Ising model on a five-dimensional ($d=5$) hypercubic lattice with linear size $L$ and periodic boundary conditions. Our numerical results show
Ising Model with Curie–Weiss Perturbation
. Consider the nearest-neighbor Ising model on Λ n := [ − n, n ] d ∩ Z d at inverse temperature β ≥ 0 with free boundary conditions, and let Y n ( σ ) := P u ∈ Λ n σ u be its total magnetization. Let

References

SHOWING 1-10 OF 44 REFERENCES
Random-Length Random Walks and Finite-Size Scaling in High Dimensions.
TLDR
This work introduces a random-length random walk model that exhibits the same universal FSS behavior previously conjectured for the self-avoiding walk and Ising model on finite boxes in high-dimensional lattices and proves the universality of its findings by extensive Monte Carlo simulations.
The length of self-avoiding walks on the complete graph
TLDR
The leading order asymptotics of the mean and variance of the walk length are obtained, as the number of vertices goes to infinity, in the variable-length ensemble of self-avoiding walks on the complete graph.
Geometric Explanation of Anomalous Finite-Size Scaling in High Dimensions.
TLDR
It is shown that previously observed anomalous behavior for correlation functions, measured on the standard Euclidean scale, can be removed by defining correlation functions on a scale which correctly accounts for windings.
Intersections of random walks
We study the large deviation behaviour of simple random walks in dimension three or more in this thesis. The first part of the thesis concerns the number of lattice sites visited by the random walk.
Self-avoiding walks on finite graphs of large girth
We consider self-avoiding walk on finite graphs with large girth. We study a few aspects of the model originally considered by Lawler, Schramm and Werner on finite balls in Z^d. The expected length
The near-critical two-point function for weakly self-avoiding walk in high dimensions
We use the lace expansion to study the long-distance decay of the two-point function of weakly self-avoiding walk on the integer lattice $\mathbb{Z}^d$ in dimensions $d>4$, in the vicinity of the
Self-avoiding walk in five or more dimensions I. The critical behaviour
We use the lace expansion to study the standard self-avoiding walk in thed-dimensional hypercubic lattice, ford≧5. We prove that the numbercn ofn-step self-avoiding walks satisfiescn~Aμn, where μ is
Self-avoiding walk on the complete graph
There is an extensive literature concerning self-avoiding walk on infinite graphs, but the subject is relatively undeveloped on finite graphs. The purpose of this paper is to elucidate the phase
Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals.
We consider nearest-neighbor self-avoiding walk, bond percolation, lattice trees, and bond lattice animals on Z d . The two-point functions of these models are respectively the generating function
Irreversible Markov chain Monte Carlo algorithm for self-avoiding walk
We formulate an irreversible Markov chain Monte Carlo algorithm for the self-avoiding walk (SAW), which violates the detailed balance condition and satisfies the balance condition. Its performance
...
1
2
3
4
5
...