English
Related papers

Related papers: Fourier Entropy-Influence Conjecture for Random Li…

200 papers

In this article, we prove two new versions of a theorem proven by Efron in [Efr65]. Efron's theorem says that if a function $\phi : \mathbb{R}^2 \rightarrow \mathbb{R}$ is non-decreasing in each argument then we have that the function $s…

Probability · Mathematics 2021-12-17 Yannis Oudghiri

The generalised random Fibonacci chain is a stochastic extension of the classical Fibonacci substitution and is defined as the rule mapping $0\mapsto 1$ and $1 \mapsto 1^i01^{m-i}$ with probability $p_i$, where $p_i\geq 0$ with…

Combinatorics · Mathematics 2012-03-12 Johan Nilsson

We propose a new approach to the Fourier restriction conjectures. It is based on a discretization of the Fourier extension operators in terms of quadratically modulated wave packets. Using this new point of view, and by combining natural…

Classical Analysis and ODEs · Mathematics 2024-10-16 Camil Muscalu , Itamar Oliveira

We present a unified framework to study threshold functions for the existence of solutions to linear systems of equations in random sets which includes arithmetic progressions, sum-free sets, $B_{h}[g]$-sets and Hilbert cubes. In…

Combinatorics · Mathematics 2019-02-05 Juanjo Rué , Christoph Spiegel , Ana Zumalacárregui

The entropy power inequality (EPI) provides lower bounds on the differential entropy of the sum of two independent real-valued random variables in terms of the individual entropies. Versions of the EPI for discrete random variables have…

Information Theory · Computer Science 2013-01-18 Saeid Haghighatshoar , Emmanuel Abbe , Emre Telatar

Let $f:\mathbb{R}^k\to \mathbb{R}$ be a measurable function, and let $\{U_i\}_{i\in\mathbb{N}}$ be a sequence of i.i.d. random variables. Consider the random process $Z_i=f(U_{i},...,U_{i+k-1})$. We show that for all $\ell$, there is a…

Probability · Mathematics 2016-08-10 Noga Alon , Ohad N. Feldheim

Using the definition of entropy of a family of increasing distances on a compact metric set given in [10] we introduce a notion of Finsler entropy for smooth distributions and Stefan-Sussmann foliations. This concept generalizes most of…

Differential Geometry · Mathematics 2015-06-11 F. Pelletier

We study the continuity property of the generalized entropy as a function of the underlying probability distribution, defined with an action space and a loss function, and use this property to answer the basic questions in statistical…

Machine Learning · Computer Science 2022-01-04 Aolin Xu

We study the entanglement entropy of random partitions in one- and two-dimensional critical fermionic systems. In an infinite system we consider a finite, connected (hypercubic) domain of linear extent $L$, the points of which with…

Disordered Systems and Neural Networks · Physics 2022-02-18 Gergö Roósz , István A. Kovács , Ferenc Iglói

We develop a variational approximation to the entanglement entropy for scalar $\phi^4$ theory in 1+1, 2+1, and 3+1 dimensions, and then examine the entanglement entropy as a function of the coupling. We find that in 1+1 and 2+1 dimensions,…

High Energy Physics - Theory · Physics 2016-09-07 Jordan Cotler , Mark T. Mueller

The {\em Total Influence} ({\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \ifnum\plusminus=1 $f: \{\pm1\}^n…

Data Structures and Algorithms · Computer Science 2011-01-28 Dana Ron , Ronitt Rubinfeld , Muli Safra , Omri Weinstein

A unified formulation of the density functional theory is constructed on the foundations of entropic inference in both the classical and the quantum regimes. The theory is introduced as an application of entropic inference for inhomogeneous…

Statistical Mechanics · Physics 2021-12-20 Ahmad Yousefi

We consider the maximum entropy problems associated with R\'enyi $Q$-entropy, subject to two kinds of constraints on expected values. The constraints considered are a constraint on the standard expectation, and a constraint on the…

Information Theory · Computer Science 2008-12-18 Jean-François Bercher

We study the $1$-level density of low-lying zeros of Dirichlet $L$-functions in the family of all characters modulo $q$, with $Q/2 < q\leq Q$. For test functions whose Fourier transform is supported in $(-3/2, 3/2)$, we calculate this…

Number Theory · Mathematics 2016-01-20 Daniel Fiorilli , Steven J. Miller

We give a "regularity lemma" for degree-d polynomial threshold functions (PTFs) over the Boolean cube {-1,1}^n. This result shows that every degree-d PTF can be decomposed into a constant number of subfunctions such that almost all of the…

Computational Complexity · Computer Science 2015-03-13 Ilias Diakonikolas , Rocco A. Servedio , Li-Yang Tan , Andrew Wan

Entropies must correspond to mean values for them to be measurable. The Shannon entropy corresponds to the weighted arithmetic mean, whereas the Renyi entropy corresponds to the exponential mean. These means refer to code lengths, which are…

Statistical Mechanics · Physics 2011-10-25 B. H. Lavenda

Using Fourier analysis, we study local limit theorems in weak-convergence problems. Among many applications, we discuss random matrix theory, some probabilistic models in number theory, the winding number of complex brownian motion and the…

Probability · Mathematics 2011-08-01 Freddy Delbaen , Emmanuel Kowalski , Ashkan Nikeghbali

Assuming the Riemann hypothesis, we improve the current upper and lower bounds for the average value of Montgomery's function $F(\alpha, T)$ over long intervals by means of a Fourier optimization framework. The function $F(\alpha, T)$ is…

Number Theory · Mathematics 2023-10-06 Emanuel Carneiro , Micah B. Milinovich , Antonio Pedro Ramos

We prove an inversion theorem for the Fourier transform defined for normal functions, in the case when such functions are of moderate decrease, and in dimensions 2 and 3. This improves on Carleson's general almost everywhere convergence…

Mathematical Physics · Physics 2024-04-01 Tristram de Piro

We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…

Computational Complexity · Computer Science 2025-02-27 Daniel M. Kane , Anthony Ostuni , Kewen Wu