#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2004

2018

- This year (2)
- Last 5 years (17)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Mokshay M. Madiman, Prasad Tetali
- IEEE Transactions on Information Theory
- 2010

Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities generalize Shannon's… (More)

- Mokshay M. Madiman, Andrew R. Barron
- IEEE Transactions on Information Theory
- 2007

New families of Fisher information and entropy power inequalities for sums of independent random variables are presented. These inequalities relate the information in the sum of n independent random… (More)

- Liyao Wang, Mokshay M. Madiman
- IEEE Transactions on Information Theory
- 2014

A lower bound on the Rényi differential entropy of a sum of independent random vectors is demonstrated in terms of rearrangements. For the special case of Boltzmann-Shannon entropy, this lower bound… (More)

- Sergey Bobkov, Mokshay M. Madiman
- IEEE Transactions on Information Theory
- 2011

The entropy per coordinate in a log-concave random vector of any dimension with given density at the mode is shown to have a range of just 1. Uniform distributions on convex bodies are at the lower… (More)

- Ioannis Kontoyiannis, Mokshay M. Madiman
- IEEE Transactions on Information Theory
- 2014

The sumset and inverse sumset theories of Freiman, Plünnecke, and Ruzsa, give bounds connecting the cardinality of the sumset A + B = {a + b; a ∈ A, b ∈ B} of two discrete sets A, B, to the… (More)

- Matthieu Fradelizi, Mokshay M. Madiman, Liyao Wang
- ArXiv
- 2015

An elementary proof is provided of sharp bounds for the varentropy of random vectors with log-concave densities, as well as for deviations of the information content from its mean. These bounds… (More)

- Mokshay M. Madiman
- EURASIP J. Wireless Comm. and Networking
- 2008

Cores of cooperative games are ubiquitous in information theory and arise most frequently in the characterization of fundamental limits in various scenarios involving multiple users. Examples include… (More)

- Mokshay M. Madiman, Adam Marcus, Prasad Tetali
- Random Struct. Algorithms
- 2009

A new notion of partition-determined functions is introduced, and several basic inequalities are developed for the entropy of such functions of independent random variables, as well as for… (More)

- Liyao Wang, Jae Oh Woo, Mokshay M. Madiman
- IEEE International Symposium on Information…
- 2014

A simple new lower bound is provided for the Rényi entropy of the convolution of probability distributions on the integers in terms of certain (discrete) rearrangements of these distributions. This… (More)

- Sergey Bobkov, Mokshay M. Madiman, Liyao Wang
- ArXiv
- 2010

A generalization of Young’s inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for certain parameter… (More)