Related papers: Graph Convex Hull Bounds as generalized Jensen Ine…
Spaces of convex and concave functions appear naturally in theory and applications. For example, convex regression and log-concave density estimation are important topics in nonparametric statistics. In stochastic portfolio theory, concave…
The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…
Often in the analysis of first-order methods for both smooth and nonsmooth optimization, assuming the existence of a growth/error bound or KL condition facilitates much stronger convergence analysis. Hence separate analysis is typically…
Let $V$ be a finite nonempty set. A transit function is a map $R:V\times V\rightarrow 2^V$ such that $R(u,u)=\{u\}$, $R(u,v)=R(v,u)$ and $u\in R(u,v)$ hold for every $u,v\in V$. A set $K\subseteq V$ is $R$-convex if $R(u,v)\subset K$ for…
In this paper we prove results on the difference between a normalized Jensen functional and the sum of other normalized Jensen functionals for convex function.
In this paper, we give the refinement of an extension of Jensen's inequality to affine combinations. Furthermore, we present the functional form of Jensen's inequality for continuous 3-convex functions of one variable at a point.
A set S of vertices of a connected graph G is convex, if for any pair of vertices u; v 2 S, every shortest path joining u and v is contained in S . The convex hull CH(S) of a set of vertices S is defined as the smallest convex set in G…
For every given real value of the ratio $\mu:=A_X/G_X>1$ of the arithmetic and geometric means of a positive random variable $X$ and every real $v>0$, exact upper bounds on the right- and left-tail probabilities $\mathsf{P}(X/G_X\ge v)$ and…
In this article we show the following result: if $C$ is an $n$-dimensional convex and compact subset, $f:C\rightarrow[0,\infty)$ is concave, and $\phi:[0,\infty)\rightarrow[0,\infty)$ is a convex function with $\phi(0)=0$, we then…
In this work, we introduce and develop a theory of convex drawings of the complete graph $K_n$ in the sphere. A drawing $D$ of $K_n$ is convex if, for every 3-cycle $T$ of $K_n$, there is a closed disc $\Delta_T$ bounded by $D[T]$ such…
This paper aims at studying the sample complexity of graph convolutional networks (GCNs), by providing tight upper bounds of Rademacher complexity for GCN models with a single hidden layer. Under regularity conditions, theses derived…
We study a family of inequalities on pairs of measure spaces involving functions defined on product domains. Our main result establishes a Jensen-type inequality under a general product-measure framework, extending classical inequalities…
In this paper we revisit a theorem by Rockafellar on representing the relative interior of the graph of a convex set-valued mapping in terms of the relative interior of its domain and function values. Then we apply this theorem to provide a…
We study the convex-hull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, location-based services and computer vision. In our framework, the…
Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…
The softmax function is a ubiquitous component at the output of neural networks and increasingly in intermediate layers as well. This paper provides convex lower bounds and concave upper bounds on the softmax function, which are compatible…
It is shown that, given a point $x\in\mathbbm{R}^d$, $d\ge 2$, and open sets $U_1,...,U_k$ containing $x$, any convex combination of the harmonic measures for $x$ with respect to $U_n$, $1\le n\le k$, is the limit of a sequence of harmonic…
The inducibility of a graph $H$ measures the maximum number of induced copies of $H$ a large graph $G$ can have. Generalizing this notion, we study how many induced subgraphs of fixed order $k$ and size $\ell$ a large graph $G$ on $n$…
In this note, as a particular case of a more general result, we obtain the following theorem: Let $\Omega\subseteq {\bf R}^n$ be a non-empty bounded open set and let $f:\overline {\Omega}\to {\bf R}^n$ be a continuous function which is…
A \emph{thrackle} is a graph drawn in the plane so that every pair of its edges meet exactly once, either at a common end vertex or in a proper crossing. Conway's thrackle conjecture states that the number of edges is at most the number of…