200 citations · 675 across the 45 of their papers we have counts for
5 papers · 1 filter
A Sufficient Condition for a Unique Invariant Distribution of a Higher-Order Markov Chain
Bernhard C. Geiger
We derive a sufficient condition for a -th order homogeneous Markov chain with finite alphabet to have a unique invariant distribution on $\mathcal{Z}…
A Rate-Distortion Approach to Caching
Roy Timo, Shirin Saeedi Bidokhti, Michèle Wigger +1
This paper takes a rate-distortion approach to understanding the information-theoretic laws governing cache-aided communications systems. Specifically, we characterise the optimal…
Hard Clusters Maximize Mutual Information
Bernhard C. Geiger, Rana Ali Amjad
In this paper, we investigate mutual information as a cost function for clustering, and show in which cases hard, i.e., deterministic, clusters are optimal. Using convexity propert…
Higher-Order Kullback-Leibler Aggregation of Markov Chains
Bernhard C. Geiger, Yuchen Wu
We consider the problem of reducing a first-order Markov chain on a large alphabet to a higher-order Markov chain on a small alphabet. We present information-theoretic cost functio…
Greedy Algorithms for Optimal Distribution Approximation
Bernhard C. Geiger, Georg Böcherer
The approximation of a discrete probability distribution by an -type distribution is considered. The approximation error is measured by the information…