We study the posterior contraction behavior of the latent population structure that arises in admixture models as the amount of data increases. An admixture model — alternatively known as a topic model — specifies k populations, each of which is characterized by a ∆-valued vector of frequencies for generating a set of discrete values in {0, 1, . . . , d}. The population polytope is defined as t...

Let V be a finite set and M a collection of subsets of V . Then M is an alignment of V if and only if M is closed under taking intersections and contains both V and the empty set. If M is an alignment of V , then the elements of M are called convex sets and the pair (V,M) is called an alignment or a convexity. If S ⊆ V , then the convex hull of S is the smallest convex set that contains S. Supp...

A jump system is a set of integer points with an exchange property, which is a generalization of a matroid, a delta-matroid, and a base polyhedron of an integral polymatroid (or a submodular system). Recently, the concept of M-convex functions on constant-parity jump systems is introduced by Murota as a class of discrete convex functions that admit a local criterion for global minimality. M-con...

Some new Jensen’s type inequalities for di¤erentiable log-convex functions of selfadjoint operators in Hilbert spaces under suitable assumptions for the involved operators are given. Applications for particular cases of interest are also provided. 1. Introduction Jensen’s inequality for convex functions is one of the most important result in the Theory of Inequalities due to the fact that many ...

The nearest point problem (NPP), i.e., finding the closest points between two disjoint convex hulls, has two classical solutions, the Gilbert–Schlesinger–Kozinec (GSK) and Mitchell–Dem’yanov–Malozemov (MDM) algorithms. When the convex hulls do intersect, NPP has to be stated in terms of reduced convex hulls (RCHs), made up of convex pattern combinations whose coefficients are bound by a mo1 val...

Induction (or transformation) by bipartite graphs is one of the most important operations on matroids, and it is well known that the induction of a matroid by a bipartite graph is again a matroid. As an abstract form of this fact, the induction of a matroid by a linking system is known to be a matroid. M-convex functions are quantitative extensions of matroidal structures, and they are known as...

‎in this paper‎, ‎generalized convex contractions on orthogonal metric spaces are stablished in whath might be called their definitive versions‎. ‎also, we show that‎ there are examples which show that our main theorems are genuine generalizations of theorem 3.1 and 3.2 of cite{r}‎[ m.a. miandaragh, m. postolache, s. rezapour, ‎textit{approximate fixed points of generalizedconvex contractions},...

In this paper, we give the correlation and difference between M-convex fuzzy process and SLW-convex fuzzy process, and present some basic properties of these convex fuzzy processes, which improve some known results about the connection between those convex fuzzy processes and their graphs. In addition, we introduce a new notion of s-convex fuzzy process as a generalization of M-convex fuzzy pro...