We describe a detailed computational procedure which, given data values at arbitrarily distributed points in the plane, determines if the data are convex and, if so, constructs a smooth convex surface that interpolates the data. The method consists of constructing a triangulation of the nodes (data abscissae) for which the triangle-based piecewise linear interpolant is convex, computing a set o...

This article describes the quenched localisation behaviour of the Bouchaud trap model on the integers with regularly varying traps. In particular, it establishes that for almost every trapping landscape there exist arbitrarily large times at which the system is highly localised on one site, and also arbitrarily large times at which the system is completely delocalised. §

We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In this way, we obtain single-letter characterizations of the entanglement-assisted classical capacities for both channel models. Moreover, we show that the ent...

This paper investigates performance limitations imposed by 'non-minimum phase' characteristics of a nonlinear time-varying plant. A performance criterion is defined which, in the linear case, is analogous to minimizing the sensitivity over a given frequency band. It is shown that if the nonlinear plant is 'non-minimum phase', then the frequency-weighted sensitivity cannot be made arbitrarily sm...