Decay of the remanent magnetization in the asymmetric spin chain

The dynamics of the one-dimensional spin glass with asymmetric interactions between neighboring spins is considered. We confine ourselves to discrete couplings with values ±J. We show that the algebraic decay of the remanent magnetization of the infinite ±J-spin chain at zero temperature is only valid for symmetric couplings. Our analytical investigations as well as computer simulations show stretched exponential decay for any finite concentration of antisymmetric bonds. Thus, the asymmetric ±J-spin chain shows an asymmetry-induced phase transition at zero temperature.     

Discrete and Continuous Time Modulated Random Walks with Heavy-Tailed Increments

We consider a modulated process S which, conditional on a background process X, has independent increments. Assuming that S drifts to −∞ and that its increments (jumps) are heavy-tailed (in a sense made precise in the paper), we exhibit natural conditions under which the asymptotics of the tail distribution of the overall maximum of S can be computed. We present results in discrete and in continuous time. In particular, in the absence of modulation, the process S in continuous time reduces to a Lévy process with heavy-tailed Lévy measure. A central point of the paper is that we make full use of the so-called “principle of a single big jump” in order to obtain both upper and lower bounds. Thus, the proofs are entirely probabilistic. The paper is motivated by queueing and Lévy stochastic networks.     

BERNOULLI CONVOLUTIONS ASSOCIATED WITH CERTAIN NON-PISOT NUMBERS

1　IntroductionForany 0 <λ <1 ,letνλ　denotethedistributionof ∞n=0 εnλn wherethecoefficientsεnareeither0or1 ,chosenindependentlywithprobability12 foreach .Itistheinfiniteconvo lutionproductofthedistributions 12 (δ0 +δλn) ,givingrisetotheterm“infiniteBernoulliconvolution”orsimply“Bernoulliconvolution” .TheBernoulliconvolutioncanbeexpressedasaself similarmeasureνλsatisfyingtheequationνλ =12 νλ φ- 10 + 12 νλ φ- 11,( 1 .1 )whereφ0 (x) =λxand φ1(x) =λx + 1 .Thisme…     

VECTOR-VALUED RANDOM POWER SERIES ON THE UNIT BALL OF C^n

In this article, the authors study the vector-valued random power series on the unit ball of Cn and get vector-valued Salem-Zygmund theorem for them by using martingale technique. Further, the relationships between vector-valued random power series and several function spaces are also studied.     

A new class of long-tailed pausing time densities for the CTRW

We present some asymptotic results for the family of pausing time densities having the asymptotic (t) property(t) [t ln¹⁺(t/T)]^–1. In particular, we show that for this class of pausing time densities the mean-squared displacement r ²(t) is asymptotically proportional to ln(t/T), and the asymptotic distribution of the displacement has a negative exponential form.     

On random walks arising in queueing systems: ergodicity and transience via quadratic forms as lyapounov functions — Part I

A simple and quite general approach is proposed to derive criteria for transience and ergodicity of a certain class of irreducibleN-dimensional Markov chains in ₊ ^N assuming a boundedness condition on the second moment of the jumps. The method consists in constructing convenient smooth supermartingales outside some compact set. The Lyapounov functions introduced belong to the set of quadratic forms in ₊ ^N and do not always have a definite sign. Existence and construction of these forms is shown to be basically equivalent to finding vectors satisfying a system of linear inequalities.Part I is restricted toN=2, in which case a complete characterization is obtained for the type of random walks analyzed by Malyshev and Mensikov, thus relaxing their condition of boundedness of the jumps. The motivation for this work is partly from a large class of queueing systems that give rise to random walks in ₊ ^N      

On the cover time of random walks on graphs

This article deals with random walks on arbitrary graphs. We consider the cover time of finite graphs. That is, we study the expected time needed for a random walk on a finite graph to visit every vertex at least once. We establish an upper bound ofO(n ²) for the expectation of the cover time for regular (or nearly regular) graphs. We prove a lower bound of (n logn) for the expected cover time for trees. We present examples showing all our bounds to be tight.Mike Saks was supported by NSF-DMS87-03541 and by AFOSR-0271. Jeff Kahn was supported by MCS-83-01867 and by AFOSR-0271.     

Solvable isotherms for a two-component system of charged rods on a line

The Coulomb system consisting of an equal number of positive and negative charged rods confined to a one-dimensional lattice is studied. The grand partition function can be calculated exactly at two values of the coupling constant=q ²/k _B T (q denoting the magnitude of the charges). The exact results lead to the conjecture that in the complex scaled fugacity plane, all the zeros of the grand partition function lie on the negative real axis for<2, on the point=–1 for=2, and on the unit circle for>2. In addition, for>4, we conjecture in general and prove at=4 that the zeros pinch the real axis in the thermodynamic limit, with an essential singularity in the pressure at the reduced density 1/2.     

Vicious random walkers in the limit of a large number of walkers

The vicious random walker problem on a line is studied in the limit of a large number of walkers. The multidimensional integral representing the probability that thep walkers will survive a timet (denotedP _t ^(p) ) is shown to be analogous to the partition function of a particular one-component Coulomb gas. By assuming the existence of the thermodynamic limit for the Coulomb gas, one can deduce asymptotic formulas forP _t ^(p) in the large-p, large-t limit. A straightforward analysis gives rigorous asymptotic formulas for the probability that after a timet the walkers are in their initial configuration (this event is termed a reunion). Consequently, asymptotic formulas for the conditional probability of a reunion, given that all walkers survive, are derived. Also, an asymptotic formula for the conditional probability density that any walker will arrive at a particular point in timet, given that allp walkers survive, is calculated in the limittp.     

Geometric critical exponent inequalities for general random cluster models

A set of new critical exponent inequalities,d(1 –1 /)2 –, dv(1 – 1/), andd> 1, is proved for a general class of random cluster models, which includes (independent or dependent) percolations, lattice animals (with any interactions), and various stochastic cluster growth models. The inequalities imply that the critical phenomena in the models are inevitably not mean-field-like in the dimensions one, two, and three.The present work was reported at the 56th Statistical Mechanics Meeting (Rutgers, December 1986).