Mixture models for hazard rate functions are widely used tools for addressing the statistical analysis of survival data subject to a censoring mechanism. The present article introduced a new class of vectors of random hazard rate functions that are expressed as kernel mixtures of dependent...

Mixture models for hazard rate functions are widely used tools for addressing the statistical analysis of survival data subject to a censoring mechanism. The present paper introduces a new class of vectors of random hazard rate functions that are expressed as kernel mixtures of dependent...

The paper proposes a new nonparametric prior for two-dimensional vectors of survival functions (S1,S2). The definition we introduce is based on the notion of Lévy copula and it will be used to model, in a nonparametric Bayesian framework, two-sample survival data. Such an application will yield...

Move-to-front rule is a heuristic updating a list of n items according to requests. Items are required with unknown probabilities (or ppopularities). The induced Markov chain is known to be ergodic [4]. One main problem is the study of the distribution of the search cost defined as the position...

The definition of vectors of dependent random probability measures is a topic of interest in applications to Bayesian statistics. They, indeed, represent dependent nonparametric prior distributions that are useful for modelling observables for which specific covariate values are known. In this...

The paper proposes a new nonparametric prior for two–dimensional vectors of survival functions (S1, S2). The definition we introduce is based on the notion of L´evy copula and it will be used to model, in a nonparametric Bayesian framework, two–sample survival data. Such an application will...

Random probability vectors are of great interest especially in view of their application to statistical inference. Indeed, they can be used for determining the de Finetti mixing measure in the representation of the law of a partially exchangeable array of random elements taking values in a...

Move-to-front rule is a heuristic updating a list of n items according to requests. Items are required with unknown probabilities (or popularities). The induced Markov chain is known to be ergodic. A main problem is the study of the distribution of the search cost defined as the position of the...

Move-to-front rule is a heuristic updating a list of n items according to requests. Items are required with unknown probabilities (or popularities). The induced Markov chain is known to be ergodic. One main problem is the study of the distribution of the search cost defined as the position of...