相关论文: Efficient sphere-covering and converse measure con…
Composite likelihood provides approximate inference when the full likelihood is intractable and sub-likelihood functions of marginal events can be evaluated relatively easily. It has been successfully applied for many complex models.…
Survey propagation (SP) is an exciting new technique that has been remarkably successful at solving very large hard combinatorial problems, such as determining the satisfiability of Boolean formulas. In a promising attempt at understanding…
We investigate, by "a la Marcinkiewicz" techniques applied to the (asymptotic) density function, how dense systems of equal spheres of $\rb^{n}, n \geq 1,$ can be partitioned at infinity in order to allow the computation of their density as…
The problem of finding the most efficient way to pack spheres has an illustrious history, dating back to the crystalline arrays conjectured by Kepler and the random geometries explored by Bernal in the 60's. This problem finds applications…
In this paper, I shall demonstrate that sufficiently high-dimensional closed positively-curved Riemannian manifolds are either diffeomorphic to a spherical space form, or isometric to a locally compact rank one symmetric space. This…
We consider the space of complete and separable metric spaces which are equipped with a probability measure. A notion of convergence is given based on the philosophy that a sequence of metric measure spaces converges if and only if all…
We show how to store good approximations of probability distributions in small space.
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set L. We investigate how well L-cycle covers of minimum weight…
Let $M_n^{(k)}$ denote the $k$th largest maximum of a sample $(X_1,X_2,...,X_n)$ from parent $X$ with continuous distribution. Assume there exist normalizing constants $a_n>0$, $b_n\in \mathbb{R}$ and a nondegenerate distribution $G$ such…
Maximum likelihood estimation of a log-concave probability density is formulated as a convex optimization problem and shown to have an equivalent dual formulation as a constrained maximum Shannon entropy problem. Closely related maximum…
The cone-volume measure of a polytope with centroid at the origin is proved to satisfy the subspace concentration condition. As a consequence a conjectured (a dozen years ago) fundamental sharp affine isoperimetric inequality for the…
This paper discusses the approximation by de la Vall\'{e}e Poussin means $V_nf$ on the unit sphere. Especially, the lower bound of approximation is studied. As a main result, the strong converse inequality for the means is established.…
Finding the optimal random packing of non-spherical particles is an open problem with great significance in a broad range of scientific and engineering fields. So far, this search has been performed only empirically on a case-by-case basis,…
Compressive sensing (CS) combines data acquisition with compression coding to reduce the number of measurements required to reconstruct a sparse signal. In optics, this usually takes the form of projecting the field onto sequences of random…
The theorem of Shannon-McMillan-Breiman states that for every generating partition on an ergodic system, the exponential decay rate of the measure of cylinder sets equals the metric entropy almost everywhere (provided the entropy is…
We consider the problem of covering hypersphere by a set of spherical hypercaps. This sort of problem has numerous practical applications such as error correcting codes and reverse k-nearest neighbor problem. Using the reduction of non…
In this paper we describe a theory of a cumulative distribution function on a space with an order from a probability measure defined in this space. This distribution function plays a similar role to that played in the classical case.…
The density of a code is the fraction of the coding space covered by packing balls centered around the codewords. This paper investigates the density of codes in the complex Stiefel and Grassmann manifolds equipped with the chordal…
This paper demonstrates that random, independently chosen equi-dimensional subspaces with a unitarily invariant distribution in a real Hilbert space provide nearly tight, nearly equiangular fusion frames. The angle between a pair of…
We prove a quantitative rigidity result for almost constant mean curvature spheres in $\mathbb{R}^3$. Under a sub--two--sphere Willmore bound and a small $L^2$--CMC defect, we show that an almost--CMC surface is close to the round sphere,…