Recursive events in random sequences

Let ω be a Kolmogorov–Chaitin random sequence with ω_{1: n} denoting the first n digits of ω. Let P be a recursive predicate defined on all finite binary strings such that the Lebesgue measure of the set {ω|∃nP(ω_{1: n} )} is a computable real α. Roughly, P holds with computable probability for a random infinite sequence. Then there is an algorithm which on input indices for any such P and α finds an n such that P holds within the first n digits of ω or not in ω at all. We apply the result to the halting probability Ω and show that various generalizations of the result fail. Received: 1 December 1998 / Published online: 3 October 2001     

Measure concentration for a class of random processes

Summary.   Let X={X _i } _{i =−∞} ^∞ be a stationary random process with a countable alphabet and distribution q. Let q ^∞(·|x _{− k} ⁰) denote the conditional distribution of X ^∞=(X ₁,X ₂,…,X _n ,…) given the k-length past:

Anisotropic branching random walks on homogeneous trees

Symmetric branching random walk on a homogeneous tree exhibits a weak survival phase: For parameter values in a certain interval, the population survives forever with positive probability, but, with probability one, eventually vacates every finite subset of the tree. In this phase, particle trails must converge to the geometric boundaryΩ of the tree. The random subset Λ of the boundary consisting of all ends of the tree in which the population survives, called the limit set of the process, is shown to have Hausdorff dimension no larger than one half the Hausdorff dimension of the entire geometric boundary. Moreover, there is strict inequality at the phase separation point between weak and strong survival except when the branching random walk is isotropic. It is further shown that in all cases there is a distinguished probability measure μ supported by Ω such that the Hausdorff dimension of Λ∩Ω_μ, where Ω_μ is the set of μ-generic points of Ω, converges to one half the Hausdorff dimension of Ω_μ at the phase separation point. Exact formulas are obtained for the Hausdorff dimensions of Λ and Λ∩Ω_μ, and it is shown that the log Hausdorff dimension of Λ has critical exponent 1/2 at the phase separation point. Received: 30 June 1998 / Revised version: 10 March 1999     

Almost-sure central limit theorem for a Markov model of random walk in dynamical random environment

Summary We consider a model of random walk on ℤ^ν, ν≥2, in a dynamical random environment described by a field ξ={ξ _t (x): (t,x)∈ℤ^ν+1}. The random walk transition probabilities are taken as P(X _{t +1}= y|X _t = x,ξ _t =η) =P ₀( y−x)+ c(y−x;η(x)). We assume that the variables {ξ _t (x):(t,x) ∈ℤ^ν+1} are i.i.d., that both P ₀(u) and c(u;s) are finite range in u, and that the random term c(u;·) is small and with zero average. We prove that the C.L.T. holds almost-surely, with the same parameters as for P ₀, for all ν≥2. For ν≥3 there is a finite random (i.e., dependent on ξ) correction to the average of X _t , and there is a corresponding random correction of order to the C.L.T.. For ν≥5 there is a finite random correction to the covariance matrix of X _t and a corresponding correction of order to the C.L.T.. Proofs are based on some new L ^p estimates for a class of functionals of the field. Received: 4 January 1996/In revised form: 26 May 1997     

Vague convergence of sums of independent random variables

A sequence (μ _n) of probability measures on the real line is said to converge vaguely to a measureμ if∫ fdμ _n →∫ fdμ for every continuous functionf withcompact support. In this paper one investigates problems analogous to the classical central limit problem under vague convergence. Let ‖μ‖ denote the total mass ofμ andδ ₀ denote the probability measure concentrated in the origin. For the theory of infinitesimal triangular arrays it is true in the present context, as it is in the classical one, that all obtainable limit laws are limits of sequences of infinitely divisible probability laws. However, unlike the classical situation, the class of infinitely divisible laws is not closed under vague convergence. It is shown that for every probability measureμ there is a closed interval [0,λ], [0,e ⁻¹] ⊂ [0,λ] ⊂ [0, 1], such thatβμ is attainable as a limit of infinitely divisible probability laws iffβ ε [0,λ]. In the independent identically distributed case, it is shown that if (x ₁ + ... +x _n)/a _n, a_n → ∞, converges vaguely toμ with 0<‖μ‖<1, thenμ=‖μ‖δ ₀. If furthermore the ratiosa _n+1/a _n are bounded above and below by positive numbers, thenL(x)=P[|X ₁|>x] is a slowly varying function ofx. Conversely, ifL(x) is slowly varying, then for everyβ ε (0, 1) one can choosea _n → ∞ so that the limit measure=βδ ₀. To the memory of Shlomo Horowitz This research was partially supported by the National Science Foundation.     

Entropy and<Emphasis Type="Italic">σ</Emphasis>-algebra equivalence of certain random walks on random sceneries

LetX=X ₀,X ₁,…be a stationary sequence of random variables defining a sequence space Σ with shift mapσ and let (T _t, Ω) be an ergodic flow. Then the endomorphismT _X(x, ω)=(σ(x),T _{x 0}(ω)) is known as a random walk on a random scenery. In [4], Heicklen, Hoffman and Rudolph proved that within the class of random walks on random sceneries whereX is an i.i.d. sequence of Bernoulli-(1/2, 1/2) random variables, the entropy ofT _t is an isomorphism invariant. This paper extends this result to a more general class of random walks, which proves the existence of an uncountable family of smooth maps on a single manifold, no two of which are measurably isomorphic. This research was sustained in part by fellowship support from the National Physical Science Consortium and the National Security Agency.     

Trinomial random walk with one or two imperfect absorbing barriers

Trinomial random walk, with one or two barriers, on the non-negative integers is discussed. At the barriers, the particle is either annihilated or reflects back to the system with respective probabilities 1 − ρ, ρ at the origin and 1 − ω, ω at L, 0 ≤ ρ,ω ≤ 1. Theoretical formulae are given for the probability distribution, its generating function as well as the mean of the time taken before absorption. In the one-boundary case, very qualitatively different asymptotic forms for the result, depending on the relationship between transition probabilities and the annihilation probability, are obtained.      

Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent

Regard an element of the set of ranked discrete distributions Δ := {(x ₁, x ₂,…):x ₁≥x ₂≥…≥ 0, ∑ _i x _i = 1} as a fragmentation of unit mass into clusters of masses x _i . The additive coalescent is the Δ-valued Markov process in which pairs of clusters of masses {x _i , x _j } merge into a cluster of mass x _i + x _j at rate x _i + x _j . Aldous and Pitman (1998) showed that a version of this process starting from time −∞ with infinitesimally small clusters can be constructed from the Brownian continuum random tree of Aldous (1991, 1993) by Poisson splitting along the skeleton of the tree. In this paper it is shown that the general such process may be constructed analogously from a new family of inhomogeneous continuum random trees. Received: 6 October 1998 / Revised version: 16 May 1999 / Published online: 20 October 2000     

The relation of dimension,entropy and Lyapunov exponent in random case

We consider random systems generated by two-sided compositions of random surface diffeomorphisms,together with an ergodic Borel probability measure μ.Let D(μω)be its dimension of the sample measure,then we prove a formula relating D(μω)to the entropy and Lyapunov exponents of the random system,where D(μω)is dimHμω,-/dinBμω,or-/dimBμω.     

Higher order Riesz transforms associated with Bessel operators

In this paper we investigate Riesz transforms R _μ ^(k) of order k≥1 related to the Bessel operator Δ_μ f(x)=-f”(x)-((2μ+1)/x)f’(x) and extend the results of Muckenhoupt and Stein for the conjugate Hankel transform (a Riesz transform of order one). We obtain that for every k≥1, R _μ ^(k) is a principal value operator of strong type (p,p), p∈(1,∞), and weak type (1,1) with respect to the measure dλ(x)=x ^2μ+1  dx in (0,∞). We also characterize the class of weights ω on (0,∞) for which R _μ ^(k) maps L ^p (ω) into itself and L ¹(ω) into L ^1,∞(ω) boundedly. This class of weights is wider than the Muckenhoupt class of weights for the doubling measure dλ. These weighted results extend the ones obtained by Andersen and Kerman.     

A quantum spin system with random interactions I

We study a quantum spin glass as a quantum spin system with random interactions and establish the existence of a family of evolution groups {τ_t(ω)}_ω∈/Ω of the spin system. The notion of ergodicity of a measure preserving group of automorphisms of the probability space Ω, is used to prove the almost sure independence of the Arveson spectrum Sp(τ(ω)) of τ_t(ε). As a consequence, for any family of (τ(ω),β) — KMS states {ρ(ω)}, the spectrum of the generator of the group of unitaries which implement τ(ω) in the GNS representation is also almost surely independent of ω.     

Asymptotics of random sums of negatively dependent random variables in the presence of dominatedly varying tails

Let X ₁ , X ₂ , . . . be a sequence of negatively dependent and identically distributed random variables, and let N be a counting random variable independent of X _i ’s. In this paper, we study the asymptotics for the tail probability of the random sum S_N = ?_{k = 1}^N X_k {S_N} = \sum\nolimits_{k = 1}^N {{X_k}} in the presence of heavy tails. We consider the following three cases: (i) P(N > x) = o(P(X ₁  > x)), and the distribution function (d.f.) of X ₁ is dominatedly varying; (ii) P(X ₁  > x) = o(P(N > x)), and the d.f. of N is dominatedly varying; (iii) the tails of X ₁ and N are asymptotically comparable and dominatedly varying.     

Spectre de l'opérateur de transfert en dimension 1

We study spectral properties of a transfer operator ℳΦ(x)=∑_ω g _ω(x)Φ(ψ_ω x) acting on functions of bounded variation. Using a symmetrical integral, we first obtain bounds on its spectral and essential spectral radii. We then consider the dynamical determinant Det^#(Id +zℳ). Our main theorem generalizes to discontinuous weights the result of Baladi and Ruelle (for continuous weights) on the link between zeroes of the sharp determinant and eigenvalues of the transfer operator. The proof is based on regularizing the weights and uses a (new) spectral result giving the surjectivity of some applications between eigenspaces of operators. Received: 8 May 2001     

APPROXIMATION OF A KIND OF NEVAI-DURRMEYER OPERATORS IN Lω^p SPACES

The present paper introduces a kind of Nevai-Durrmeyer operators which can be used to approximate functions in Lω^p, spaces with the weight ω（x）=1/√（1-x^2） and the approximate rate is also estimated.     

Stability of Standing Waves for Nonlinear Schrödinger Equations with Inhomogeneous Nonlinearities

The effect of inhomogeneity of nonlinear medium is discussed concerning the stability of standing waves e^{i ω t}ϕ_ω(x) for a nonlinear Schr?dinger equation with an inhomogeneous nonlinearity V (x)|u|^{p − 1}u, where V (x) is proportional to the electron density. Here, ω > 0 and ϕ_ω(x) is a ground state of the stationary problem. When V (x) behaves like |x|^−b at infinity, where 0 < b < 2, we show that e^{i ω t}ϕ_ω(x) is stable for p < 1 + (4 − 2b)/n and sufficiently small ω > 0. The main point of this paper is to analyze the linearized operator at standing wave solution for the case of V (x) = |x|^−b. Then, this analysis yields a stability result for the case of more general, inhomogeneous V (x) by a certain perturbation method. Communicated by Bernard Helffer submitted 14/07/04, accepted 28/02/05     

The limiting distribution of the trace of a random plane partition

We study the asymptotic behaviour of the trace (the sum of the diagonal parts) τ _n = τ _n (ω) of a plane partition ω of the positive integer n, assuming that ω is chosen uniformly at random from the set of all such partitions. We prove that (τ _n − c ₀ n ^2/3)/c ₁ n ^1/3 log^1/2 n converges weakly, as n → ∞, to the standard normal distribution, where c ₀ = ζ(2)/ [2ζ(3)]^2/3, c ₁ = √(1/3/) [2ζ(3)]^1/3 and ζ(s) = Σ _j=1^∞ j ^−s . Partial support given by the National Science Fund of the Bulgarian Ministry of Education and Science, grant No. VU-MI-105/2005.     

Algebraic Polynomials with Non-identical Random Coefficients

The asymptotic estimate for the expected number of real zeros of a random algebraic polynomial is known. The identical random coefficients a_j(ω) are normally distributed defined on a probability space , ω ∈Ω. The estimate for the expected number of zeros of the derivative of the above polynomial with respect to x is also known, which gives the expected number of maxima and minima of Q_n(x, ω). In this paper we provide the asymptotic value for the expected number of zeros of the integration of Q_n(x,ω) with respect to x. We give the geometric interpretation of our results and discuss the difficulties which arise when we consider a similar problem for the case of .     

Reconstructing a random scenery observed with random errors along a random walk path

 We show that an i.i.d. uniformly colored scenery on ℤ observed along a random walk path with bounded jumps can still be reconstructed if there are some errors in the observations. We assume the random walk is recurrent and can reach every point with positive probability. At time k, the random walker observes the color at her present location with probability 1−δ and an error Y _k with probability δ. The errors Y _k , k≥0, are assumed to be stationary and ergodic and independent of scenery and random walk. If the number of colors is strictly larger than the number of possible jumps for the random walk and δ is sufficiently small, then almost all sceneries can be almost surely reconstructed up to translations and reflections. Received: 3 February 2002 / Revised version: 15 January 2003 Published online: 28 March 2003 Mathematics Subject Classification (2000): 60K37, 60G50 Key words or phrases:Scenery reconstruction – Random walk – Coin tossing problems     

On local frequencies related to farey fractions

LetP ₁ andP ₂ be two sets of prime numbers and let ω(m,P_i)=#{p: p/m, pεP_i} (i=1,2) be two related additive functions ofm. For an irreducible positive fractionm/n, defineh(m/n)=ω(m, P ₁)+ω(n, P₂). In this paper the local frequenciesv _x{h(m/n)=s}=#{m/n ∈ F_x:h(m/n)=s}/#F_x are considered, whereF _x denotes the classical Farey series. Using the mean-value theorem for multiplicative functions of rational argument, a local limit theorem forv _x{h(m/n)=s} is proved. Research supported by the Lithuanian State Science and Studies Foundation. Translated from Lietuvos Matematikos Rinkinys, Vol. 40, No. 1, pp. 113–131, January–March, 2000. Translated by V. Stakènas