报告题目：
Generalizing Körner’s graph entropy to graphons
报告时间：
2023年7月19日 15:30-16:30
报告地点：
腾讯会议室 ID：813 9361 1619
报告人：
Viktor Harangi
报告人简介：
Viktor Harangi received his Ph.D. in mathematics from ELTE Eötvös University in 2011. After a postdoctoral fellowship at University of Toronto, he returned to Budapest, Hungary, and is a researcher at the Rényi Institute.
报告简介：
Generalizations of graph entropyConditional graph entropy is known to be the minimal rate for a natural functional compression problem with side information at the receiver. Recently it turned out that it can be formulated as an alternating minimization problem. This gives rise to a simple iterative algorithm for numerically computing conditional graph entropy. We also discuss its connection to convex corners.Furthermore, we generalize graph entropy to infinite/measurable alphabets. We call the resulting notion graphon entropy. We provide an upper bound and a lower bound which actually coincide under mild conditions and hence precisely determine the entropy in question. Joint work with Xueyan Niu and Bo Bai.
