Search arXivSearch

arXiv · math/0202025

Relaxation time of anisotropic simple exclusion processes and quantum Heisenberg models

Abstract

Motivated by an exact mapping between anisotropic half integer spin quantum Heisenberg models and asymmetric diffusions on the lattice, we consider an anisotropic simple exclusion process with $N$ particles in a rectangle of $\bbZ^2$. Every particle at row $h$ tries to jump to an arbitrary empty site at row $h\pm 1$ with rate $q^{\pm 1}$, where $q\in (0,1)$ is a measure of the drift driving the particles towards the bottom of the rectangle. We prove that the spectral gap of the generator is uniformly positive in $N$ and in the size of the rectangle. The proof is inspired by a recent interesting technique envisaged by E. Carlen, M.C. Carvalho and M. Loss to analyze the Kac model for the non linear Boltzmann equation. We then apply the result to prove precise upper and lower bounds on the energy gap for the spin--S, ${\rm S}\in \frac12\bbN$, XXZ chain and for the 111 interface of the spin--S XXZ Heisenberg model, thus generalizing previous results valid only for spin $\frac12$.

Explore related subjects

Keep this discovery

BibTeXRIS

Pietro Caputo, Fabio Martinelli. 2002-02-04. Relaxation time of anisotropic simple exclusion processes and quantum Heisenberg models. https://arxiv.org/abs/math/0202025

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