On the first birth and the last death in a generation in a multi-type Markov branching process

In a multi-type continuous time Markov branching process the asymptotic distribution of the first birth in and the last death (extinction) of the kth generation can be determined from the asymptotic behavior of the probability generating function of the vector Z(^k)(t), the size of the kth generation at time t, as t tends to zero or as t tends to infinity, respectively. Apart from an appropriate transformation of the time scale, for a large initial population the generations emerge according to an independent sum of compound multi-dimensional Poisson processes and become extinct like a vector of independent reversed Poisson processes. In the first birth case the results also hold for a multi-type Bellman-Harris process if the life span distributions are differentiable at zero.     

On a new class of multiplicative pseudo-random number generators

In the computing literature, there are few detailed analytical studies of the global statistical characteristics of a class of multiplicative pseudo-random number generators.We comment briefly on normal numbers and study analytically the approximately uniform discrete distribution or (j,)-normality in the sense of Besicovitch for complete periods of fractional parts {x _{0 1} ⁱ /p} on [0, 1] fori=0, 1,..., (p–1)p^–1–1, i.e. in current terminology, generators given byx _{n+1 1} x _n mod p wheren=0, 1,..., (p–1)p ^–1–1,p is any odd prime, (x ₀,p)=1, ₁ is a primitive root modp ², and 1 is any positive integer.We derive the expectationsE(X, ),E(X ², ),E(X _nX_n+k); the varianceV(X, ), and the serial correlation coefficient k. By means of Dedekind sums and some results of H. Rademacher, we investigate the asymptotic properties of k for various lagsk and integers 1 and give numerical illustrations. For the frequently used case =1, we find comparable results to estimates of Coveyou and Jansson as well as a mathematical demonstration of a so-called rule of thumb related to the choice of ₁ for small k.Due to the number of parameters in this class of generators, it may be possible to obtain increased control over the statistical behavior of these pseudo-random sequences both analytically as well as computationally.     

Computational algorithm for a distributed optimal control problem of parabolic type with terminal inequality constraints

A computational algorithm for optimal control problems with control and terminal inequality constraints involving first boundary-value problems of parabolic type is presented. The convergence properties are also studied.This work, which was partly supported by the Australian Research Grants Committee, was done during the period when Z. S. Wu was an Honorary Visiting Fellow in the School of Mathematics at the University of New South Wales, Australia.     

Stochastic solution of the linearized Boltzmann equation

For the linearized Boltzmann equation with finite cross section, the solution is represented as an integral over the paths of a Markov jump process. The integral is only shown to converge conditionally, where the limiting process is defined by an increasing sequence of stopping times. The notion of local martingale plays an important role. A number of related kinetic models are also mentioned.Supported by NSF Grant GP 28576.     

Entrance laws for Feller diffusions on (0, ∞) and Doob's h-path transformation

We consider the problem of constructing entrance laws for Feller diffusions on the state space (0, ∞). Our method, based on Feller-McKean theory of one-dimensional diffusions, gives an analytic expression for the entrance density in terms of transition density. Moreover, the entrance density is the density of the first passage time to the left boundary {0}. Also, the entrance density is related to the transition density via Doob's h-path transformation.     

A note on occupation times of random walks

In this note I show that some asymptotic results on the average occupancy time of an interval derived for lattice random walks with negative exponential transition probabilities are true for all random walks whose transition probabilities have a finite variance. The proof is based on the continuum limit.     

On a first-passage problem for a cumulative process with exponential decay

A first-passage problem for a cumulative process is investigated. The cumulative process is assumed to be generated by a Poisson process, and the amplitude generated by an event is assumed to decay exponentially. An integral equation for the probability density of the first-passage time until the total amplitude exceeds a pre-specified threshold level is derived. The Laplace transform of the probability density of the first-passage time is obtained explicity when each amplitude generated by an event is distributed exponentially. The mean first-passage times are given in a closed form and plotted versus the threshold level.     

Reply to “Comment on ‘Calculation of Two-center Nuclear Attraction Integrals over Integer and Noninteger N-slater-type Orbitals in Nonlined-up Coordinate Systems” ’

The comments of Guseinov on our recent paper (T. Özdo?an, S. Gümü? and M. Kara, J. Math. Chem. 33 (2003) 181) are critically analyzed. It is proved that the expansion formula for the product of two normalized associated Legendre functions and the expressions for two-center nuclear attraction integrals over Slater type orbitals have been obtained independently, by the use of basic mathematical rules.