Waiting times for multiple occurrences of several events

1988 ◽  
Vol 25 (3) ◽  
pp. 624-629
Author(s):  
Stephen Scheinberg
Keyword(s):  
Asymptotic Behavior ◽  
Finite Number ◽  
Waiting Times ◽  
Expected Number

Consider an ‘experiment' which can be repeated indefinitely often resulting in independent random outcomes. Fix attention on a finite number of possible (sets of) outcomes E1, E2, … and define W = W(N1, N2, …) to be the expected number of repetitions needed to ensure that E1 has occurred (at least) N1 times, E2 has occurred (at least) N2 times, etc. This article examines the asymptotic behavior of W as a function of the sum ΣjNj, as the latter grows without bound.

Waiting times for multiple occurrences of several events

1988 ◽  
Vol 25 (03) ◽  
pp. 624-629
Author(s):  
Stephen Scheinberg
Keyword(s):  
Asymptotic Behavior ◽  
Finite Number ◽  
Waiting Times ◽  
Expected Number

Consider an ‘experiment' which can be repeated indefinitely often resulting in independent random outcomes. Fix attention on a finite number of possible (sets of) outcomes E 1, E 2, … and define W = W(N 1, N 2, …) to be the expected number of repetitions needed to ensure that E 1 has occurred (at least) N 1 times, E 2 has occurred (at least) N 2 times, etc. This article examines the asymptotic behavior of W as a function of the sum Σ j N j, as the latter grows without bound.

Analysis of the Luria–Delbrück distribution using discrete convolution powers

1992 ◽  
Vol 29 (02) ◽  
pp. 255-267 ◽  
Author(s):  
W. T. Ma ◽  
G. vH. Sandri ◽  
S. Sarkar
Keyword(s):  
Population Genetics ◽  
Asymptotic Behavior ◽  
Computational Efficiency ◽  
Recursion Relation ◽  
Expected Number ◽  
Discrete Convolution ◽  
Convolution Powers ◽  
Central Result

The Luria–Delbrück distribution arises in birth-and-mutation processes in population genetics that have been systematically studied for the last fifty years. The central result reported in this paper is a new recursion relation for computing this distribution which supersedes all past results in simplicity and computational efficiency: p 0 = e–m ; where m is the expected number of mutations. A new relation for the asymptotic behavior of pn (≈ c/n 2) is also derived. This corresponds to the probability of finding a very large number of mutants. A formula for the z-transform of the distribution is also reported.

A one dimensional random space-filling problem

1968 ◽  
Vol 5 (02) ◽  
pp. 427-435 ◽  
Author(s):  
John P. Mullooly
Keyword(s):  
Asymptotic Behavior ◽  
Finite Number ◽  
Real Line ◽  
Random Variables ◽  
Random Interval ◽  
Space Filling ◽  
One Dimensional ◽  
The Real ◽  
Fixed Constant ◽  
Filling Problem

Consider an interval of the real line (0, x), x > 0; and place in it a random subinterval S(x) defined by the random variables Xx and Yx , the position of the center of S(x) and the length of S(x). The set (0, x)– S(x) consists of two intervals of length δ and η. Let a > 0 be a fixed constant. If δ ≦ a, then a random interval S(δ) defined by Xδ, Yδ is placed in the interval of length δ. If δ < a, the placement of the second interval is not made. The same is done for the interval of length η. Continue to place non-intersecting random subintervals in (0, x), and require that the lengths of all the random subintervals be ≦ a. The process terminates after a finite number of steps when all the segments of (0, x) uncovered by random subintervals are of length < a. At this stage, we say that (0, x) is saturated. Define N(a, x) as the number of random subintervals that have been placed when the process terminates. We are interested in the asymptotic behavior of the moments of N(a, x), for large x.

Asymptotic behavior of Hill's estimate and applications

1986 ◽  
Vol 23 (04) ◽  
pp. 922-936
Author(s):  
Gane Samb Lo
Keyword(s):  
Distribution Function ◽  
Asymptotic Behavior ◽  
Finite Number ◽  
Domain Of Attraction ◽  
Distribution Functions ◽  
Complete Theory ◽  
General Distribution ◽  
Stable Law ◽  
Biological Phenomena ◽  
Pareto’S Law

The problem of estimating the exponent of a stable law is receiving an increasing amount of attention because Pareto's law (or Zipf's law) describes many biological phenomena very well (see e.g. Hill (1974)). This problem was first solved by Hill (1975), who proposed an estimate, and the convergence of that estimate to some positive and finite number was shown to be a characteristic of distribution functions belonging to the Fréchet domain of attraction (Mason (1982)). As a contribution to a complete theory of inference for the upper tail of a general distribution function, we give the asymptotic behavior (weak and strong) of Hill's estimate when the associated distribution function belongs to the Gumbel domain of attraction. Examples, applications and simulations are given.

scholarly journals Embedded minimal surfaces of finite topology

2019 ◽  
Vol 2019 (753) ◽  
pp. 159-191 ◽  
Author(s):  
William H. Meeks III ◽  
Joaquín Pérez
Keyword(s):  
Asymptotic Behavior ◽  
Riemann Surface ◽  
Finite Number ◽  
Minimal Surface ◽  
Minimal Surfaces ◽  
Compact Riemann Surface ◽  
Finite Topology ◽  
Compact Boundary ◽  
Interior Points

AbstractIn this paper we prove that a complete, embedded minimal surface M in {\mathbb{R}^{3}} with finite topology and compact boundary (possibly empty) is conformally a compact Riemann surface {\overline{M}} with boundary punctured in a finite number of interior points and that M can be represented in terms of meromorphic data on its conformal completion {\overline{M}}. In particular, we demonstrate that M is a minimal surface of finite type and describe how this property permits a classification of the asymptotic behavior of M.

Asymptotic behavior of a generalization of Bailey's simple epidemic

1971 ◽  
Vol 3 (02) ◽  
pp. 220-221
Author(s):  
George H. Weiss ◽  
Menachem Dishon
Keyword(s):  
Asymptotic Behavior ◽  
Differential Equations ◽  
Rate Constants ◽  
Deterministic Model ◽  
Stochastic Theory ◽  
Expected Number ◽  
Deterministic Theory ◽  
Mean Values ◽  
Image Position ◽  
Fixed Population

It has been shown that for many epidemic models, the stochastic theory leads to essentially the same results as the deterministic theory provided that one identifies mean values with the functions calculated from the deterministic differential equations (cf. [1]). If one considers a generalization of Bailey's simple epidemic for a fixed population of size N, represented schematically by where I refers to an infected, S refers to a susceptible, and α and β are appropriate rate constants, then it is evident that at time t = ∞, the expected number of infected individuals must be zero provided that β > 0. If x(t) denotes the number of infected at time t, then the deterministic model is summarized by

Asymptotic behavior of Hill's estimate and applications

1986 ◽  
Vol 23 (4) ◽  
pp. 922-936 ◽  
Author(s):  
Gane Samb Lo
Keyword(s):  
Distribution Function ◽  
Asymptotic Behavior ◽  
Finite Number ◽  
Domain Of Attraction ◽  
Distribution Functions ◽  
Complete Theory ◽  
General Distribution ◽  
Stable Law ◽  
Biological Phenomena ◽  
Pareto’S Law

The problem of estimating the exponent of a stable law is receiving an increasing amount of attention because Pareto's law (or Zipf's law) describes many biological phenomena very well (see e.g. Hill (1974)). This problem was first solved by Hill (1975), who proposed an estimate, and the convergence of that estimate to some positive and finite number was shown to be a characteristic of distribution functions belonging to the Fréchet domain of attraction (Mason (1982)). As a contribution to a complete theory of inference for the upper tail of a general distribution function, we give the asymptotic behavior (weak and strong) of Hill's estimate when the associated distribution function belongs to the Gumbel domain of attraction. Examples, applications and simulations are given.

On some waiting time problems

2000 ◽  
Vol 37 (03) ◽  
pp. 756-764 ◽  
Author(s):  
Valeri T. Stefanov
Keyword(s):  
Survival Analysis ◽  
Finite Number ◽  
Markov Processes ◽  
Waiting Time ◽  
Generating Functions ◽  
Continuous Time ◽  
Waiting Times ◽  
Phase Type ◽  
Phase Type Distributions ◽  
Semi Markov Processes

A unifying technology is introduced for finding explicit closed form expressions for joint moment generating functions of various random quantities associated with some waiting time problems. Sooner and later waiting times are covered for general discrete- and continuous-time models. The models are either Markov chains or semi-Markov processes with a finite number of states. Waiting times associated with generalized phase-type distributions, that are of interest in survival analysis and other areas, are also covered.

On some waiting time problems

2000 ◽  
Vol 37 (3) ◽  
pp. 756-764 ◽  
Author(s):  
Valeri T. Stefanov
Keyword(s):  
Survival Analysis ◽  
Finite Number ◽  
Markov Processes ◽  
Waiting Time ◽  
Generating Functions ◽  
Continuous Time ◽  
Waiting Times ◽  
Phase Type ◽  
Phase Type Distributions ◽  
Semi Markov Processes

A unifying technology is introduced for finding explicit closed form expressions for joint moment generating functions of various random quantities associated with some waiting time problems. Sooner and later waiting times are covered for general discrete- and continuous-time models. The models are either Markov chains or semi-Markov processes with a finite number of states. Waiting times associated with generalized phase-type distributions, that are of interest in survival analysis and other areas, are also covered.

Asymptotic behavior of a generalization of Bailey's simple epidemic

1971 ◽  
Vol 3 (2) ◽  
pp. 220-221 ◽  
Author(s):  
George H. Weiss ◽  
Menachem Dishon
Keyword(s):  
Asymptotic Behavior ◽  
Differential Equations ◽  
Rate Constants ◽  
Deterministic Model ◽  
Stochastic Theory ◽  
Expected Number ◽  
Deterministic Theory ◽  
Mean Values ◽  
Image Position ◽  
Fixed Population

It has been shown that for many epidemic models, the stochastic theory leads to essentially the same results as the deterministic theory provided that one identifies mean values with the functions calculated from the deterministic differential equations (cf. [1]). If one considers a generalization of Bailey's simple epidemic for a fixed population of size N, represented schematically by where I refers to an infected, S refers to a susceptible, and α and β are appropriate rate constants, then it is evident that at time t = ∞, the expected number of infected individuals must be zero provided that β > 0. If x(t) denotes the number of infected at time t, then the deterministic model is summarized by

Sign in / Sign up

Export Citation Format

Share Document