The SC property of an expected residual function arising from stochastic complementarity problems

The stochastic nonlinear complementarity problem has been recently reformulated as an expected residual minimization problem which minimizes an expected residual function defined by an NCP function. In this work, we show that the expected residual function defined by the Fischer–Burmeister function is an function.     

Incomplete data problems in X-ray computerized tomography

Summary In the present paper we study truncated projections for the fanbeam geometry in computerized tomography. First we derive consistency conditions for the divergent beam transform. Then we study a singular value decomposition for the case where only the interior rays in the fan are provided, as for example in region-of-interest tomography. We show that the high angular frequency components of the searched-for densities are well determined and we present reconstructions from real data where the missing information is approximated based on the singular value decomposition.The work of the authors was supported by the Deutsche Forschungsgemeinschaft under grant Lo 310/2-4     

Orthogonal Newton polynomials

The problem is to determine all nonnegative measures on the Borel subsets of the complex plane with respect to which all polynomials are square integrable and with respect to which the Newton polynomials form an orthogonal set. The Newton polynomials do not belong to any classical scheme of orthogonal polynomials. The discovery that a plane measure exists with respect to which they form an orthogonal set was only recently made by T. L. Kriete and D. Trutt [Amer. J. Math.93 (1971), 215–225]. A general structure theory for such measures is now obtained under hypotheses suggested by the expansion theory of Cesàro operators.     

A Geometric Problem and the Hopf Lemma. Ⅱ

Abstract A classical result of A. D. Alexandrov states that a connected compact smooth n-dimensional manifold without boundary, embedded in ℝⁿ⁺¹, and such that its mean curvature is constant, is a sphere. Here we study the problem of symmetry of M in a hyperplane X_n+1 =constant in case M satisfies: for any two points (X′,X_n+1), on M, with , the mean curvature at the first is not greater than that at the second. Symmetry need not always hold, but in this paper, we establish it under some additional conditions. Some variations of the Hopf Lemma are also presented. Several open problems are described. Part I dealt with corresponding one dimensional problems. (Dedicated to the memory of Shiing-Shen Chern) * Partially supported by NSF grant DMS-0401118.     

On diameter critical graphs

A graph G is diameter k-critical if the graph has diameter k and the deletion of any edge increases its diameter. We show that every diameter 2-critical graph on v vertices has (i) at most 0.27v² edges, and (ii) average edge degree at most $\text{6}\text{5}$v. We also make a conjecture on the maximal number of edges in a diameter k-critical graph.     

A non-uniform Berry–Esseen bound via Stein's method

This paper is part of our efforts to develop Stein's method beyond uniform bounds in normal approximation. Our main result is a proof for a non-uniform Berry–Esseen bound for independent and not necessarily identically distributed random variables without assuming the existence of third moments. It is proved by combining truncation with Stein's method and by taking the concentration inequality approach, improved and adapted for non-uniform bounds. To illustrate the technique, we give a proof for a uniform Berry–Esseen bound without assuming the existence of third moments. Received: 2 March 2000 / Revised version: 20 July 2000 / Published online: 26 April 2001     

Geometry of the Space of Phylogenetic Trees

We consider a continuous space which models the set of all phylogenetic trees having a fixed set of leaves. This space has a natural metric of nonpositive curvature, giving a way of measuring distance between phylogenetic trees and providing some procedures for averaging or combining several trees whose leaves are identical. This geometry also shows which trees appear within a fixed distance of a given tree and enables construction of convex hulls of a set of trees. This geometric model of tree space provides a setting in which questions that have been posed by biologists and statisticians over the last decade can be approached in a systematic fashion. For example, it provides a justification for disregarding portions of a collection of trees that agree, thus simplifying the space in which comparisons are to be made.     

Is-ClusterMPP: clustering algorithm through point processes and influence space towards high-dimensional data

Advances in Data Analysis and Classification - Clustering via marked point processes and influence space, Is-ClusterMPP, is a new unsupervised clustering algorithm through adaptive MCMC sampling of...