A New Entropy Power Inequality for Integer-Valued Random Variables
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
We present a new information-theoretic result which we call the Chaining Lemma. It considers a so-called "chain" of random variables, defined by a source distribution X-(0) with high min-entropy and a number (say, t in total) of arbitrary functions (T-1,.. ...
Pressurized fluid-distribution networks are key strategic elements of infrastructure. Drinking water is a precious resource and will become more and more important with the depletion of reserves. With the growth of the human population, challenges related ...
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 that simil ...
Various aspects of the built environment have important effects on ecology. Providing suitable metrics for the built forms so as to quantify and model their internal relations and external ecological footprints, however, remains a challenge. Here we provid ...
The relative entropy is a principal measure of distinguishability in quantum information theory, with its most important property being that it is non-increasing with respect to noisy quantum operations. Here, we establish a remainder term for this inequal ...
New quantitative measures of urban structural changes are introduced and applied to the fast-growing city of Kerman, Iran. The results of 20,802 street measurements show that the main street orientations are orthogonal, both in the old inner part and in th ...
We quantify the synchronization between snowfall and natural avalanches in relation to terrain properties at the detachment zone. We analyze field statistics of 549 avalanche events in terms of slope, aspect, timing, coordinate, and release area, identifie ...
Street networks are one of the very few types of complex networks where the history of the network can be traced over long periods of time. Here we introduce methods for quantifying the geometric characteristics of street networks and analyze the details o ...
We are interested in inferring the set of waypoints (or intermediate destinations) of a mobility trajectory in the absence of timing information. We find that, by mining a dataset of real mobility traces, computing the entropy of conditional Markov traject ...
The problem of successive refinement in distributed source coding and in joint source-channel coding is considered. The emphasis is placed on the case where the sources have to be recovered losslessly in the second stage. In distributed source coding, it i ...
