This thesis first presents India’s economy and financial system’s recent history and current issues. Then, with an emphasis on the recent turmoil period, it studies the question of financial integration in various markets: equity markets are dealt with in the 1st chapter, CDS spreads are...

The choice of the summary statistics in Bayesian inference and in particular in ABC algorithms is paramount to produce a valid outcome. We derive necessary and sufficient conditions on those statistics for the corresponding Bayes factor to be convergent, namely to asymptotically select the true...

Since its introduction in the early 90's, the idea of using importance sampling (IS) with Markov chain Monte Carlo (MCMC) has found many applications. This paper examines problems associated with its application to repeated evaluation of related posterior distributions with a particular focus on...

Gaussian time-series models are often specified through their spectral density. Such models pose several computational challenges, in particular because of the non-sparse nature of the covariance matrix. We derive a fast approximation of the likelihood for such models. We use importance sampling...

While statisticians are well-accustomed to performing exploratory analysis in the modeling stage of an analysis, the notion of conducting preliminary general-purpose exploratory analysis in the Monte Carlo stage (or more generally, the model-fitting stage) of an analysis is an area that we feel...

Gibbs sampling has had great success in the analysis of mixture models. In particular, the “latent variable” formulation of the mixture model greatly reduces computational complexity. However, one failing of this approach is the possible existence of almost-absorbing states, called trapping...

Many authors have considered the problem of estimating a covariance matrix in small samples. In this framework the sample covariance matrix is not robust, the solution is to impose some ad hoc structure on the covariance matrix to force it to be well-conditioned. This method is known as...

A Monte Carlo algorithm is said to be adaptive if it automatically calibrates its current proposal distribution using past simulations. The choice of the parametric family that defines the set of proposal distributions is critical for a good performance. In this paper, we present such a...