SearcharxivSearch

arXiv · 0704.3156

How to clean a dirty floor: Probabilistic potential theory and the Dobrushin uniqueness theorem

Abstract

Motivated by the Dobrushin uniqueness theorem in statistical mechanics, we consider the following situation: Let αbe a nonnegative matrix over a finite or countably infinite index set X, and define the "cleaning operators" β_h = I_{1-h} + I_h αfor h: X \to [0,1] (here I_f denotes the diagonal matrix with entries f). We ask: For which "cleaning sequences" h_1, h_2, ... do we have c β_{h_1} ... β_{h_n} \to 0 for a suitable class of "dirt vectors" c? We show, under a modest condition on α, that this occurs whenever \sum_i h_i = \infty everywhere on X. More generally, we analyze the cleaning of subsets Λ\subseteq X and the final distribution of dirt on the complement of Λ. We show that when supp(h_i) \subseteq Λwith \sum_i h_i = \infty everywhere on Λ, the operators β_{h_1} ... β_{h_n} converge as n \to \infty to the "balayage operator" Π_Λ= \sum_{k=0}^\infty (I_Λα)^k I_{Λ^c). These results are obtained in two ways: by a fairly simple matrix formalism, and by a more powerful tree formalism that corresponds to working with formal power series in which the matrix elements of αare treated as noncommuting indeterminates.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thierry de la Rue, Roberto Fernandez, Alan D. Sokal. 2007-04-24. How to clean a dirty floor: Probabilistic potential theory and the Dobrushin uniqueness theorem. https://arxiv.org/abs/0704.3156

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