Randomly Weighted Sums of Subexponential Random Variables with Application to Ruin Theory

Let {X _k , 1 k n} be n independent and real-valued random variables with common subexponential distribution function, and let {k, 1 k n} be other n random variables independent of {X _k , 1 k n} and satisfying a _k b for some 0 < a b < for all 1 k n. This paper proves that the asymptotic relations P (max_{1 m n k=1} ^m _k X _k > x) P (sum _k=1 ⁿ _k X _k > x) sum _k=1 ⁿ P ( _k X _k > x) hold as x . In doing so, no any assumption is made on the dependence structure of the sequence { _k , 1 k n}. An application to ruin theory is proposed.     

The Product of Independent Random Variables with Regularly Varying Tails

A distribution is said to have regularly varying tail with index – (0) if lim _x(kx,)/(x,)=k ^– for each k>0. Let X and Y be independent positive random variables with distributions and , respecitvely. The distribution of product XY is called Mellin–Stieltjes convolution (MS convolution) of and . It is known that D() (the class of distributions on (0,) that have regularly varying tails with index –) is closed under MS convolution. This paper deals with decomposition problem of distributions in D() related to MS convolution. A representation of a regularly varying function F of the following form is investigated: F(x)= _k=0 ^n–1 b _k f(a ^k x), where f is a measurable function and a and b _k (k=1,...,n–1) are real constants. A criterion is given for these constants in order that f be regularly varying. This criterion is applicable to show that there exist two distributions and such that neither nor belongs to D() (>0) and their MS convolution belongs to D().     

Convergence of the Gradient Projection Method for Generalized Convex Minimization

This paper develops convergence theory of the gradient projection method by Calamai and Moré (Math. Programming, vol. 39, 93–116, 1987) which, for minimizing a continuously differentiable optimization problem min{f(x) : x } where is a nonempty closed convex set, generates a sequence x_k+1 = P(x_k – _k f(x_k)) where the stepsize _k > 0 is chosen suitably. It is shown that, when f(x) is a pseudo-convex (quasi-convex) function, this method has strong convergence results: either x_k x^* and x^* is a minimizer (stationary point); or x_k arg min{f(x) : x } = , and f(x_k) inf{f(x) : x }.     

On the projected subgradient method for nonsmooth convex optimization in a Hilbert space

We consider the method for constrained convex optimization in a Hilbert space, consisting of a step in the direction opposite to an _k -subgradient of the objective at a current iterate, followed by an orthogonal projection onto the feasible set. The normalized stepsizes _k are exogenously given, satisfying _{k=0 k} = , _{k=0 k} ² < , and _k is chosen so that _{k k} for some > 0. We prove that the sequence generated in this way is weakly convergent to a minimizer if the problem has solutions, and is unbounded otherwise. Among the features of our convergence analysis, we mention that it covers the nonsmooth case, in the sense that we make no assumption of differentiability off, and much less of Lipschitz continuity of its gradient. Also, we prove weak convergence of the whole sequence, rather than just boundedness of the sequence and optimality of its weak accumulation points, thus improving over all previously known convergence results. We present also convergence rate results. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Research of this author was partially supported by CNPq grant nos. 301280/86 and 300734/95-6.     

On a Generalization of Nikolskij's Extension Theorem in the Case of Two Variables

A modification of the Nikolskij extension theorem for functions from Sobolev spaces H ^k() is presented. This modification requires the boundary to be only Lipschitz continuous for an arbitrary k however, it is restricted to the case of two-dimensional bounded domains.     

Asymptotic behavior of the dwell time distribution for a random walk on a positive semi-axis

Let ₁, ₂, ... be a sequence of independent identically distributed random variables with zero means. We consider the functional _n = _k=o ⁿ (S _k ) where S₁=0, S_k= _i=1 ^k _i (k1) and(x)=1 for x0,(x) = 0 for x<0. It is readily seen that _n is the time spent by the random walk S_n, n0, on the positive semi-axis after n steps. For the simplest walk the asymptotics of the distribution P (_n = k) for n and k, as well as for k = O(n) and k/n<1, was studied in [1]. In this paper we obtain the asymptotic expansions in powers of n^–1 of the probabilities P(h_n = nx) and P(nx_{1 n} nx₂) for 0<₁, x = k/n ₂<1, 0<₁x₁2₂<1.Translated from Matematicheskie Zametki, Vol. 15, No. 4, pp. 613–620, April, 1974.The author wishes to thank B. A. Rogozin for valuable discussions in the course of his work.     

Some functional inequalities and their Baire category properties

Summary In the paper we consider, from a topological point of view, the set of all continuous functionsf:I I for which the unique continuous solution:I – [0, ) of(f(x)) (x, (x)) and(x, (x)) (f(x)) (x, (x)), respectively, is the zero function. We obtain also some corollaries on the qualitative theory of the functional equation(f(x)) = g(x, (x)). No assumption on the iterative behaviour off is imposed.     

Stability of unconditional convergence almost everywhere

We will investigate the properties of series of functions which are unconditionally convergent almost everywhere on [0, 1]. We will establish the following theorem: If the series _k=1 f _k(x) converges unconditionally almost everywhere, then there exists a sequence {_k} ₁ ,_k , such that if _{k k} , k=1, 2,..., the series _{k=1 k}/k(x) converges unconditionally almost every-where.Translated from Mate matte heskie Zametki, Vol. 14, No. 5, pp. 645–654, November, 1973.The author wishes to thank Professor P. L. Ul'yanov for his help.     

Spline polynomials with a prescribed sequence of extrema

In the present note a theorem about strong suitability of the space of algebraic polynomials of degree n in C[a,b] (Theorem A in [1]) is generalized to the space of spline polynomials _{[a, b} ^{]n, k} (n2, 0) in C[a, b]. Namely, it is shown that the following theorem is valid: for arbitrary numbers ₀, ₁, ..., _n+k, satisfying the conditions (_i–_i–1) (_{i+1{ i}< 0(i=1, ..., n +k–1), there is a unique polynomials _n,k (t) _{[a, b} ^]/n,k and pointsa=₀,<₁<...< _n+k– 1< _n+k = b (₁1 <_n, ..., _kk<_n+k–1), such that s_n,k(_i) = _i(i=0, ..., n + k), s_n,k(_i)=0 (i=1, ..., n + k–1).Translated from Matematicheskii Zametki, Vol. 11, No. 3, pp. 251–258, March, 1972.     

Knaster's problem on continuous maps of a sphere into Euclidean space

A survey of known results and additional new ones on Knaster's problem: on the standard sphere S^n–1Rⁿ find configurations of points A₁, , A_k, such that for any continuous map fS^n–1R^m one can find a rotation a of the sphere S^n–1 such that f(a(A₁)==f(a(A_k)) and some problems closely connected with it. We study the connection of Knaster's problem with equivariant mappings, with Dvoretsky's theorem on the existence of an almost spherical section of a multidimensional convex body, and we also study the set {a S0(n)f(a(A₁))==f(a(A_k))} of solutions of Knaster's problem for a fixed configuration of points A₁, , A_kS^n–1 and a map fS^n–1R^m in general position. Unsolved problems are posed.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 167, pp. 169–178, 1987.     

Wave operators in a multistratified strip

One investigates the scattering theory for the positive self-adjoint operatorH=–· acting in with = × and a bounded open set in ^n–1,n2. The real-valued function belongs toL (), is bounded from below byc>0 and there exist real-valued functions ₁ and ₂ inL () such that – _j ,j=1,2 is a short range perturbation of _j when (–1) ^j x _n +. One assumes _j = ^(j) 1_R,j=1,2, with ^(j) L bounded from below byc>0. One proves the existence and completeness of the generalized wave operators _j ^± =s – _j e ^–itHj ,j=1,2, withH _j =–· _j and _j : equal to 1 if (–1) ^j x _n >0 and to 0 if (–1) ^j x _n <0. The ranges ofW _j ^± :=( _j ^± )^* are characterized so that W ₁ ^± =Ran and . The scattering operator can then be defined.     

Leaves in Representation Diagrams of Bipartite Distance-Regular Graphs

Let denote a bipartite distance-regular graph with diameter D 3 and valency k 3. Let ₀ > ₁ ··· > _D denote the eigenvalues of and let q ^h _ij (0 h, i, j D) denote the Krein parameters of . Pick an integer h (1 h D – 1). The representation diagram = _h is an undirected graph with vertices 0,1,...,D. For 0 i, j D, vertices i, j are adjacent in whenever i j and q ^h _ij 0. It turns out that in , the vertex 0 is adjacent to h and no other vertices. Similarly, the vertex D is adjacent to D – h and no other vertices. We call 0, D the trivial vertices of . Let l denote a vertex of . It turns out that l is adjacent to at least one vertex of . We say l is a leaf whenever l is adjacent to exactly one vertex of . We show has a nontrivial leaf if and only if is the disjoint union of two paths.     

On Riesz means with respect to a cylindric distance function

(1–) ₊ , — R ⁿ =R ^j ×R ^k , ()=max{¦ ₁¦, ¦ ₁¦},=( ₁, ₂), ₁R ^J , ₂R ^k ,j,k1,n=j+k. n=3 , (1–) ₊ [L ¹(R ⁿ )]¹, >1/2; j=4, (1–) ₊ R L ^p (R ⁿ ). .

---

---

The author would like to thank Professor W. Trebels for encouragement and valuable advice.     

Posterior Sensitivity to the Sampling Distribution and the Prior: More than One Observation

Sensitivity of a posterior quantity (f, P) to the choice of the sampling distribution f and prior P is considered. Sensitivity is measured by the range of (f, P) when f and P vary in nonparametric classes ^f and ^P respectively. Direct and iterative methods are described which obtain the range of (f, P) over f ^f when prior P is fixed, and also the overall range over f ^f and P ^P . When multiple i.i.d. observations X ₁,...,X _k are observed from f, the posterior quantity (f, P) is not a ratio-linear function of f. A method of steepest descent is proposed to obtain the range of (f, P). Several examples illustrate applications of these methods.     

Low-Frequency Spin Oscillation Branch in a System with Exchange Interaction

We find the spin oscillation branch with the frequency =(H/)(k/k _c)² in the paramagnetic phase for systems with exchange interaction in the presence of an external magnetic field .     

On the smoothness of the moduli space of mathematical instanton bundles

In this paper we prove that the moduli spaces MI _2n+1(k) of mathematical instanton bundles on ²ⁿ⁺¹ with quantum number k are singular for n 2 and k 3 ,giving a positive answer to a conjecture made by Ancona and Ottaviani in 1993.     

Hausdorff Dimension of Spectrum of One-Dimensional Schrödinger Operator with Sturmian Potentials

Let (0,1) be an irrational, and [a ₁,a ₂,...] be the continued fraction expansion of . Let H be the one-dimensional Schrödinger operator with Sturmian potentials. We show that if the potential strength V>20, then the Hausdorff dimension of the spectrum (H ) is strictly great than zero for any irrational , and is strictly less than 1 if and only if liminf _k(a ₁ a ₂a _k ))^1/k <.     

Efficiency of Proximal Bundle Methods

We give efficiency estimates for proximal bundle methods for finding f_*min_Xf, where f and X are convex. We show that, for any accuracy <0, these methods find a point x^kX such that f(x^k)–f^* after at most k=O(1/³) objective and subgradient evaluations.     

A sandwich theorem and Hyers—Ulam stability of affine functions

It is shown that two real functionsf andg, defined on a real intervalI, satisfy the inequalitiesf(x + (1 – )y) g(x) + (1 – )g(y) andg(x + (1 – )y) f(x) + (1 – )f(y) for allx, y I and [0, 1], iff there exists an affine functionh: I such thatf h g. As a consequence we obtain a stability result of Hyers—Ulam type for affine functions.     

On a problem of Erdős and Lovász: Random lines in a projective plane

Letn(k) be the least size of an intersecting family ofk-sets with cover numberk, and let _k denote any projective plane of orderk–1.Theorem There is a constant A such that ifH is a random set ofm Aklogk lines from _k then P_r(H<)0(k).Corollary If there exists a _k thenn(k)=O(klogk). These statements were conjectured by P. Erds and L. Lovász in 1973.Supported in part by NSF-DMS87-83558 and AFOSR grants 89-0066, 89-0512 and 90-0008