Zobrazeno 1 - 10
of 277
pro vyhledávání: '"Sason, Igal"'
Autor:
Sason, Igal
Publikováno v:
AIMS Mathematics, 9 (2024), no. 6, pp. 15385--15468, April 2024
This paper delves into three research directions, leveraging the Lov\'{a}sz $\vartheta$-function of a graph. First, it focuses on the Shannon capacity of graphs, providing new results that determine the capacity for two infinite subclasses of strongl
Externí odkaz:
http://arxiv.org/abs/2310.19169
Autor:
Sason, Igal
Publikováno v:
Entropy, vol. 25, no. 1, paper 104, pp. 1-41, January 2023
This paper provides new observations on the Lov\'{a}sz $\theta$-function of graphs. These include a simple closed-form expression of that function for all strongly regular graphs, together with upper and lower bounds on that function for all regular
Externí odkaz:
http://arxiv.org/abs/2301.02820
Autor:
Sason, Igal
The present paper offers, in its first part, a unified approach for the derivation of families of inequalities for set functions which satisfy sub/supermodularity properties. It applies this approach for the derivation of information inequalities wit
Externí odkaz:
http://arxiv.org/abs/2204.13410
Autor:
Sason, Igal
This work considers new entropy-based proofs of some known, or otherwise refined, combinatorial bounds for bipartite graphs. These include upper bounds on the number of the independent sets, lower bounds on the minimal number of colors in constrained
Externí odkaz:
http://arxiv.org/abs/2106.07336
Autor:
Graczyk, Robert, Sason, Igal
Stationary memoryless sources produce two correlated random sequences $X^n$ and $Y^n$. A guesser seeks to recover $X^n$ in two stages, by first guessing $Y^n$ and then $X^n$. The contributions of this work are twofold: (1) We characterize the least a
Externí odkaz:
http://arxiv.org/abs/2104.04586
Autor:
Sason, Igal
This work provides data-processing and majorization inequalities for $f$-divergences, and it considers some of their applications to coding problems. This work also provides tight bounds on the R\'{e}nyi entropy of a function of a discrete random var
Externí odkaz:
http://arxiv.org/abs/2103.16901
Autor:
Sason, Igal
This paper studies the problem of upper bounding the number of independent sets in a graph, expressed in terms of its degree distribution. For bipartite regular graphs, Kahn (2001) established a tight upper bound using an information-theoretic approa
Externí odkaz:
http://arxiv.org/abs/2012.12107
Autor:
Merhav, Neri, Sason, Igal
This work is an extension of our earlier article, where a well-known integral representation of the logarithmic function was explored, and was accompanied with demonstrations of its usefulness in obtaining compact, easily-calculable, exact formulas f
Externí odkaz:
http://arxiv.org/abs/2005.05795
Autor:
Nishiyama, Tomohiro, Sason, Igal
The relative entropy and chi-squared divergence are fundamental divergence measures in information theory and statistics. This paper is focused on a study of integral relations between the two divergences, the implications of these relations, their i
Externí odkaz:
http://arxiv.org/abs/2004.11197