Related papers: New upper bound for the connective constant for sq…
We report site percolation thresholds for square lattice with neighbor interactions at various increasing ranges. Using Monte Carlo techniques we found that nearest neighbors (N$^2$), next nearest neighbors (N$^3$), next next nearest…
In this paper, we study (1,2) and (2,1) random walks in varying environments on the lattice of positive half line. We assume that the transition probabilities at site $n$ are asymptotically constants as $n\rightarrow\infty.$ For (1,2)…
The connective constant $\mu(G)$ of a quasi-transitive graph $G$ is the asymptotic growth rate of the number of self-avoiding walks (SAWs) on $G$ from a given starting vertex. We survey several aspects of the relationship between the…
The correlation length of the square-lattice spin-1/2 Heisenberg antiferromagnet is studied in the low-temperature (asymptotic-scaling) regime. Our novel approach combines a very efficient loop cluster algorithm -- operating directly in the…
We present a calculation of Wilson loops, and the static inter-quark potential to $O(\alpha^2)$ in lattice perturbation theory. This is carried out with the Wilson, Symanzik-Weisz, and Iwasaki gauge actions and the Wilson,…
In this paper we extend the estimate of the value of the lattice spacing a in units of the r0 scale at values of the bare coupling larger than those available. By using results from the computation of the renormalised coupling in the…
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…
We consider various two-dimensional lattices such as square, Kagome, Lieb, honeycomb, dice lattices of finite extent, to study the effect of lattice profile in terms of the number of nearest neighbour and connectivity patterns on the…
We compute the one-loop coefficients for an alternative Symanzik improved pure gauge SU{N} lattice action (N=2 and N=3). For the standard Symanzik improved action we confirm previous results by L\"{u}scher and Weisz.
Upper bounds on the communication complexity of finding the nearest lattice point in a given lattice $\Lambda \subset \mathbb{R}^2$ was considered in earlier works~\cite{VB:2017}, for a two party, interactive communication model. Here we…
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…
We prove a scaling limit theorem for the simple random walk on critical lattice trees in $\mathbb{Z}^d$, for $d\geq 8$. The scaling limit is the Brownian motion on the Integrated Super-Brownian Excursion (BISE) which is the same one that we…
We present data from the ALPHA Collaboration about lattice calculation of SU(2) pure--gauge running coupling constant, obtained with two different definitions of the coupling itself, which show universality of the continuum limit and…
We show the critical density for activated random walks on Euclidean lattices is at most one.
For d at least two and integer n, let c_n = c_n(d) denote the number of length n self-avoiding walks beginning at the origin in the integer lattice Z^d, and, for even n, let p_n = p_n(d) denote the number of length n self-avoiding polygons…
For a two-dimensional lattice $\Lambda$ with $n$ vertices, the number of spanning trees $N_{ST}(\Lambda)$ grows asymptotically as $\exp(n z_\Lambda)$ in the thermodynamic limit. We present exact integral expression and numerical value for…
We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for…
Recently the Yang-Mills gradient flow of pure SU(3) lattice gauge theory has been calculated in the range from $\beta=6/g_0^2=6.3$ to~7.5 (Asakawa et al.), where $g_0^2$ is the bare coupling constant of the SU(3) Wilson action. Estimates of…
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 of a random self avoiding path is…
We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from Z^2 by removing all horizontal edges off the X-axis,…