Inspired by the graph Laplacian and the point integral method, we introduce a novel weighted graph Laplacian method to compute a smooth interpolation function on a point cloud in high dimensional space. The numerical results in semi-supervised learning and image inpainting show that the weighted graph Laplacian is a reliable and efficient interpolation method. In addition, it is easy to implement and faster than graph Laplacian.

A Sobolev space in several variables in an$L$^{1}-type norm is not complemented in its second dual. Hence it is not isomorphic as a Banach space to any complemented subspace of a Banach lattice.

In linear regression of Y on X(∈ R^p) with parameters 𝛽(∈ R^{p+1}), statistical inference is unreliable when observations are obtained from gross-error model, F_{ϵ,G} = (1 − ϵ)F + ϵG, instead of the assumed probability F;G is gross-error probability, 0 < ϵ < 1. Residual’s influence index (RINFIN) at (x, y) is introduced, with components measuring also the local influence of x in the residual and large value flagging a bad leverage case (from G), thus causing unmasking. Large sample properties of RINFIN are presented to confirm significance of the findings, but often the large difference in the RINFIN scores of the data is indicative. RINFIN is successful with microarray data, simulated, high dimensional data and classic regression data sets. RINFIN’s performance improves as p increases and can be used in multiple response linear regression.

No abstract uploaded!

The entropy of a hypersurface is a geometric invariant that measures complexity and is invariant under rigid motions and dilations. It is given by the supremum over all Gaussian integrals with varying centers and scales. It is monotone under mean curvature flow, thus giving a Lyapunov functional. Therefore, the entropy of the initial hypersurface bounds the entropy at all future singularities. We show here that not only does the round sphere have the lowest entropy of any closed singularity, but there is a gap to the second lowest.