Search arXivSearch

arXiv · 2211.14934

From logarithmic delocalization of the six-vertex height function under sloped boundary conditions to weakened crossing probability estimates for the Ashkin-Teller, generalized random-cluster, and $(q_σ,q_τ)$-cubic models

Abstract

To obtain Russo-Seymour-Welsh estimates for the height function of the six-vertex model under sloped boundary conditions, which can be leveraged to demonstrate that the height function logarithmically delocalizes under a broader class of boundary conditions, we formulate crossing probability estimates in strips of the square lattice and the cylinder, for parameters satisfying $a\equiv b$, $c \in [1,2]$, and $\mathrm{max} \{ a , b \} \leq c$, in which each of the first two conditions respectively relate to invariance under vertical and diagonal reflections enforced through the symmetry $σξ\geq -ξ$ for domains in strips of the square lattice, and satisfaction of FKG, for the height function and for its absolute value. To determine whether arguments for estimating crossing probabilities of the height function for flat boundary conditions from a recent work due to Duminil-Copin, Karila, Manolescu, and Oulamara remain applicable for sloped boundary conditions, from the set of possible slopes given by the interior of the set of rational points from $[-1,1] \times [-1,1]$, we analyze sloped Gibbs states, which do not have infinitely many disjointly oriented circuits. In comparison to Russo-Seymour-Welsh arguments for flat boundary conditions, arguments for sloped boundary conditions present additional complications for both planar and cylindrical settings, in which crossing events that are considered in the strip, and then extended to the annulus and cylinder, must be maintained across rectangles of large aspect ratio, in spite of the fact that some proportion of faces within the strip freeze with positive probability.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pete Rigas. 2024-08-08. From logarithmic delocalization of the six-vertex height function under sloped boundary conditions to weakened crossing probability estimates for the Ashkin-Teller, generalized random-cluster, and $(q_σ,q_τ)$-cubic models. https://arxiv.org/abs/2211.14934

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

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR