On three conjectures by K. E. Shuler

Some fifteen years ago, Shuler formulated three conjectures relating to the large-time asymptotic properties of a nearest-neighbor random walk on ² that is allowed to make horizontal steps everywhere but vertical steps only on a random fraction of the columns. We give a proof of his conjectures for the situation where the column distribution is stationary and satisfies a certain mixing codition. We also prove a strong form of scaling to anisotropic Brownian motion as well as a local limit theorem. The main ingredient of the proofs is a large-deviation estimate for the number of visits to a random set made by a simple random walk on . We briefly discuss extensions to higher dimension and to other types of random walk.Dedicated to Prof. K. E. Shuler on the occasion of his 70th birthday, celebrated at a Symposium in his honor on July 13, 1992, at the University of California at San Diego, La Jolla, California.     

Polymer diffusion in quenched disorder: A renormalization group approach

We study the diffusion of polymers through quenched short-range correlated random media by renormalization group (RG) methods, which allow us to derive universal predictions in the limit of long chains and weak disorder. We take local quenched random potentials with second momentv and the excluded-volume interactionu of the chain segments into account. We show that our model contains the relevant features of polymer diffusion in random media in the RG sense if we focus on the local entropic effects rather than on the topological constraints of a quenched random medium. The dynamic generating functional and the general structure of its perturbation expansion inu andv are derived. The distribution functions for the center-of-mass motion and the internal modes of one chain and for the correlation of the center of mass motions of two chains are calculated to one-loop order. The results allow for sufficient cross-checks to have trust in the one-loop renormalizability of the model. The general structure as well as the one-loop results of the integrated RG flow of the parameters are discussed. Universal results can be found for the effective static interactionwu–v0 and for small effective disorder coupling on the intermediate length scalel. As a first physical prediction from our analysis, we determine the general nonlinear scaling form of the chain diffusion constant and evaluate it explicitly as for .     

Survival probability in one dimension for theA+B→B reaction with hard-core repulsion

We study the effect of hard-core repulsion (known as the bus effect) betweenB particles on the reaction-diffusion systemA+BB in the continuous-time random walk model in one dimension with theA particles stationary. We show rigorously that the survival probability of theA particles is asymptotically bounded asC ₁lim _t{[–logS(t)]/t ^0.5}C ₂, whereC ₁ andC ₂ are constants. We also do simulations to confirm our results.     

The covariance matrix of the Potts model: A random cluster analysis

We consider the covariance matrix,G ^mm =q ²<(_x,m);(_y,m)>, of thed-dimensionalq-states Potts model, rewriting it in the random cluster representation of Fortuin and Kasteleyn. In any of theq ordered phases, we identify the eigenvalues of this matrix both in terms of representations of the unbroken symmetry group of the model and in terms of random cluster connectivities and covariances, thereby attributing algebraic significance to these stochastic geometric quantities. We also show that the correlation length corresponding to the decay rate of one of the eigenvalues is the same as the inverse decay rate of the diameter of finite clusers. For dimensiond=2, we show that this correlation length and the correlation length of the two-point function with free boundary conditions at the corresponding dual temperature are equal up to a factor of two. For systems with first-order transitions, this relation helps to resolve certain inconsistencies between recent exact and numerical work on correlation lengths at the self-dual point _o. For systems with second order transitions, this relation implies the equality of the correlation length exponents from above and below threshold, as well as an amplitude ratio of two. In the course of proving the above results, we establish several properties of independent interest, including left continuity of the inverse correlation length with free boundary conditions and upper semicontinuity of the decay rate for finite clusters in all dimensions, and left continuity of the two-dimensional free boundary condition percolation probability at _o. We also introduce DLR equations for the random cluster model and use them to establish ergodicity of the free measure. In order to prove these results, we introduce a new class of events which we call decoupling events and two inequalities for these events. The first is similar to the FKG inequality, but holds for events which are neither increasing nor decreasing; the second is similar to the van den Berg-Kesten inequality in standard percolation. Both inequalities hold for an arbitrary FKG measure.     

A strong limit theorem for generalized Cantor-like random sequences

ＡＳＴＲＯＮＧＬＩＭＩＴＴＨＥＯＲＥＭＦＯＲＧＥＮＥＲＡＬＩＺＥＤＣＡＮＴＯＲ－ＬＩＫＥ　ＲＡＮＤＯＭ　ＳＥＱＵＥＮＣＥＳＬＩＵＷＥＮ（刘文）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓａｎｄＰｈｙｓｉｃｓ,ＨｅｂｅｉＵｎｉｖｅｒｓｉｔｙｏｆＴｅ...     

Series representation for semistable laws and their domains of semistable attraction

If the centered and normalized partial sums of an i.i.d. sequence of random variables converge in distribution to a nondegenerate limit then we say that this sequence belongs to the domain of attraction of the necessarily stable limit. If we consider only the partial sums which terminate atk _n wherek _n+1 ck _n then the sequence belongs to the domain of semistable attraction of the necessarily semistable limit. In this paper, we consider the case where the limiting distribution is nonnormal. We obtain a series representation for the partial sums which converges almost surely. This representation is based on the order statistics, and utilizes the Poisson process. Almost sure convergence is a useful technical device, as we illustrate with a number of applications.This research was supported by a research scholarship from the Deutsche Forschungsgemeinschaft (DFG).     

Wiener's test for space-time random walks and its applications

This paper establishes a criterion for whether a -dimensional random walk on the integer lattice visits a space-time subset infinitely often or not. It is a precise analogue of Wiener's test for regularity of a boundary point with respect to the classical Dirichlet problem. The test obtained is applied to strengthen the harder half of Kolmogorov's test for the random walk.

     

Steady flux in a continuous-space Sinai chain

We examine the steady-state flux of particles diffusing in a one-dimensional finite chain with Sinai-type disorder, i.e., the system in which in addition to the thermal noise, particles are subject to a stationary random-correlated in space Gaussian force. For this model we calculate the disorder average (over configurations of the random force) flux exactly for arbitrary values of system's parameters, such as chain lengthN, strength of the force, and temperature. We prove that within the limitN1 the average flux decreases withN as J(N)=C/N and thus confirm our recent predictions that the flux in the discrete-space Sinai model is anomalous.     

Random walk on distant mesh points Monte Carlo methods

A new technique for obtaining Monte Carlo algorithms based on the Markov chains with a finite number of states is suggested. Instead of the classical random walk on neighboring mesh points, a general way of constructing Monte Carlo algorithms that could be called random walk on distant mesh points is considered. It is applied to solve boundary value problems. The numerical examples indicate that the new methods are less laborious and therefore more efficient.In conclusion, we mention that all Monte Carlo algorithms are parallel and could be easily realized on parallel computers.     

Rigorous results on the thermodynamics of the dilute Hopfield model

We study the Hopfield model of an autoassociative memory on a random graph onN vertices where the probability of two vertices being joined by a link isp(N). Assuming thatp(N) goes to zero more slowly thanO(1/N), we prove the following results: (1) If the number of stored patternsm(N) is small enough such thatm(N)/Np(N) 0, asN, then the free energy of this model converges, upon proper rescaling, to that of the standard Curie-Weiss model, for almost all choices of the random graph and the random patterns. (2) If in additionm(N) < ln N/ln 2, we prove that there exists, forT< 1, a Gibbs measure associated to each original pattern, whereas for higher temperatures the Gibbs measure is unique. The basic technical result in the proofs is a uniform bound on the difference between the Hamiltonian on a random graph and its mean value.