BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Majorization Techniques for Entropy Bounds
DTSTART:20230615T150000
DTEND:20230615T170000
DTSTAMP:20260406T192843Z
UID:18e4932b3b5a050f104490c47d66c715f3564a3a3456865590537bc8
CATEGORIES:Conferences - Seminars
DESCRIPTION:Anuj Kumar Yadav\nEDIC candidacy exam\nExam president: Prof. E
 mre Telatar\nThesis advisor: Prof. Michael Gastpar\nThesis co-advisor: Pro
 f. Yanina Shkel\nCo-examiner: Prof. Negar Kiyavash\n\nAbstract\nMajorizati
 on is a well-established mathematical concept\nthat allows us to compare t
 he relative magnitudes of two\nprobability mass functions (PMFs). It serve
 s as an ordering\nrelation\, that enables us to determine the dominance re
 lationship\nbetween the PMFs. In this report\, we will show that the\nmajo
 rization partial order forms a lattice\, indeed it is a complete\nlattice.
  Moreover\, we will delve into the fascinating properties of\nentropy on t
 he majorization lattice. Additionally\, we will explore\nhow these propert
 ies find applications\n\nBackground papers\n1. F. Cicalese and U. Vaccaro
 \, "Supermodularity and subadditivity properties of the entropy on the maj
 orization lattice\," in IEEE Transactions on Information Theory\, vol. 48
 \, no. 4\, pp. 933-938\, April 2002\, DOI: 10.1109/18.992785. [ Link: ht
 tps://ieeexplore.ieee.org/document/992785 ]\n2. I. Sason\,  "Tight Boun
 ds on the Rényi Entropy via Majorization with Applications to Guessing an
 d Compression”.  Entropy 2018\, 20\, 896. DOI: 10.3390/e20120896 .
  [Link: https://www.mdpi.com/1099-4300/20/12/896]\n3. F. Cicalese\, L. 
 Gargano and U. Vaccaro\, "An Information Theoretic Approach to Probability
  Mass Function Truncation\," 2019 IEEE International Symposium on Informa
 tion Theory (ISIT)\, Paris\, France\, 2019\, pp. 702-706\, DOI: 10.1109/IS
 IT.2019.8849355. [ Link: https://ieeexplore.ieee.org/document/8849355]\n
  
LOCATION:BC 129 https://plan.epfl.ch/?room==BC%20129
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR