A Non-Uniform Bound Approximation of Polya via Poisson, Using Stein-Chen Method and Ω –Function and Its Application in Option Pricing
Journal Title: International Journal of Mathematics and Statistics Invention - Year 2018, Vol 6, Issue 3
Abstract
In this work, the Stein-Chen method and the ω-function associated with Pόlya random variable are used to obtain a non-uniform bound approximation of Pόlya by Poisson in terms of point metric and Pόlya distribution applied in finance. Egege et al[11]found out that the upper bound may not be sufficiently enough for measuring the accuracy of an approximation. Also, it was discovered that the results obtained for nonuniform are better than the results obtained for uniform bound. This is in agreement with Egege et al,[11], that for 𝑛 ≤ 𝑟 , and if the upper bound is small, then a good approximation of Pόlya is obtained. And for n>r , it will not give an appropriate approximation. And Pόlya combined with financial term is used to generate a model for forecasting the price of a European call option. Which gives the same numerical with Osu ,et al[2].
Authors and Affiliations
Samson O. Egege, Bright O. Osu, Chigozie Chibuisi
Keywords
Related Articles
- EP ID EP401433
- DOI -
- Views 143
- Downloads 0
Use of Texting in Teaching and Its Effect on On-Time Homework Submission Rate Topics: Higher Education / Mathematics Education
In the present times, students are more comfortable with texting than checking their email. This is because texting is more immediate then the emailing. In this paper, I will examine the use of texting for homework submi...
A Non-Uniform Bound Approximation of Polya via Poisson, Using Stein-Chen Method and Ω –Function and Its Application in Option Pricing
In this work, the Stein-Chen method and the ω-function associated with Pόlya random variable are used to obtain a non-uniform bound approximation of Pόlya by Poisson in terms of point metric and Pόlya distribution applie...
The Total Strong Split Domination Number of Graphs
A total dominating set D of graph G = (V, E) is a total strong split dominating set if the induced subgraph < V-D > is totally disconnected with atleast two vertices. The total strong split domination number γtss(G) is t...
Edge Domination in Hypergraph
In this paper we define the concept of edge domination in hypergraphs. We characterize minimal edge dominating sets in hypergraphs. We also prove that a set of vertices S of a hypergraph is a dominating set iff S* is an...
Enhancing the Mean Ratio Estimator for Estimating Population Mean Using Conventional Parameters
Use of auxilliary information in survey sampling has its eminent role in estimating the population parameters with greater precision. The present paper concentrates on estimating the finite population mean by proposing t...