A non-Markovian birth process with logarithmic growth

1975 ◽  
Vol 12 (04) ◽  
pp. 673-683
Author(s):  
G. R. Grimmett

I show that the sumof independent random variables converges in distribution when suitably normalised, so long as theXksatisfy the following two conditions:μ(n)= E |Xn|is comparable withE|Sn| for largen,andXk/μ(k) converges in distribution. Also I consider the associated birth processX(t) = max{n:Sn≦t} when eachXkis positive, and I show that there exists a continuous increasing functionv(t) such thatfor some variableYwith specified distribution, and for almost allu. The functionv, satisfiesv(t) =A(1 +o(t)) logt. The Markovian birth process with parameters λn= λn, where 0 < λ < 1, is an example of such a process.

1975 ◽  
Vol 12 (4) ◽  
pp. 673-683 ◽  
Author(s):  
G. R. Grimmett

I show that the sum of independent random variables converges in distribution when suitably normalised, so long as the Xk satisfy the following two conditions: μ(n)= E |Xn| is comparable with E |Sn| for large n, and Xk/μ(k) converges in distribution. Also I consider the associated birth process X(t) = max{n: Sn ≦ t} when each Xk is positive, and I show that there exists a continuous increasing function v(t) such that for some variable Y with specified distribution, and for almost all u. The function v, satisfies v (t) = A (1 + o (t)) log t. The Markovian birth process with parameters λn = λn, where 0 < λ < 1, is an example of such a process.


Author(s):  
Matthias Jakob ◽  
A. C. Offord

SynopsisThis is a study of the family of power series where Σ αnZn has unit radius of convergence and the εn are independent random variables taking the values ±1 with equal probability. It is shown that ifthen almost all these power series take every complex value infinitely often in the unit disk.


1995 ◽  
Vol 118 (3) ◽  
pp. 527-542 ◽  
Author(s):  
A. C. Offord

SummaryThis is a study of entire functions whose coefficients are independent random variables. When the space of such functions is symmetric it is shown that independence of the coefficients alone is sufficient to ensure that almost all such functions will, for large z, be large except in certain small neighbourhoods of the zeros called pits. In each pit the function takes every not too large value and these pits have a certain uniform distribution.


1968 ◽  
Vol 64 (2) ◽  
pp. 485-488 ◽  
Author(s):  
V. K. Rohatgi

Let {Xn: n ≥ 1} be a sequence of independent random variables and write Suppose that the random vairables Xn are uniformly bounded by a random variable X in the sense thatSet qn(x) = Pr(|Xn| > x) and q(x) = Pr(|Xn| > x). If qn ≤ q and E|X|r < ∞ with 0 < r < 2 then we have (see Loève(4), 242)where ak = 0, if 0 < r < 1, and = EXk if 1 ≤ r < 2 and ‘a.s.’ stands for almost sure convergence. the purpose of this paper is to study the rates of convergence ofto zero for arbitrary ε > 0. We shall extend to the present context, results of (3) where the case of identically distributed random variables was treated. The techniques used here are strongly related to those of (3).


1992 ◽  
Vol 112 (3) ◽  
pp. 613-629 ◽  
Author(s):  
Barbara Szyszkowicz

Let S(N(t)) be defined bywhere {N(t), t ≥ 0} is a Poisson process with intensity parameter 1/μ > 0 and {Xi i ≥ 1} is a family of independent random variables which are also independent of {N(t), t ≥ 0}.


1970 ◽  
Vol 7 (01) ◽  
pp. 89-98
Author(s):  
John Lamperti

In the first part of this paper, we will consider a class of Markov chains on the non-negative integers which resemble the Galton-Watson branching process, but with one major difference. If there are k individuals in the nth “generation”, and are independent random variables representing their respective numbers of offspring, then the (n + 1)th generation will contain max individuals rather than as in the branching case. Equivalently, the transition matrices Pij of the chains we will study are to be of the form where F(.) is the probability distribution function of a non-negative, integervalued random variable. The right-hand side of (1) is thus the probability that the maximum of i independent random variables distributed by F has the value j. Such a chain will be called a “maximal branching process”.


1963 ◽  
Vol 59 (2) ◽  
pp. 411-416
Author(s):  
G. De Barra ◽  
N. B. Slater

Let Xν, ν= l, 2, …, n be n independent random variables in k-dimensional (real) Euclidean space Rk, which have, for each ν, finite fourth moments β4ii = l,…, k. In the case when the Xν are identically distributed, have zero means, and unit covariance matrices, Esseen(1) has discussed the rate of convergence of the distribution of the sumsIf denotes the projection of on the ith coordinate axis, Esseen proves that ifand ψ(a) denotes the corresponding normal (radial) distribution function of the same first and second moments as μn(a), thenwhere and C is a constant depending only on k. (C, without a subscript, will denote everywhere a constant depending only on k.)


1980 ◽  
Vol 87 (1) ◽  
pp. 179-187 ◽  
Author(s):  
Sujit K. Basu ◽  
Makoto Maejima

AbstractLet {Xn} be a sequence of independent random variables each having a common d.f. V1. Suppose that V1 belongs to the domain of normal attraction of a stable d.f. V0 of index α 0 ≤ α ≤ 2. Here we prove that, if the c.f. of X1 is absolutely integrable in rth power for some integer r > 1, then for all large n the d.f. of the normalized sum Zn of X1, X2, …, Xn is absolutely continuous with a p.d.f. vn such thatas n → ∞, where v0 is the p.d.f. of Vo.


1971 ◽  
Vol 8 (01) ◽  
pp. 52-59 ◽  
Author(s):  
C. C. Heyde

It is possible to interpret the classical central limit theorem for sums of independent random variables as a convergence rate result for the law of large numbers. For example, ifXi, i= 1, 2, 3, ··· are independent and identically distributed random variables withEXi=μ, varXi= σ2&lt; ∞ andthen the central limit theorem can be written in the formThis provides information on the rate of convergence in the strong lawas. (“a.s.” denotes almost sure convergence.) It is our object in this paper to discuss analogues for the super-critical Galton-Watson process.


Sign in / Sign up

Export Citation Format

Share Document