Variance of the asymmetric n-player gambler’s ruin problem with ties allowed

In this article, the variance of the duration of play in the asymmetric n-player gambler’s ruin problem is considered, when the players use equal initial fortunes of d dollars, 1 ? d ? n + 1, and ties allowed in each round. Some special games are simulated and the simulation results verify the validity of the proposed formulas. It is shown that when we do not have the possibility of tie in the game, the increase in the number of players will change the ruin time from a random variable to a degenerate random variable. Finally, the three-tower problem with one of its different definitions are introduced and their expected times as well as their variances of the duration are considered.     

On the distribution of crossings in a generalized random walk

This paper deals with the derivation of the probability distribution of the rank order statistic N¹_μ,n(r), the number of crossings of heightr(≥0) in a generalized random walk with steps 1 and ?μ by using the modified Dwass technique.     

Multistage bandit problems

Consider two or more treatments with dichotomous responses. The total number N of experimental units are to be allocated in a fixed number r of stages. The problem is to decide how many units to assign to each treatment in each stage. Responses from selections in previous stages are available and can be considered but responses in the current stage are not available until the next group of selections is made. Information is updated via the Bayes theorem after each stage. The goal is to maximize the overall expected number of successes in the N units.Two forms of prior information are considered: (i) All arms have beta priors, and (ii) prior distributions have continuous densities. Various characteristics of optimal decisions are presented. For example, in most cases of (i) and (ii), the rate of the optimal size of the first stage cannot be greater than √N when r = 2.     

Some results on constructing two-level block designs with general minimum lower order confounding

Block designs are widely used in experimental situations where the experimental units are heterogeneous. The blocked general minimum lower order confounding (B-GMC) criterion is suitable for selecting optimal block designs when the experimenters have some prior information on the importance of ordering of the treatment factors. This paper constructs B-GMC 2^{n ? m}: 2^r designs with 5 × 2^l/16 + 1 ? n ? (N ? 2^l) < 2^{l ? 1} for l(r + 1 ? l ? n ? m ? 1), where 2^{n ? m}: 2^r denotes a two-level regular block design with N = 2^{n ? m} runs, n treatment factors, and 2^r blocks. With suitable choice of the blocking factors, each B-GMC block design has a common specific structure. Some examples illustrate the simple and effective construction method.     

Gambler’s Ruin: The Duration of Play

We study the gambler’s ruin problem with a general distribution of the payoffs in each game. Assuming the expected value of the payoff distribution is negative, so that eventual ruin occurs with probability 1, we are interested in the distribution of the duration to ruin, also known as the first-passage time distribution. A generating function for this distribution is obtained. Exact expressions for the expected value and variance of this distribution, as well as asymptotic expressions for the case of large initial wealth, are derived.     

On random walks on affine group

Diaconis' presumption that the number of steps required to get close to uniform for a random walk on the affine group A _pis c(p)p ²with c(p) →ã is verified. We also discuss the random number generation associated with the random walk on the affine group. The number of steps to force the generated number to become random is improved. A modified version of Diacohis-Shahshahani's upper bound lemma is given and applied     

A memory reduction method in pricing American options

This paper is concerned with the pricing of American options by simulation methods. In the traditional methods, in order to determine when to exercise, we have to store the simulated asset prices at all time steps on all paths. If N time steps and M paths are used, then the storage requirement is O(MN). In this paper, we present a simulation method for pricing American options where the number of storage required only grows like O(M). The only additional computational cost is that we have to generate each random number twice instead of once. For machines with limited memory, we can now use a larger N to improve the accuracy in pricing the options.     

Empirical Bayes testing for guarantee lifetime: Non identical components case

This article considers an empirical Bayes testing problem for the guarantee lifetime in the two-parameter exponential distributions with non identical components. We study a method of constructing empirical Bayes tests under a class of unknown prior distributions for the sequence of the component testing problems. The asymptotic optimality of the sequence of empirical Bayes tests is studied. Under certain regularity conditions on the prior distributions, it is shown that the sequence of the constructed empirical Bayes tests is asymptotically optimal, and the associated sequence of regrets converges to zero at a rate O(n^{? 1 + 1/[2(r + α) + 1]}) for some integer r ? 0 and 0 ? α ? 1 depending on the unknown prior distributions, where n is the number of past data available when the (n + 1)st component testing problem is considered.     

A sampling plan for one-shot systems considering destructive inspection

Abstract

The paper is concerned with an acceptance sampling problem under destructive inspections for one-shot systems. The systems may fail at random times while they are operating (as the systems are considered to be operating when storage begins), and these failures can only be identified by inspection. Thus, n samples are randomly selected from N one-shot systems for periodic destructive inspection. After storage time T, the N systems are replaced if the number of working systems is less than a pre-specified threshold k. The primary purpose of this study is to determine the optimal number of samples n*, extracted from the N for destructive detection and the optimal acceptance number k*, in the sample under the constraint of the system interval availability, to minimize the expected cost rate. Numerical experiments are studied to investigate the effect of the parameters in sampling inspection on the optimal solutions.     

On limiting distribution laws of statistics analogous to pearson's chi-square

Two test-statistics analogous to Pearson's chi-square test function - given in (1.6) and (1.7) - are investigated. These statistics utilize, apart from the number of sample elements lying in the respective intervals of the partition, their positions within the intervals too. It is shown that the test-statistics are asymptotically distributed - as the sample size N tends to infinity - according to the x ²distribution with parameter r, i.e. the number of intervals chosen. The limiting distribution of the test statistics under the null-hypothesis when N tends to the infinity and r =O(N ^α) (0<α<1), further the consistency of the tests based on these statistics is considered. Some remarks are made concerning the efficiency of the corresponding goodness of fit tests also; the authors intend to return to a more detailed treatment of the efficiency later.     

Some Properties of Order Statistics When the Sample Size Is Random

ABSTRACT

The study of r-out-of-n systems is of utmost importance in reliability theory. In this note, we study closure of different partial orders under the formation of r-out-of-N and (N ? s)-out-of-N systems when the number of components N, forming the system, is a random variable having support {k, k + 1,…}, where k is a fixed positive integer, r ∈ {1,…, k} and s ∈ {0, 1,…, k ? 1}. This generalizes quite a few results already known in the literature. We also study the closure of different partial orders when two systems are formed out of different random number of components.     

THE OPTIMAL CLASSIFICATION RULE FOR EXPONENTIAL POPULATIONS

Let π₁ and π₂ be two exponential populations with location parameters α and β respectively. It is shown that the probability of misclassification for the optimal rule, R_E, depends on α and β only through their ratio α/β=r, and that the smaller the ratio r (i.e. the smaller α is compared to β), the greater the superiority of the optimal rule R_E over the commonly used rule R_N. When α and β are unknown, the sample-based version R_E(s) of R_E exhibits the same pattern of superiority over the sample-based R_N(s) of R_N.     

Optimal foldover designs

An obvious strategy for obtaining a Doptimal foldover design for p factors at two levels each in 2N runs is to fold a Doptimal main effects plan. We show that this strategy works except when N = 4t + 2 and s is even In that case there are two different classes of D-optimal main effects plans with N runs that have the same determinant. However folding them gives two different values foi the D-optimality criteiion One set of designs is D-optimal The other is not.     

An extended geometric process repair model with delayed repair and slight failure type

This article proposes an extended geometric process repair model to generalize the geometric process repair model and studies a repair-replacement problem for a simple repairable system with delayed repair, based on the failure number N of the system under the new model. An optimal replacement policy N* is determined by maximizing the average reward rate of the system. The explicit expression of the average reward rate is derived, and the uniqueness of the optimal replacement policy N* is also proved. Finally, a numerical example is given to illustrate some theoretical results and the model applicability.     

An alternative proof of order statistics moment problem

A necessary and sufficient condition that two distributions having finite means are identical is that for any fixed integer r > 0, the expected values of their rth (n ? r) order statistics are equal [or the expected values of their (n-r)th (n > r ? 0) order statistics are equal] for all n where n is the sample size.     

Ergodicity of generalized Ait-Sahalia-type interest rate model

In this paper, we consider sufficient conditions for the stationary distribution of generalized Ait-Sahalia-type interest rate model. We show that if r ? 2ρ ? 1, then the generalized Ait-Sahalia interest rate model has a unique stationary distribution and if r < 2ρ ? 1, then the generalized Ait-Sahalia interest rate model is recurrent relative to the domain (0, ?), for any ? > 0. Besides, some recursion formulas for the stationary distribution are presented. Finally, some numerical simulations are used to illustrate our results.     

The Uniform Asymptotics of the Overshoot of a Random Walk with Light-Tailed Increments

Let {S _n : n ≥ 0} be a random walk with light-tailed increments and negative drift, and let τ(x) be the first time when the random walk crosses a given level x ≥ 0. Tang (2007 Tang , Q. ( 2007 ). The overshoot of a random walk with negative drift . Statist. Probab. Lett. 77 : 158 – 165 .[Crossref], [Web of Science ®] , [Google Scholar]) obtained the asymptotics of P(S _τ(x) ? x > y, τ(x) < ∞) as x → ∞, which is uniform for y ≥ f(x) for any positive function f(x) → ∞ as x → ∞. In this article, the uniform asymptotics of P(S _τ(x) ? x > y, τ(x) < ∞) as x → ∞, for 0 ≤ y ≤ N for any positive number N will be given. Using the above two results, the uniform asymptotics of P(S _τ(x) ? x > y, τ(x) < ∞) as x → ∞, for y ≥ 0, is presented.     

Exact Distributions of the Number of r-Records and the r-Record and Inter-r-Record Times

Consider a sequence of independent and identically distributed random variables with an absolutely continuous distribution function. The probability functions of the numbers K_n,r and N_n,r of r-records up to time n of the first and second type, respectively, are obtained in terms of the non central and central signless Stirling numbers of the first kind. Also, the binomial moments of K_n,r and N_n,r are expressed in terms of the non central signless Stirling numbers of the first kind. The probability functions of the times L_k,r and T_k,r of the kth r-record of the first and second type, respectively, are deduced from those of K_n,r and N_n,r. A simple expression for the binomial moments of T_k,r is derived. Finally, the probability functions and binomial moments of the kth inter-r-record times U_k,r = L_k,r ? L_k?1,r and W_k,r = T_k,r ? T_k?1,r are obtained as sums of finite number of terms.     

On Generalized Binomial and Negative Binomial Distributions for Dependent Bernoulli Variables

We study the distributions of the random variables S_n and V_r related to a sequence of dependent Bernoulli variables, where S_n denotes the number of successes in n trials and V_r the number of trials necessary to obtain r successes. The purpose of this article is twofold: (1) Generalizing some results on the “nature” of the binomial and negative binomial distributions we show that S_n and V_r can follow any prescribed discrete distribution. The corresponding joint distributions of the Bernoulli variables are characterized as the solutions of systems of linear equations. (2) We consider a specific type of dependence of the Bernoulli variables, where the probability of a success depends only on the number of previous successes. We develop some theory based on new closed-form representations for the probability mass functions of S_n and V_r which enable direct computations of the probabilities.     

The mean general residual lifetime of (n − k + 1)-out-of-n systems with exchangeable components

The study of the reliability properties of (n ? k + 1)-out-of-n systems has gained a great deal of attention, from both theoretical and practical perspectives. In this article, we consider (n ? k + 1)-out-of-n systems with exchangeable components and study the stochastic properties of two forms of residual lifetimes of such systems under the following conditions: n ? r + 1 (r ? k) components of the system are operating at time t > 0, and/or the rth (r < k) component has failed, but the system is working at time t. In addition, some results relating to the functions of the mean general residual lifetimes (MGRL) are derived for these systems. Finally, in accordance with the generalized Farlie–Gumbel–Morgenstern model, we present the reliability properties of the general residual lifetime of (n ? k + 1)-out-of-n systems and investigate the asymptotic behavior of the proposed MGRL functions with exponential marginals.