4 citations · 6 across the 6 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2026
An Information-theoretic Analysis of Edge-reinforced Random Walks
Qinghua, Ding, Venkat Anantharam
Reinforced random walks are random walks on graphs whose transition probabilities along edges from a vertex are proportional to the weights of those edges, but where the weight of…
cs.IT2023
A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs
Payam Delgosha, Venkat Anantharam
Many modern applications involve accessing and processing graphical data, i.e. data that is naturally indexed by graphs. Examples come from internet graphs, social networks, genomi…
cs.IT2012★ 1 cited
On Marton's inner bound for broadcast channels
Amin Gohari, Chandra Nair, Venkat Anantharam
Marton's inner bound is the best known achievable region for a general discrete memoryless broadcast channel. To compute Marton's inner bound one has to solve an optimization probl…