Continuous Time Wishart Process for Stochastic Risk

Risks are usually represented and measured by volatility–covolatility matrices. Wishart processes are models for a dynamic analysis of multivariate risk and describe the evolution of stochastic volatility–covolatility matrices, constrained to be symmetric positive definite. The autoregressive Wishart process (WAR) is the multivariate extension of the Cox, Ingersoll, Ross (CIR) process introduced for scalar stochastic volatility. As a CIR process it allows for closed-form solutions for a number of financial problems, such as term structure of T-bonds and corporate bonds, derivative pricing in a multivariate stochastic volatility model, and the structural model for credit risk. Moreover, the Wishart dynamics are very flexible and are serious competitors for less structural multivariate ARCH models.     

The Modeling and Seasonal Adjustment of Weekly Observations

Several important economic time series are recorded on a particular day every week. Seasonal adjustment of such series is difficult because the number of weeks varies between 52 and 53 and the position of the recording day changes from year to year. In addition certain festivals, most notably Easter, take place at different times according to the year. This article presents a solution to problems of this kind by setting up a structural time series model that allows the seasonal pattern to evolve over time and enables trend extraction and seasonal adjustment to be carried out by means of state-space filtering and smoothing algorithms. The method is illustrated with a Bank of England series on the money supply.     

Exchange option in a two-state Poisson CAPM

In this paper we derive the pricing formula for the exchange option value in a two-state Poisson CAPM. A two-state Poisson CAPM models the stochastic market environment. We also provide examples and graphs to illustrate our result.     

An EM and a Stochastic Version of the EM Algorithm for Nonparametric Hidden Semi-Markov Models

The Hidden semi-Markov models (HSMMs) were introduced to overcome the constraint of a geometric sojourn time distribution for the different hidden states in the classical hidden Markov models. Several variations of HSMMs were proposed that model the sojourn times by a parametric or a nonparametric family of distributions. In this article, we concentrate our interest on the nonparametric case where the duration distributions are attached to transitions and not to states as in most of the published papers in HSMMs. Therefore, it is worth noticing that here we treat the underlying hidden semi-Markov chain in its general probabilistic structure. In that case, Barbu and Limnios (2008 Barbu , V. , Limnios , N. ( 2008 ). Semi-Markov Chains and Hidden Semi-Markov Models Toward Applications: Their Use in Reliability and DNA Analysis . New York : Springer . [Google Scholar]) proposed an Expectation–Maximization (EM) algorithm in order to estimate the semi-Markov kernel and the emission probabilities that characterize the dynamics of the model. In this article, we consider an improved version of Barbu and Limnios' EM algorithm which is faster than the original one. Moreover, we propose a stochastic version of the EM algorithm that achieves comparable estimates with the EM algorithm in less execution time. Some numerical examples are provided which illustrate the efficient performance of the proposed algorithms.     

Charts for finding upper percentage points of Student's t in the range .01 to .00001

The Bonferroni t-statistic is a versatile tool in multiple comparisons problems. The need for "oddball percentage points" may lead to extensive tables or heavy computation. Charts of t_p as a function of log p enable near two-decimal accuracy for any percentage point between .01 and .00001     

An Approximate Bayesian Marginal Likelihood Approach for Estimating Finite Mixtures

Estimation of finite mixture models when the mixing distribution support is unknown is an important problem. This article gives a new approach based on a marginal likelihood for the unknown support. Motivated by a Bayesian Dirichlet prior model, a computationally efficient stochastic approximation version of the marginal likelihood is proposed and large-sample theory is presented. By restricting the support to a finite grid, a simulated annealing method is employed to maximize the marginal likelihood and estimate the support. Real and simulated data examples show that this novel stochastic approximation and simulated annealing procedure compares favorably with existing methods.     

A New Approach to Importance Sampling in Taylor’s Stochastic Volatility Model

This article presents the general analysis of finite high-dimensional integrals using the Importance Sampling (IS) in aim to the parameter estimation of Taylor’s stochastic volatility (SV) model. After we proceed to make an alternative derivation for Sequential Importance Sampling (SIS) in previous literatures, we propose a new approach to select the optimal parameters of sampler, which is called as Universal Importance Sampling (UIS). UIS minimizes the Monte Carlo variance and numerically performs at least the same accurately as the SIS algorithm, but the computational efficiency get greatly improved. We apply both methods and investigate the SV model on the data, then make comparisons of the results.     

Concomitants in a Sequence of Independent Nonidentically Distributed Random Vectors

ABSTRACT

Concomitants of order statistics are considered for the situation in which the random vectors (X ₁, Y ₁), (X ₂, Y ₂),…, (X _n , Y _n ) are independent but otherwise arbitrarily distributed. The joint and marginal distributions of the concomitants of order statistics and stochastic comparisons among the concomitants of order statistics are studied in this situation.     

Binary Regression with Stochastic Covariates

In binary regression the risk factor X has been treated in the literature as a non-stochastic variable. In most situations, however, X is stochastic. We present solutions applicable to such situations. We show that our solutions are more precise than those obtained by treating X as non-stochastic when, in fact, it is stochastic.