No abstract uploaded!

We present a framework for solving the large-scale \ell_1-regularized convex minimization problem:<div class="gsh_dspfr">\ell_1

We study a charged two-dimensional particle confined to a straight parabolic-potential channel and exposed to a homogeneous magnetic field under the influence of a potential perturbation W. If W is bounded and periodic along the channel, a perturbative argument yields the absolute continuity of the bottom of the spectrum. We show that it can have any finite number of open gaps provided that the confining potential is sufficiently strong. However, if W depends on the periodic variable only, we prove by the Thomas argument that the whole spectrum is absolutely continuous, irrespective of the size of the perturbation. On the other hand, if W is small and satisfies a weak localization condition in the the longitudinal direction, we prove by the Mourre method that a part of the absolutely continuous spectrum persists.

The paper studies estimation of partially linear hazard regression models with varying coefficients for multivariate survival data. A profile pseudopartiallikelihood estimation method is proposed. The estimation of the parameters of the linear part is accomplished via maximization of the profile pseudopartiallikelihood, whereas the varyingcoefficient functions are considered as nuisance parameters that are profiled out of the likelihood. It is shown that the estimators of the parameters are root <i>n</i> consistent and the estimators of the nonparametric coefficient functions achieve optimal convergence rates. Asymptotic normality is obtained for the estimators of the finite parameters and varyingcoefficient functions. Consistent estimators of the asymptotic variances are derived and empirically tested, which facilitate inference for the model. We prove that the varyingcoefficient functions can be estimated as well as if the

We consider a graph G and a covering G of G and we study the relations of their eigenvalues and heat kernels. We evaluate the heat kernel for an infinite k-regular tree and we examine the heat kernels for general k-regular graphs. In particular, we show that a k-regular graph on n vertices has at most (1+ o (1)) 2 log n knlog k