English
Related papers

Related papers: Concentration functions and entropy bounds for dis…

200 papers

New class of reference distribution functions for numerical approximation of the solution of the Fokker-Planck equations associated to the charged particle dynamics in tokamak are studied. The reference distribution functions are obtained…

Statistical Mechanics · Physics 2016-11-22 György Steinbrecher , Giorgio Sonnino , Nicolae Pometescu

We derive properties of powers of a function satisfying a second-order linear differential equation. In particular we prove that the n-th power of the function satisfies an (n+1)-th order differential equation and give a simple method for…

Classical Analysis and ODEs · Mathematics 2015-07-29 Naoki Marumo , Toshinori Oaku , Akimichi Takemura

Bivariate partial-sums discrete probability distributions are defined. The question of the existence of a limit distribution for iterated partial summations is solved for finite-support bivariate distributions which satisfy conditions under…

Probability · Mathematics 2019-03-11 Lívia Leššova , Ján Mačutek

This article describes the extension of recent methods for a posteriori error estimation such as dual-weighted residual methods to node-centered finite volume discretizations of second order elliptic boundary value problems including upwind…

Numerical Analysis · Mathematics 2026-02-04 Lutz Angermann

Complementarity relations between various characterizations of a probability distribution are at the core of information theory. In particular, lower and upper bounds for the entropic function are of great importance. In applied topics, we…

Quantum Physics · Physics 2022-09-07 Alexey E. Rastegin

Entanglement criteria for an $n$-partite quantum system with continuous variables are formulated in terms of R\'{e}nyi entropies. R\'{e}nyi entropies are widely used as a good information measure due to many nice properties. Derived…

Quantum Physics · Physics 2017-05-22 Alexey E. Rastegin

We prove a log-Sobolev inequality for a certain class of log-concave measures in high dimension. These are the probability measures supported on the unit cube in R^n whose density takes the form exp(-H) where the function H is assumed to be…

Metric Geometry · Mathematics 2012-12-18 Bo'az Klartag

We develop an information-theoretic perspective on some questions in convex geometry, providing for instance a new equipartition property for log-concave probability measures, some Gaussian comparison results for log-concave measures, an…

Functional Analysis · Mathematics 2011-03-31 Sergey Bobkov , Mokshay Madiman

We derive sharp lower bounds for L^p-functions on the n-dimensional unit hypercube in terms of their p-th marginal moments. Such bounds are the unique solutions of a system of constrained nonlinear integral equations depending on the…

Probability · Mathematics 2021-01-12 Paolo Guasoni , Eberhard Mayerhofer , Mingchuan Zhao

We give a variational formulation of classical statistical mechanics where the one-body density and the local entropy distribution constitute the trial fields. Using Levy's constrained search method it is shown that the grand potential is a…

Soft Condensed Matter · Physics 2015-05-30 Matthias Schmidt

We derive two upper bounds for the probability of deviation of a vector-valued Lipschitz function of a collection of random variables from its expected value. The resulting upper bounds can be tighter than bounds obtained by a direct…

Probability · Mathematics 2021-03-02 Dimitrios Katselis , Xiaotian Xie , Carolyn L. Beck , R. Srikant

When more than one hadron takes part in a hard process, an extended set of quark distribution and fragmentation functions becomes relevant. In this talk, the derivation of Soffer-like bounds for these functions, in the case of a spin-1/2…

High Energy Physics - Phenomenology · Physics 2015-06-25 A. Henneman

The problem of distributed function computation is studied, where functions to be computed is not necessarily symbol-wise. A new method to derive a converse bound for distributed computing is proposed; from the structure of functions to be…

Information Theory · Computer Science 2017-07-10 Shigeaki Kuzuoka , Shun Watanabe

Starting from the geometrical interpretation of the R\'enyi entropy, we introduce further extensive generalizations and study their properties. In particular, we found the probability distribution function obtained by the MaxEnt principle…

Statistical Mechanics · Physics 2015-06-17 Giorgio Sonnino , György Steinbrecher

Mixed $f$-divergences, a concept from information theory and statistics, measure the difference between multiple pairs of distributions. We introduce them for log concave functions and establish some of their properties. Among them are…

Functional Analysis · Mathematics 2016-06-29 Umut Caglar , Elisabeth M. Werner

We prove new entropy inequalities for log concave and s-concave functions that strengthen and generalize recently established reverse log Sobolev and Poincare inequalities for such functions. This leads naturally to the concept of…

Functional Analysis · Mathematics 2013-07-23 Umut Caglar , Elisabeth M. Werner

We derive sharp upper and lower bounds for the pointwise concentration function of the maximum statistic of $d$ identically distributed real-valued random variables. Our first main result places no restrictions either on the common marginal…

Statistics Theory · Mathematics 2025-08-04 Matias D. Cattaneo , Ricardo P. Masini , William G. Underwood

We obtain bounds on fluctuations of two entropy estimators for a class of one-dimensional Gibbs measures on the full shift. They are the consequence of a general exponential inequality for Lipschitz functions of n variables. The first…

Dynamical Systems · Mathematics 2015-05-27 J. -R. Chazottes , C. Maldonado

We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…

Information Theory · Computer Science 2014-10-24 Adityanand Guntuboyina

The existing upper and lower bounds between entropy and error probability are mostly derived from the inequality of the entropy relations, which could introduce approximations into the analysis. We derive analytical bounds based on the…

Information Theory · Computer Science 2012-05-31 Bao-Gang Hu , Hong-Jie Xing