SearcharxivSearch

arXiv · 2410.01507

Two-sided infinite self-avoiding walk in high dimensions

Abstract

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 one-sided SAW and the infinite-size limit of finite two-sided SAW. We then prove that for every pattern $\zeta$, the fraction of times $\zeta$ occurs in the SAW converges to the probability that the two-sided infinite SAW starts with $\zeta$. The convergence is in probability for the finite SAW and almost surely for the infinite SAW. Along the way, we show that infinite SAW is ergodic using a coupling technique. At the end of the paper, we pose a conjecture regarding the existence of infinite SAW in low dimensions. We show that this conjecture is true in high dimensions, thus giving a new proof for the existence of infinite SAW for $d\geq5$. The proofs in this paper rely only on the asymptotics for the number of self-avoiding paths and the SAW two-point function. Although these results were shown by Hara and Slade using the lace expansion, the proofs in this paper do not use the lace expansion and might be adapted to prove existence and ergodicity of other infinite high-dimensional lattice models.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maarten Markering. 2024-10-02. Two-sided infinite self-avoiding walk in high dimensions. https://arxiv.org/abs/2410.01507

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR