Related papers: H\"older-type inequalities and their applications …

We provide a systematic approach to deal with the following problem. Let $X_1,\ldots,X_n$ be, possibly dependent, $[0,1]$-valued random variables. What is a sharp upper bound on the probability that their sum is significantly larger than…

We derive sufficient conditions for a probability measure on a finite product space (a spin system) to satisfy a (modified) logarithmic Sobolev inequality. We establish these conditions for various examples, such as the (vertex-weighted)…

Let $\chi(G)$ denote the chromatic number of a graph and $\chi_v(G)$ denote the vector chromatic number. For all graphs $\chi_v(G) \le \chi(G)$ and for some graphs $\chi_v(G) \ll \chi(G)$. Galtman proved that Hoffman's well-known lower…

It is known that the inequality $$ \frac{\chi(G)(\chi(G)-1)}{2} + |V| - \chi(G) \leq |E|$$ holds for all connected graphs, where $\chi(G)$ denotes the chromatic number of $G$. We prove that equality holds whenever the graph consists of a…

With a graph $G=(V,E)$ we associate a collection of non-negative real weights $\cup_{v\in V}{\lambda_{i,v}:1\leq i \leq m} \cup \cup_{uv \in E} {\lambda_{ij,uv}:1\leq i \leq j \leq m}$. We consider the probability distribution on…

We establish concentration inequalities for Lipschitz functions of dependent random variables, whose dependencies are specified by forests. We also give concentration results for decomposable functions, improving Janson's Hoeffding-type…

We extend recent higher order concentration results in the discrete setting to include functions of possibly dependent variables whose distribution (on the product space) satisfies a logarithmic Sobolev inequality with respect to a…

We give a simple proof of a generalization of an inequality for homomorphism counts by Sidorenko (1994). A special case of our inequality says that if $d_v$ denotes the degree of a vertex $v$ in a graph $G$ and $\textrm{Hom}_\Delta(H, G)$…

We show that the inequality $H(A \mid B,X) + H(A \mid B,Y) \le H(A\mid B)$ for jointly distributed random variables $A,B,X,Y$, which does not hold in general case, holds under some natural condition on the support of the probability…

We present new scalar and matrix Chernoff-style concentration bounds for a broad class of probability distributions over the binary hypercube $\{0,1\}^n$. Motivated by recent tools developed for the study of mixing times of Markov chains on…

We give a distribution-dependent concentration inequality for functions of independent variables. The result extends Bernstein's inequality from sums to more general functions, whose variation in any argument does not depend too much on the…

In this paper we prove multilevel concentration inequalities for bounded functionals $f = f(X_1, \ldots, X_n)$ of random variables $X_1, \ldots, X_n$ that are either independent or satisfy certain logarithmic Sobolev inequalities. The…

Let $G$ be a graph and let $g, f$ be nonnegative integer-valued functions defined on $V(G)$ such that $g(v) \le f(v)$ and $g(v) \equiv f(v) \pmod{2}$ for all $v \in V(G)$. A $(g,f)$-parity factor of $G$ is a spanning subgraph $H$ such that…

Let V_E be the pluricomplex Green function associated to a compact subset E of C^N. The well known H\"older Continuity Property of E means that there exist constants B > 0, 0< c =< 1 such that V_E(z) =< B dist(z,E)^c. The main result of…

In this paper, we extend two classical results about the density of subgraphs of hypercubes to subgraphs $G$ of Cartesian products $G_1\times\cdots\times G_m$ of arbitrary connected graphs. Namely, we show that $\frac{|E(G)|}{|V(G)|}\le…

We propose algebraic criteria that yield sharp H\"{o}lder types of inequalities for the product of functions of Gaussian random vectors with arbitrary covariance structure. While our lower inequality appears to be new, we prove that the…

Building on the inequalities for homogeneous tetrahedral polynomials in independent Gaussian variables due to R. Lata{\l}a we provide a concentration inequality for non-necessarily Lipschitz functions $f\colon \R^n \to \R$ with bounded…

We study the enumeration of graph orientations under local degree constraints. Given a finite graph $G = (V, E)$ and a family of admissible sets $\{\mathsf P_v \subseteq \mathbb{Z} : v \in V\}$, let $\mathcal N (G; \prod_{v \in V} \mathsf…

In this article we take a probabilistic look at H\"older's inequality, considering the ratio of terms in the classical H\"older inequality for random vectors in $\mathbb{R}^n$. We prove a central limit theorem for this ratio, which then…

For a real-valued measurable function $f$ and a nonnegative, nondecreasing function $\phi$, we first obtain a Chebyshev type inequality which provides an upper bound for $\displaystyle \phi(\lambda_{1}) \mu(\{x \in \Omega : f(x) \geq…