50 citations · 182 across the 38 of their papers we have counts for
25 papers · 1 filter
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…
An information-theoretic proof of the Shannon-Hagelbarger theorem
Venkat Anantharam
The Shannon-Hagelbarger theorem states that the effective resistance across any pair of nodes in a resistive network is a concave function of the edge resistances. We give an infor…
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…
Sequential Channel Synthesis
Lei Yu, Venkat Anantharam
The channel synthesis problem has been widely investigated over the last decade. In this paper, we consider the sequential version in which the encoder and the decoder work in a se…
A Universal Lossless Compression Method applicable to Sparse Graphs and Heavy-Tailed Sparse Graphs
Payam Delgosha, Venkat Anantharam
Graphical data arises naturally in several modern applications, including but not limited to internet graphs, social networks, genomics and proteomics. The typically large size of…
Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity
Lei Yu, Venkat Anantharam, Jun Chen
In this paper, we study the type graph, namely, a bipartite graph induced by a joint type. We investigate the maximum edge density of induced bipartite subgraphs of this graph havi…
A Notion of Entropy for Stochastic Processes on Marked Rooted Graphs
Payam Delgosha, Venkat Anantharam
In this document, we introduce a notion of entropy for stochastic processes on marked rooted graphs. For this, we employ the framework of local weak limit theory for sparse marked…
Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality
Venkat Anantharam, Varun Jog, Chandra Nair
The entropy power inequality (EPI) and the Brascamp-Lieb inequality (BLI) are fundamental inequalities concerning the differential entropies of linear transformations of random vec…
A Unified Framework for One-shot Achievability via the Poisson Matching Lemma
Cheuk Ting Li, Venkat Anantharam
We introduce a fundamental lemma called the Poisson matching lemma, and apply it to prove one-shot achievability results for various settings, namely channels with state informatio…
One-Shot Variable-Length Secret Key Agreement Approaching Mutual Information
Cheuk Ting Li, Venkat Anantharam
This paper studies an information-theoretic one-shot variable-length secret key agreement problem with public discussion. Let and be jointly distributed random variables, e…
Distributed Compression of Graphical Data
Payam Delgosha, Venkat Anantharam
In contrast to time series, graphical data is data indexed by the vertices and edges of a graph. Modern applications such as the internet, social networks, genomics and proteomics…
Intrinsic entropies of log-concave distributions
Varun Jog, Venkat Anantharam
The entropy of a random variable is well-known to equal the exponential growth rate of the volumes of its typical sets. In this paper, we show that for any log-concave random varia…
A Variational Characterization of Rényi Divergences
Venkat Anantharam
Atar, Chowdhary and Dupuis have recently exhibited a variational formula for exponential integrals of bounded measurable functions in terms of Rényi divergences. We develop a varia…
The two-unicast problem
Sudeep Kamath, Venkat Anantharam, David Tse +1
We consider the communication capacity of wireline networks for a two-unicast traffic pattern. The network has two sources and two destinations with each source communicating a mes…
On Non-Interactive Simulation of Joint Distributions
Sudeep Kamath, Venkat Anantharam
We consider the following non-interactive simulation problem: Alice and Bob observe sequences and respectively where are drawn i.i.d. from $P(x…
A Geometric Analysis of the AWGN channel with a -Power Constraint
Varun Jog, Venkat Anantharam
In this paper, we consider the AWGN channel with a power constraint called the -power constraint, which is motivated by energy harvesting communication systems. Given a cod…
On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover
Venkat Anantharam, Amin Gohari, Sudeep Kamath +1
In this paper we provide a new geometric characterization of the Hirschfeld-Gebelein-Rényi maximal correlation of a pair of random , as well as of the chordal slope of the n…
The Entropy Power Inequality and Mrs. Gerber's Lemma for Abelian Groups of Order 2^n
Varun Jog, Venkat Anantharam
Shannon's Entropy Power Inequality can be viewed as characterizing the minimum differential entropy achievable by the sum of two independent random variables with fixed differentia…
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…
Generating Dependent Random Variables Over Networks
Amin Aminzadeh Gohari, Venkat Anantharam
In this paper we study the problem of generation of dependent random variables, known as the "coordination capacity" [4,5], in multiterminal networks. In this model nodes of th…
Information-Theoretic Capacity and Error Exponents of Stationary Point Processes under Random Additive Displacements
Venkat Anantharam, Francois Baccelli
This paper studies the Shannon regime for the random displacement of stationary point processes. Let each point of some initial stationary point process in give rise to one…
On Marton's Inner Bound for the General Broadcast Channel
Amin Aminzadeh Gohari, Abbas El Gamal, Venkat Anantharam
We establish several new results on Marton's coding scheme and its corresponding inner bound on the capacity region of the general broadcast channel. We show that unlike the Gaussi…
A Generalized Cut-Set Bound
Amin Aminzadeh Gohari, Venkat Anantharam
In this paper, we generalize the well known cut-set bound to the problem of lossy transmission of functions of arbitrarily correlated sources over a discrete memoryless multitermin…
Evaluation of Marton's Inner Bound for the General Broadcast Channel
Amin Aminzadeh Gohari, Venkat Anantharam
The best known inner bound on the two-receiver general broadcast channel without a common message is due to Marton [3]. This result was subsequently generalized in [p. 391, Problem…