Related papers: Restriction type estimates on general two-step str…
In this paper we study grouped variable selection problems by proposing a specified prior, called the nested spike and slab prior, to model collective behavior of regression coefficients. At the group level, the nested spike and slab prior…
We give a full classification of Lie algebras of specific type in complexified Clifford algebras. These sixteen Lie algebras are direct sums of subspaces of quaternion types. We obtain isomorphisms between these Lie algebras and classical…
Consider a panel data setting where repeated observations on individuals are available. Often it is reasonable to assume that there exist groups of individuals that share similar effects of observed characteristics, but the grouping is…
We consider the problem of clustering with the longest-leg path distance (LLPD) metric, which is informative for elongated and irregularly shaped clusters. We prove finite-sample guarantees on the performance of clustering with respect to…
In this paper we prove the strong consistency of several methods based on the spectral clustering techniques that are widely used to study the community detection problem in stochastic block models (SBMs). We show that under some weak…
Selective inference methods are developed for group lasso estimators for use with a wide class of distributions and loss functions. The method includes the use of exponential family distributions, as well as quasi-likelihood modeling for…
We extend the estimates proved by Donnelly and Fefferman and by Lebeau and Robbiano for sums of eigenfunctions of the Laplacian (on a compact manifold) to estimates for sums of eigenfunctions of any positive and elliptic pseudo-differential…
Latent class models are widely used for identifying unobserved subgroups from multivariate categorical data in social sciences, with binary data as a particularly popular example. However, accurately recovering individual latent class…
We classify the connected Lie subgroups of the symplectic group $Sp(2,\mathbb{R})$ whose elements are matrices in block lower triangular form. The classification is up to conjugation within $Sp(2,\mathbb{R})$. Their study is motivated by…
In a typical two-phase design, a random sample is drawn from the target population in phase 1, during which only a subset of variables is collected. In phase 2, a subsample of the phase-1 cohort is selected, and additional variables are…
We review some recent results on eigenvalues of fractional Laplacians and fractional Schr\"odinger operators. We discuss, in particular, Lieb-Thirring inequalities and their generalizations, as well as semi-classical asymptotics.
Restricted twisted Heisenberg Lie superalgebras are studied over an algebraically closed field F of characteristic p > 0. We determine the restricted structures and use the ordinary 1- and 2-cohomology spaces with trivial coefficients to…
In this paper, we compute universal estimates of eigenvalues for a class of coupled systems of elliptic differential equations in divergence form on a bounded domain in Euclidean space, which includes the well-known Lam\'e and the Laplacian…
Considered here are robust subgroup-classifier learning and testing in change-plane regressions with heavy-tailed errors, which can identify subgroups as a basis for making optimal recommendations for individualized treatment. A new…
We discuss the nearest neighbor distribution of the eigenvalues for hermitian generators in the Lie algebra of a semisimple complex Lie Group along a sequence of irreducible representations. After the basic definitions a limit theorem for…
We prove Wasserstein contraction of simple slice sampling for approximate sampling w.r.t. distributions with log-concave and rotational invariant Lebesgue densities. This yields, in particular, an explicit quantitative lower bound of the…
We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…
Spectral clustering has become one of the most popular algorithms in data clustering and community detection. We study the performance of classical two-step spectral clustering via the graph Laplacian to learn the stochastic block model.…
We give a conjectural characterisation of the stable reduction of plane quartics over local fields in terms of their Cayley octads. This results in p-adic criteria that efficiently give the stable reduction type amongst the 42 possible…
We revisit the theoretical performances of Spectral Clustering, a classical algorithm for graph partitioning that relies on the eigenvectors of a matrix representation of the graph. Informally, we show that Spectral Clustering works well as…