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 procedure for measuring the flexibility of single wood-pulp fibres

A way of determining the flexibility of wood-pulp fibres is developed, which involves i) a precise measurement of the topology of single-fibres by using a confocal laser scanning microscope and ii) the measurement of the elastic modulus of the fibres by using a single-fibre fatigue cell. Reported in this paper are the initial results of tests carried out on black spruce fibres, which have been subjected to three different levels of mechanical refining energy, namely ∼1100, 2300, and 3500 kWh/t. It is found that the fibre flexibility rises significantly between the first and second energy levels, but it does not change to the same degree between the second and third ones. The described procedure of measuring the flexibility of fibres may be used to establish the appropriate refiner energy necessary for the production of a specific grade of paper. Russian translation published in Mekhanika Kompozitnykh Materialov, Vol. 42, No. 1, pp. 115–128, January–February, 2006.     

气密性碳涂覆光纤筛选强度与电阻关系研究

通过实验分析确立了把光纤电阻作为衡量气密性碳涂覆光纤通过２％应变筛选的过渡标准。要拉制２％应变筛选的碳涂覆光纤，其电阻值应小于３０ｋΩ／ｃｍ。     

Symmetric form of the Hudson-Parthasarathy stochastic equation

We prove that the Hudson-Parthasarathy equation corresponds, up to unitary equivalence, to the strong resolvent limit of Schrödinger Hamiltonians in Fock space and that the symmetric form of this equation corresponds to the weak limit of the Schrödinger Hamiltonians.Translated fromMatematicheskie Zametki, Vol. 60, No. 5, pp. 726–750, November, 1996.     

Functional Central Limit Theorems for Triangular Arrays of Function-Indexed Processes under Uniformly Integrable Entropy Conditions

Functional central limit theorems for triangular arrays of rowwise independent stochastic processes are established by a method replacing tail probabilities by expectations throughout. The main tool is a maximal inequality based on a preliminary version proved by P. Gaenssler and Th. Schlumprecht. Its essential refinement used here is achieved by an additional inequality due to M. Ledoux and M. Talagrand. The entropy condition emerging in our theorems was introduced by K. S. Alexander, whose functional central limit theorem for so-calledmeasure-like processeswill be also regained. Applications concern, in particular, so-calledrandom measure processeswhich include function-indexed empirical processes and partial-sum processes (with random or fixed locations). In this context, we obtain generalizations of results due to K. S. Alexander, M. A. Arcones, P. Gaenssler, and K. Ziegler. Further examples include nonparametric regression and intensity estimation for spatial Poisson processes.     

Kinetic limit of a conservative lattice gas dynamics showing long-range correlations

An anisotropic lattice gas dynamics is investigated for which particles on ^d jump to empty nearest neighbor sites with (fast) rate ^–2 in a specified direction and some particular configuration-dependent rates in the other directions. The model is translation and reflection invariant and is particle conserving. The space coordinate in the fast-rate direction is rescaled by ^–1. It follows that the density field converges in probability, as 0, to the corresponding solution of a nonlinear diffusion-type equation. The microscopic fluctuations about the deterministic macroscopic evolution are determined explicitly and it is found that the stationary fluctuations decay via a power law (1/r ^d ) with the direction dependence of a quadrupole field.     

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.