نتایج جستجو برای: compound poisson processes

تعداد نتایج: 680565  

ژورنال: اندیشه آماری 2013
Montazeri, Narges, Torabi, Hamzeh,

For almost two centuries, Poisson process with memoryless property of corresponding exponential distribution served as the simplest, and yet one of the most important stochastic models. On the other hand, there are many processes that exhibit long memory (e.g., network traffic and other complex systems). It would be useful if one could generalize the standard Poisson process to include these p...

2008
Jesper Møller Frederic Paik Schoenberg

This paper describes methods for randomly thinning certain classes of spatial point processes. In the case of a Markov point process, the proposed method involves a dependent thinning of a spatial birth-and-death process, where clans of ancestors associated with the original points are identified, and where one simulates backwards and forwards in order to obtain the thinned process. In the case...

Journal: :Discrete Applied Mathematics 2013
Oliver Johnson Ioannis Kontoyiannis Mokshay M. Madiman

Sufficient conditions are developed, under which the compound Poisson distribution has maximal entropy within a natural class of probability measures on the nonnegative integers. Recently, one of the authors [O. Johnson, Stoch. Proc. Appl., 2007] used a semigroup approach to show that the Poisson has maximal entropy among all ultra-log-concave distributions with fixed mean. We show via a non-tr...

2006
I. KONTOYIANNIS

Abstract: We give a simple development of the concentration properties of compound Poisson measures on the nonnegative integers. A new modification of the Herbst argument is applied to an appropriate modified logarithmic-Sobolev inequality to derive new concentration bounds. When the measure of interest does not have finite exponential moments, these bounds exhibit optimal polynomial decay. Sim...

2002
A. D. Barbour

Compound Poisson approximation is a useful tool in a variety of applications, including insurance mathematics, reliability theory, and molecular sequence analysis. In this paper, we review the ways in which Stein's method can currently be used to derive bounds on the error in such approximations. The theoretical basis for the construction of error bounds is systematically discussed, and a numbe...

2004
MARIO V. WÜTHRICH

We consider the problem of claims reserving and estimating run-off triangles. We generalize the gamma cell distributions model which leads to Tweedie’s compound Poisson model. Choosing a suitable parametrization, we estimate the parameters of our model within the framework of generalized linear models (see Jørgensen-de Souza [2] and Smyth-Jørgensen [8]). We show that these methods lead to reaso...

2010
L. Brown E. Greenshtein

Abstract: The compound decision problem for a vector of independent Poisson random variables with possibly different means has half a century old solution. However, it appears that the classical solution needs smoothing adjustment even when there are many observations and relatively small means such that the empirical distribution is close to its mean. We discuss three such adjustments. We also...

2005
PETER NEAL

We consider epidemics in populations that are partitioned into small groups known as households. Whilst infectious, a typical infective makes global and local contact with individuals chosen independently and uniformly from the whole population or their own household, as appropriate. Previously, the classical Poisson approximation for the number of survivors of a severe epidemic has been extend...

Journal: :IEEE Journal on Selected Areas in Communications 1986
Raj Jain Shawn A. Routhier

Traffic measurements on a ring local area computer network at the Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival processes are neither Poisson nor compound Poisson. An alternative model called “packet train” is proposed. In the train model, the traffic on the network consists of a number of packet streams between various pairs of ...

1986
SHAWN A. ROUTHIER

Traffic measurements on a ring local area computer network at the Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival processes are neither Poisson nor compound Poisson. An alternative model called “packet train” is proposed. In the train model, the traffic on the network consists of a number of packet streams between various pairs of ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید