English
Related papers

Related papers: New upper bound for the connective constant for sq…

200 papers

Some time ago Salmhofer demonstrated the equivalence of the strong coupling lattice Schwinger model with Wilson fermions to a certain 8-vertex model which can be understood as a self-avoiding loop model on the square lattice with bending…

High Energy Physics - Lattice · Physics 2008-11-26 K. Scharnhorst

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…

The static energy is an excellent observable for extracting the strong coupling $\alpha_s$ on the lattice. For short distances, the static energy can be calculated both on the lattice using Wilson line correlators, and with perturbation…

We study a model of random electric networks with Bernoulli resistances. In the case of the lattice Z^2, we show that the point-to-point effective resistance between 0 and a vertex v has a variance of order at most (log |v|)^(2/3) whereas…

Probability · Mathematics 2007-11-28 Itai Benjamini , Raphael Rossignol

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…

Disordered Systems and Neural Networks · Physics 2009-11-10 Carlos P. Herrero

In pure SU(2) gauge theory we compute the two-loop coefficient in the relation between the lattice bare coupling and the running coupling defined through the Schroedinger functional. This result is required to relate the latter to the…

High Energy Physics - Lattice · Physics 2009-10-22 Ulli Wolff

We prove that on any transitive graph $G$ with infinitely many ends, a self-avoiding walk of length $n$ is ballistic with extremely high probability, in the sense that there exist constants $c,t>0$ such that $\mathbb{P}_n(d_G(w_0,w_n)\geq…

Combinatorics · Mathematics 2026-01-14 Florian Lehner , Christian Lindorfer , Christoforos Panagiotis

A 1/L-expansion for percolation problems is proposed, where L is the lattice finite length. The square lattice with 27 different sizes L = 18, 22 ... 1594 is considered. Certain spanning probabilities were determined by Monte Carlo…

Statistical Mechanics · Physics 2007-05-23 P. M. C. de Oliveira , R. A. Nobrega , D. Stauffer

We study the random walk on dynamical percolation of $\mathbb{Z}^d$ (resp., the two-dimensional triangular lattice $\mathcal{T}$), where each edge (resp., each site) can be either open or closed, refreshing its status at rate $\mu\in…

Probability · Mathematics 2024-11-01 Chenlin Gu , Jianping Jiang , Yuval Peres , Zhan Shi , Hao Wu , Fan Yang

We build upon a recent theoretical breakthrough by employing novel algorithms to accurately compute the fractions $F_p$ of all closed walks on the infinite square lattice whose the last erased loop corresponds is any one of the $762, 207,…

Combinatorics · Mathematics 2026-04-28 Jean Fromentin , Pierre-Louis Giscard , Yohan Hosten

We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…

Combinatorics · Mathematics 2017-12-06 Daniel Heinlein , Sascha Kurz

The connective constant $\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. The relationship between connective constants and amenability is explored in the…

Group Theory · Mathematics 2015-11-25 Geoffrey R. Grimmett , Zhongyang Li

This paper is a sequel to Chaika and Krishnan [arXiv:1612.00434]. We again consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice Z^d. We assume that once walks meet, they…

Probability · Mathematics 2021-03-19 Jon Chaika , Arjun Krishnan

The connective constant $\mu(G)$ of a quasi-transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. We prove a locality theorem for connective constants, namely, that the connective…

Combinatorics · Mathematics 2018-08-21 Geoffrey R. Grimmett , Zhongyang Li

The Fisher transformation acts on cubic graphs by replacing each vertex by a triangle. We explore the action of the Fisher transformation on the set of self-avoiding walks of a cubic graph. Iteration of the transformation yields a sequence…

Combinatorics · Mathematics 2015-03-20 Geoffrey R. Grimmett , Zhongyang Li

We improve Luczak's upper bounds on the length of the longest cycle in the random graph G(n,M) in the "supercritical phase" where M=n/2+s and s=o(n) but n^{2/3}=o(s). The new upper bound is (6.958+o(1))s^2/n with probability 1-o(1) as n…

Combinatorics · Mathematics 2009-07-22 Graeme Kemkes , Nicholas Wormald

We consider the detailed structure of low energy excitations in the periodic spin-1/2 XXZ Heisenberg chain. By performing a perturbative calculation of the non-linear corrections to the Gaussian model, we determine the exact coefficients of…

Strongly Correlated Electrons · Physics 2010-10-20 Michael Bortz , Michael Karbach , Imke Schneider , Sebastian Eggert

We compute the running QCD coupling on the lattice by evaluating two-point and three-point off-shell gluon Green's functions in a fixed gauge and imposing non-perturbative renormalisation conditions on them. Our exploratory study is…

High Energy Physics - Lattice · Physics 2009-03-09 B. Alles , D. S. Henty , H. Panagopoulos , C. Parrinello , C. Pittori , D. G. Richards

We construct the two-sided infinite self-avoiding walk (SAW) on $\mathbb{Z}^d$ for $d\geq5$ and use it to prove pattern theorems for the self-avoiding walk. We show that infinite two-sided SAW is the infinite-shift limit of infinite…

Probability · Mathematics 2024-10-07 Maarten Markering

We determine the strong coupling constant $\alpha_s(M_Z)$ from the static QCD potential by matching a lattice result and a theoretical calculation. We use a new theoretical framework based on operator product expansion (OPE), where…

High Energy Physics - Phenomenology · Physics 2019-05-24 Hiromasa Takaura , Takashi Kaneko , Yuichiro Kiyo , Yukinari Sumino
‹ Prev 1 8 9 10 Next ›