arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2305.01459cs.ITmath.IT
收藏

互补图熵、AND积与图的不交并

Complementary Graph Entropy, AND Product, and Disjoint Union of Graphs

Nicolas Charpenay, Maël le Treust, Aline Roumy

AI总结:

该研究针对零误差Slepian-Wolf信源编码中互补图熵无通用单字母公式的问题,推导了AND积图与不交并图互补图熵的结构等价关系,明确了二者可线性化情形的一致性,并求出了几类非完美图的互补图熵。

摘要:

在零误差Slepian-Wolf信源编码问题中,最优速率由特征图的互补图熵$\u001e{H}$(overline{H)给出。除完美图、均匀分布的五边形图$G_5$及其不交并外,它没有单字母公式。我们研究两种特定情形:特征图分别表示为AND积$\u2227$与不交并$\u2294$。我们推导了一个结构结果,将$\u001e{H}(\u2227 \u00b7)$与$\u001e{H}(\u2294 \u00b7)$在相差一个乘法常数的意义下等价,这带来两个结论。首先,我们证明$\u001e{H}(\u2227 \u00b7)$与$\u001e{H}(\u2294 \u00b7)$可线性化的情形是一致的。其次,我们确定了此前未知情形下的$\u001e{H}$:完美图的积;以及当$G$为完美图时的$G_5 \u2227 G$,这利用了Tuncel等人关于$\u001e{H}(G_5 \u2294 G)$的结果。这些情形下的图通常不是完美图。

英文摘要:

In the zero-error Slepian-Wolf source coding problem, the optimal rate is given by the complementary graph entropy $\overline{H}$ of the characteristic graph. It has no single-letter formula, except for perfect graphs, for the pentagon graph with uniform distribution $G_5$, and for their disjoint union. We consider two particular instances, where the characteristic graphs respectively write as an AND product $\wedge$, and as a disjoint union $\sqcup$. We derive a structural result that equates $\overline{H}(\wedge \: \cdot)$ and $\overline{H}(\sqcup \: \cdot)$ up to a multiplicative constant, which has two consequences. First, we prove that the cases where $\overline{H}(\wedge \:\cdot)$ and $\overline{H}(\sqcup \: \cdot)$ can be linearized coincide. Second, we determine $\overline{H}$ in cases where it was unknown: products of perfect graphs; and $G_5 \wedge G$ when $G$ is a perfect graph, using Tuncel et al.'s result for $\overline{H}(G_5 \sqcup G)$. The graphs in these cases are not perfect in general.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑