835 research outputs found
Recommended from our members
GeD spline estimation of multivariate Archimedean copulas
A new multivariate Archimedean copula estimation method is proposed in a non-parametric setting. The method uses the so called Geometrically Designed splines (GeD splines), recently introduced by Kaishev et al. (2006 a,b) [10] and [11], to represent the cdf of a random variable Wµ, obtained through the probability integral transform of an Archimedean copula with parameter µ. Sufficient conditions for the GeD spline estimator to posses the properties of the underlying theoretical cdf, K(µ; t), of Wµ, are given. The latter conditions allow for defining a three-step estimation procedure for solving the resulting non-linear regression problem with linear inequality constraints. In the proposed procedure,finding the number and location of the knots and the coefficients of the unconstrained GeD spline estimator and solving the constraint least-squares optimisation problem, are separated. Thus, the resulting spline estimator ^K (^µ; t) is used to recover the generator and the related Archimedean copula by solving an ordinary differential equation. The proposed method is truly multivariate, it brings about numerical efficiency and as a result can be applied with large volumes of data and for dimensions d ¸ 2, as illustrated by the numerical examples presented
Recommended from our members
Archimedean copulas derived from Morgenstern utility functions
The (additive) generator of an Archimedean copula - as well as the inverse of the generator - is a strictly decreasing and convex function, while Morgenstern utility functions (applying to risk averse decision makers) are nondecreasing and concave. This provides a basis for deriving either a generator of Archimedean copulas, or its inverse, from a Morgenstern utility function. If we derive the generator in this way, dependence properties of an Archimedean copula that are often taken to be desirable, match with generally sought after properties of the corresponding utility function. It is shown how well known copula families are derived from established utility functions. Also, some new copula families are derived, and their properties are discussed. If, on the other hand, we instead derive the inverse of the generator from the utility function, there is a link between the magnitude of measures of risk attitude (like the very common Arrow-Pratt coefficient of absolute risk aversion) and the strength of dependence featured by the corresponding Archimedean copula
Modelling stochastic bivariate mortality
Stochastic mortality, i.e. modelling death arrival via a jump process with stochastic intensity, is gaining increasing reputation as a way to represent mortality risk. This paper represents a first attempt to model the mortality risk of couples of individuals, according to the stochastic intensity approach.
On the theoretical side, we extend to couples the Cox processes set up, i.e. the idea that mortality is driven by a jump process whose intensity is itself a stochastic process, proper of a particular generation within each gender. Dependence between the survival times of the members of a couple is captured by an Archimedean copula.
On the calibration side, we fit the joint survival function by calibrating separately the (analytical) copula and the (analytical) margins. First, we select the best fit copula according to the methodology of Wang and Wells (2000) for censored data. Then, we provide a sample-based calibration for the intensity, using a time-homogeneous, non mean-reverting, affine process: this gives the analytical marginal survival functions. Coupling the best fit copula with the calibrated margins we obtain, on a sample generation, a joint survival function which incorporates the stochastic nature of mortality improvements and is far from representing independency.On the contrary, since the best fit copula turns out to be a Nelsen one, dependency is increasing with age and long-term dependence exists
Upper bounds for packings of spheres of several radii
We give theorems that can be used to upper bound the densities of packings of
different spherical caps in the unit sphere and of translates of different
convex bodies in Euclidean space. These theorems extend the linear programming
bounds for packings of spherical caps and of convex bodies through the use of
semidefinite programming. We perform explicit computations, obtaining new
bounds for packings of spherical caps of two different sizes and for binary
sphere packings. We also slightly improve bounds for the classical problem of
packing identical spheres.Comment: 31 page
- …