A New Entropy Power Inequality for Integer-Valued Random Variables
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Abstract—In this paper, the ‘Approximate Message Passing’ (AMP) algorithm, initially developed for compressed sensing of signals under i.i.d. Gaussian measurement matrices, has been extended to a multi-terminal setting (MAMP algorithm). It has been shown t ...
We consider the simple random walk on , d > 3, evolving in a potential of the form beta V, where are i.i.d. random variables taking values in [0, + a), and beta > 0. When the potential is integrable, the asymptotic behaviours as beta tends to 0 of the asso ...
Consider a random regular graph with degree d and of size n. Assign to each edge an independent and identically distributed exponential random variable with mean one. In this paper we establish a precise asymptotic expression for the maximum number of edge ...
The morphology of street patterns has been the subject of many studies in recent decades. While some have noted the textural and morphological differences in various parts of many cities, there have been few attempts to quantify the street patterns that co ...
Generalized versions of the entropic (Hirschman-Beckner) and support (Elad-Bruckstein) uncertainty principle are presented for frames representations. Moreover, a sharpened version of the support inequality is obtained by introducing a generalization of th ...
In this work we consider the problem of approximating the statistics of a given Quantity of Interest (QoI) that depends on the solution of a linear elliptic PDE defined over a random domain parameterized by N random variables. The elliptic problem is remap ...
Providing adaptive shared control for Brain- Computer Interfaces (BCIs) can result in better performance while reducing the user’s mental workload. In this respect, online estimation of accuracy and speed of command delivery are important factors. This stu ...
This paper investigates the construction of determin- istic measurement matrices preserving the entropy of a random vector with a given probability distribution. In particular, it is shown that for a random vector with i.i.d. discrete components, this is a ...
Distributed Constraint Satisfaction (DisCSP) and Distributed Constraint Optimization (DCOP) are formal frameworks that can be used to model a variety of problems in which multiple decision-makers cooperate towards a common goal: from computing an equilibri ...
The coil to globule transition is a fundamental phenomenon in the physics of macro-molecules by reason of the multiplicity of arrangements of their conformation. Such conformational freedom is the main source of entropy in the molecule and is the main oppo ...
