35 research outputs found

    Generalized gamma approximation with rates for urns, walks and trees

    Full text link
    We study a new class of time inhomogeneous P\'olya-type urn schemes and give optimal rates of convergence for the distribution of the properly scaled number of balls of a given color to nearly the full class of generalized gamma distributions with integer parameters, a class which includes the Rayleigh, half-normal and gamma distributions. Our main tool is Stein's method combined with characterizing the generalized gamma limiting distributions as fixed points of distributional transformations related to the equilibrium distributional transformation from renewal theory. We identify special cases of these urn models in recursive constructions of random walk paths and trees, yielding rates of convergence for local time and height statistics of simple random walk paths, as well as for the size of random subtrees of uniformly random binary and plane trees.Comment: Published at http://dx.doi.org/10.1214/15-AOP1010 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org

    Total variation error bounds for geometric approximation

    Full text link
    We develop a new formulation of Stein's method to obtain computable upper bounds on the total variation distance between the geometric distribution and a distribution of interest. Our framework reduces the problem to the construction of a coupling between the original distribution and the "discrete equilibrium" distribution from renewal theory. We illustrate the approach in four non-trivial examples: the geometric sum of independent, non-negative, integer-valued random variables having common mean, the generation size of the critical Galton-Watson process conditioned on non-extinction, the in-degree of a randomly chosen node in the uniform attachment random graph model and the total degree of both a fixed and randomly chosen node in the preferential attachment random graph model.Comment: Published in at http://dx.doi.org/10.3150/11-BEJ406 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statistical Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm

    Increasing Gambler's Ruin duration and Brownian Motion exit times

    Full text link
    In Gambler's Ruin when both players start with the same amount of money, we show the playing time stochastically increases when the games are made more fair. We give two different arguments for this fact that extend results from \cite{Pek2021}. We then use this to show that the exit time from a symmetric interval for Brownian motion with drift stochastically increases as the drift moves closer to zero; this result is not easily obtainable from available explicit formulas for the density

    ON THE NUMBER OF REFUSALS IN A BUSY PERIOD

    Full text link

    A Three-Parameter Binomial Approximation

    Full text link
    We approximate the distribution of the sum of independent but not necessarily identically distributed Bernoulli random variables using a shifted binomial distribution where the three parameters (the number of trials, the probability of success, and the shift amount) are chosen to match up the first three moments of the two distributions. We give a bound on the approximation error in terms of the total variation metric using Stein's method. A numerical study is discussed that shows shifted binomial approximations typically are more accurate than Poisson or standard binomial approximations. The application of the approximation to solving a problem arising in Bayesian hierarchical modeling is also discussed

    SOME RESULTS FOR SKIP-FREE RANDOM WALK

    Full text link

    Optimal policies for multi-server non-preemptive priority queues. Queueing Systems: Theory and Applications 42:91–101

    No full text
    We consider a multi-server non-preemptive queue with high and low priority customers, and a decision maker who decides when waiting customers may enter service. The goal is to minimize the mean waiting time for high-priority customers while keeping the queue stable. We use a linear programming approach to find and evaluate the performance of an asymptotically optimal policy in the setting of exponential service and inter-arrival times. 1
    corecore