Distortion representations of multivariate distributions

Statistical Methods & Applications - The univariate distorted distributions were introduced in risk theory to represent changes (distortions) in the expected distributions of some risks. Later,...     

Posterior ranges of functions of parameters under priors with specified quantiles

Suppose some quantiles of the prior distribution of a nonnegative parameter θ are specified. Instead of eliciting just one prior density function, consider the class Γ of all the density functions compatible with the quantile specification. Given a likelihood function, find the posterior upper and lower bounds for the expected value of any real-valued function h(θ), as the density varies in Γ. Such a scheme agrees with a robust Bayesian viewpoint. Under mild regularity conditions about h(θ) and the likelihood, a procedure for finding bounds is derived and applied to an example, after transforming the given functional optimisation problems into finite-dimensional ones.     

On the Use of the Concentration Function in Medical Fraud Assessment

We propose a simple, but effective, tool to detect possible anomalies in the services prescribed by a health care provider (HP) compared to his/her colleagues in the same field and environment. Our method is based on the concentration function that is an extension of the Lorenz curve widely used in describing uneven distribution of wealth in a population. The proposed tool provides a graphical illustration of a possible anomalous behavior of the HPs and it can be used as a prescreening device for further investigations of potential medical fraud.     

Absolutely Continuous Copulas with Given Diagonal Sections

Necessary and sufficient conditions are given in order to ensure that a function δ:[0, 1] → [0, 1] is the diagonal section of an absolutely continuous copula. Explicit constructions are provided.     

Interacting multiple try algorithms with different proposal distributions

We introduce a new class of interacting Markov chain Monte Carlo (MCMC) algorithms which is designed to increase the efficiency of a modified multiple-try Metropolis (MTM) sampler. The extension with respect to the existing MCMC literature is twofold. First, the sampler proposed extends the basic MTM algorithm by allowing for different proposal distributions in the multiple-try generation step. Second, we exploit the different proposal distributions to naturally introduce an interacting MTM mechanism (IMTM) that expands the class of population Monte Carlo methods and builds connections with the rapidly expanding world of adaptive MCMC. We show the validity of the algorithm and discuss the choice of the selection weights and of the different proposals. The numerical studies show that the interaction mechanism allows the IMTM to efficiently explore the state space leading to higher efficiency than other competing algorithms.     

Designing the venue logistics management operations for a World Exposition

World Expositions, due to their size and peculiar features, pose a number of logistics challenges. This paper aims at developing a design framework for the venue logistics management (VLM) operations to replenish food products to the event site, through a combination of qualitative and quantitative research approaches. First, an in-depth interview methodology, combined with the outcomes of a literature review, is adopted for defining the key variables for the tactical and operational set-up of the VLM system. Second, a quantitative approach is developed to define the necessary logistics resources. The framework is then applied to the case of Milan 2015 World Exposition. It is the first time that such a design framework for a World Exposition is presented: the originality of this research lies in the proposal of a systematic approach that adds to the experiential practices constituting the current body of knowledge on event logistics.     

A Bootstrap Likelihood Approach to Bayesian Computation

There is an increasing amount of literature focused on Bayesian computational methods to address problems with intractable likelihood. One approach is a set of algorithms known as Approximate Bayesian Computational (ABC) methods. One of the problems with these algorithms is that their performance depends on the appropriate choice of summary statistics, distance measure and tolerance level. To circumvent this problem, an alternative method based on the empirical likelihood has been introduced. This method can be easily implemented when a set of constraints, related to the moments of the distribution, is specified. However, the choice of the constraints is sometimes challenging. To overcome this difficulty, we propose an alternative method based on a bootstrap likelihood approach. The method is easy to implement and in some cases is actually faster than the other approaches considered. We illustrate the performance of our algorithm with examples from population genetics, time series and stochastic differential equations. We also test the method on a real dataset.