VTeX: Solutions for Science Publishing

We investigate the pricing of cliquet options in a jump-diffusion model. The considered option is of monthly sum cap style while the underlying stock price model is driven by a drifted Lévy process entailing a Brownian diffusion component as well as compound Poisson jumps. We also derive representations for the density and distribution function of the emerging Lévy process. In this setting, we infer semi-analytic expressions for the cliquet option price by two different approaches. The first one involves the probability distribution function of the driving Lévy process whereas the second draws upon Fourier transform techniques. With view on sensitivity analysis and hedging purposes, we eventually deduce representations for several Greeks while putting emphasis on the Vega.

A fractional advection-dispersion equation (fADE) has been advocated for heavy-tailed flows where the usual Brownian diffusion models fail. A stochastic differential equation (SDE) driven by a stable Lévy process gives a forward equation that matches the space-fractional advection-dispersion equation and thus gives the stochastic framework of particle tracking for heavy-tailed flows. For constant advection and dispersion coefficient functions, the solution to such SDE itself is a stable process and can be derived easily by least square parameter fitting from the observed flow concentration data. However, in a more generalized scenario, a closed form for the solution to a stable SDE may not exist. We propose a numerical method for solving/generating a stable SDE in a general set-up. The method incorporates a discretized finite volume scheme with the characteristic line to solve the fADE or the forward equation for the Markov process that solves the stable SDE. Then we use a numerical scheme to generate the solution to the governing SDE using the fADE solution. Also, often the functional form of the advection or dispersion coefficients are not known for a given plume concentration data to start with. We use a Levenberg–Marquardt (L-M) regularization method to estimate advection and dispersion coefficient function from the observed data (we present the case for a linear advection) and proceed with the SDE solution construction described above.

A fractional advection-dispersion equation (fADE) has been advocated for heavy-tailed flows where the usual Brownian diffusion models fail. A stochastic differential equation (SDE) driven by a stable Lévy process gives a forward equation that matches the space-fractional advection-dispersion equation and thus gives the stochastic framework of particle tracking for heavy-tailed flows. For constant advection and dispersion coefficient functions, the solution to such SDE itself is a stable process and can be derived easily by least square parameter fitting from the observed flow concentration data. However, in a more generalized scenario, a closed form for the solution to a stable SDE may not exist. We propose a numerical method for solving/generating a stable SDE in a general set-up. The method incorporates a discretized finite volume scheme with the characteristic line to solve the fADE or the forward equation for the Markov process that solves the stable SDE. Then we use a numerical scheme to generate the solution to the governing SDE using the fADE solution. Also, often the functional form of the advection or dispersion coefficients are not known for a given plume concentration data to start with. We use a Levenberg–Marquardt (L-M) regularization method to estimate advection and dispersion coefficient function from the observed data (we present the case for a linear advection) and proceed with the SDE solution construction described above.

Confidence ellipsoids for linear regression coefficients are constructed by observations from a mixture with varying concentrations. Two approaches are discussed. The first one is the nonparametric approach based on the weighted least squares technique. The second one is an approximate maximum likelihood estimation with application of the EM-algorithm for the estimates calculation.

Confidence ellipsoids for linear regression coefficients are constructed by observations from a mixture with varying concentrations. Two approaches are discussed. The first one is the nonparametric approach based on the weighted least squares technique. The second one is an approximate maximum likelihood estimation with application of the EM-algorithm for the estimates calculation.

This paper deals with a homoskedastic errors-in-variables linear regression model and properties of the total least squares (TLS) estimator. We partly revise the consistency results for the TLS estimator previously obtained by the author [18]. We present complete and comprehensive proofs of consistency theorems. A theoretical foundation for construction of the TLS estimator and its relation to the generalized eigenvalue problem is explained. Particularly, the uniqueness of the estimate is proved. The Frobenius norm in the definition of the estimator can be substituted by the spectral norm, or by any other unitarily invariant norm; then the consistency results are still valid.

This paper deals with a homoskedastic errors-in-variables linear regression model and properties of the total least squares (TLS) estimator. We partly revise the consistency results for the TLS estimator previously obtained by the author [18]. We present complete and comprehensive proofs of consistency theorems. A theoretical foundation for construction of the TLS estimator and its relation to the generalized eigenvalue problem is explained. Particularly, the uniqueness of the estimate is proved. The Frobenius norm in the definition of the estimator can be substituted by the spectral norm, or by any other unitarily invariant norm; then the consistency results are still valid.

The effect that weighted summands have on each other in approximations of $S={w_{1}}{S_{1}}+{w_{2}}{S_{2}}+\cdots +{w_{N}}{S_{N}}$ is investigated. Here, ${S_{i}}$’s are sums of integer-valued random variables, and ${w_{i}}$ denote weights, $i=1,\dots ,N$. Two cases are considered: the general case of independent random variables when their closeness is ensured by the matching of factorial moments and the case when the ${S_{i}}$ has the Markov Binomial distribution. The Kolmogorov metric is used to estimate the accuracy of approximation.

The effect that weighted summands have on each other in approximations of $S={w_{1}}{S_{1}}+{w_{2}}{S_{2}}+\cdots +{w_{N}}{S_{N}}$ is investigated. Here, ${S_{i}}$’s are sums of integer-valued random variables, and ${w_{i}}$ denote weights, $i=1,\dots ,N$. Two cases are considered: the general case of independent random variables when their closeness is ensured by the matching of factorial moments and the case when the ${S_{i}}$ has the Markov Binomial distribution. The Kolmogorov metric is used to estimate the accuracy of approximation.

A continuous-time regression model with a jointly strictly sub-Gaussian random noise is considered in the paper. Upper exponential bounds for probabilities of large deviations of the least squares estimator for the regression parameter are obtained.