SearcharxivSearch

arXiv · math/0507392

Conditional Association and Spin Systems

Abstract

A 1977 theorem of T. Harris states that an attractive spin system preserves the class of associated probability measures. We study analogues of this result for measures that satisfy various conditional positive correlations properties. In particular, we show that a spin system preserves measures satisfying the FKG lattice condition (essentially) if and only if distinct spins flip independently. The downward FKG property, which has been useful recently in the study of the contact process, lies between the properties of lattice FKG and association. We prove that this property is preserved by a spin system if the death rates are constant and the birth rates are additive (e.g., the contact process), and prove a partial converse to this statement. Finally, we introduce a new property, which we call downward conditional association, which lies between the FKG lattice condition and downward FKG, and find essentially necessary and sufficient conditions for this property to be preserved by a spin system. This suggests that the latter property may be more natural than the downward FKG property.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas M. Liggett. 2005-07-19. Conditional Association and Spin Systems. https://arxiv.org/abs/math/0507392

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