10 resultados para Geometric Sum
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
If a regenerative process is represented as semi-regenerative, we derive formulae enabling us to calculate basic characteristics associated with the first occurrence time starting from corresponding characteristics for the semi-regenerative process. Recursive equations, integral equations, and Monte-Carlo algorithms are proposed for practical solving of the problem.
Resumo:
Let (Xi ) be a sequence of i.i.d. random variables, and let N be a geometric random variable independent of (Xi ). Geometric stable distributions are weak limits of (normalized) geometric compounds, SN = X1 + · · · + XN , when the mean of N converges to infinity. By an appropriate representation of the individual summands in SN we obtain series representation of the limiting geometric stable distribution. In addition, we study the asymptotic behavior of the partial sum process SN (t) = ⅀( i=1 ... [N t] ) Xi , and derive series representations of the limiting geometric stable process and the corresponding stochastic integral. We also obtain strong invariance principles for stable and geometric stable laws.
Resumo:
* This paper was supported in part by the Bulgarian Ministry of Education, Science and Technologies under contract MM-506/95.
Resumo:
* Research supported by NATO GRANT CRG 900 798 and by Humboldt Award for U.S. Scientists.
Resumo:
It is proved that for every k there exist k triples of positive integers with the same sum and the same product.
Resumo:
Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to construct new codes. ACM Computing Classification System (1998): E.4.
Resumo:
2000 Mathematics Subject Classi cation: 60J80, 60F25.
Resumo:
2000 Mathematics Subject Classification: 60J80, 60G70.
Resumo:
2000 Mathematics Subject Classification: Primary 60G51, secondary 60G70, 60F17.
Resumo:
MSC 2010: 33C20