English
Related papers

Related papers: On Shapley Values and Threshold Intervals

200 papers

We prove that the distribution density of any non-constant polynomial $f(\xi_1,\xi_2,\ldots)$ of degree $d$ in independent standard Gaussian random variables $\xi$ (possibly, in infinitely many variables) always belongs to the…

Probability · Mathematics 2016-05-03 Vladimir I. Bogachev , Egor D. Kosov , Georgii I. Zelenov

Suppose that i.i.d. random variables $X_{1}, X_{2}, \ldots$ are chosen uniformly from $[0,1]$, and let $f: [0,1] \rightarrow [0,1]$ be an increasing bijection. Define $\mu_{f}$ to be the expected value of $f(X_{i})$ for each $i$. Define the…

Probability · Mathematics 2016-08-23 Jesse Geneson

The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…

Number Theory · Mathematics 2014-08-13 Kolbjørn Tunstrøm

We combine our version of the resonance method with certain convolution formulas for $\zeta(s)$ and $\log\, \zeta(s)$. This leads to a new $\Omega$ result for $|\zeta(1/2+it)|$: The maximum of $|\zeta(1/2+it)|$ on the interval $1 \le t \le…

Number Theory · Mathematics 2018-12-05 Andriy Bondarenko , Kristian Seip

The \emph{Chow parameters} of a Boolean function $f: \{-1,1\}^n \to \{-1,1\}$ are its $n+1$ degree-0 and degree-1 Fourier coefficients. It has been known since 1961 (Chow, Tannenbaum) that the (exact values of the) Chow parameters of any…

Computational Complexity · Computer Science 2012-06-06 Anindya De , Ilias Diakonikolas , Vitaly Feldman , Rocco A. Servedio

For all $n, \epsilon >0$, we show that the set of Poisson Binomial distributions on $n$ variables admits a proper $\epsilon$-cover in total variation distance of size $n^2+n \cdot (1/\epsilon)^{O(\log^2 (1/\epsilon))}$, which can also be…

Computation · Statistics 2014-10-03 Constantinos Daskalakis , Christos Papadimitriou

We study the function $\Delta_k(x):=\sum_{n\leq x} d_k(n) - \mbox{Res}_{s=1} ( \zeta^k(s) x^s/s )$, where $k\geq 3$ is an integer, $d_k(n)$ is the $k$-fold divisor function, and $\zeta(s)$ is the Riemann zeta-function. For a large parameter…

Number Theory · Mathematics 2023-09-21 Siegfred Baluyot , Cruz Castillo

We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \emph{arbitrary} critical density cannot be…

Computational Complexity · Computer Science 2024-07-17 David Gamarnik , Elchanan Mossel , Ilias Zadik

In Machine Learning, the $\mathsf{SHAP}$-score is a version of the Shapley value that is used to explain the result of a learned model on a specific entity by assigning a score to every feature. While in general computing Shapley values is…

Artificial Intelligence · Computer Science 2023-03-31 Marcelo Arenas , Pablo Barceló , Leopoldo Bertossi , Mikaël Monet

Schaefer's dichotomy theorem [Schaefer, STOC'78] states that a boolean constraint satisfaction problem (CSP) is polynomial-time solvable if one of six given conditions holds for every type of constraint allowed in its instances. Otherwise,…

Computational Complexity · Computer Science 2023-07-10 Patrick Schnider , Simon Weber

Assuming the Riemann Hypothesis, we show that for $k>0$ $$ \frac{1}{T}\text{meas}\Big\{t\in [T,2T]:|\zeta(1/2+{\rm i} t)|>(\log T)^k\Big\}\leq C_k \frac{(\log T)^{-k^2}}{\sqrt{\log\log T}}, $$ where $C_k=\exp(e^{ck})$ for some absolute…

Number Theory · Mathematics 2026-04-29 Louis-Pierre Arguin , Emma Bailey , Asher Roberts

Let $(X_{i}, \mathcal{F}_{i})_{i\geq 1}$ be a sequence of supermartingale differences and let $S_k=\sum_{i=1}^k X_i$. We give an exponential moment condition under which $P(\max_{1\leq k \leq n} S_k \geq n)=O(\exp\{-C_1 n^{\alpha}\}),$…

Probability · Mathematics 2013-05-07 Xiequan Fan , Ion Grama , Quansheng Liu

We prove the optimal rate of quantitative propagation of chaos, uniformly in time, for interacting diffusions. Our main examples are interactions governed by convex potentials and models on the torus with small interactions. We show that…

Probability · Mathematics 2023-01-23 Daniel Lacker , Luc Le Flem

Let $f$ be a weight $k$ holomorphic cusp form of level one, and let $S_f(n)$ denote the sum of the first $n$ Fourier coefficients of $f$. In analogy with Dirichlet's divisor problem, it is conjectured that $S_f(X) \ll X^{\frac{k-1}{2} +…

Number Theory · Mathematics 2017-05-04 Thomas A. Hulse , Chan Ieong Kuan , David Lowry-Duda , Alexander Walker

We consider one-dimensional infinite chains of harmonic oscillators with random exchanges of momenta and long-range interaction potentials which have polynomial decay rate $|x|^{-\theta}, x \to \infty, \theta > 1$ where $x \in \mathbb{Z}$…

Mathematical Physics · Physics 2022-05-04 Hayate Suda

Let $g(k)$ be the maximum size of a planar set that determines at most $k$ distances. We prove $$\frac{\pi}{3\,C(\Lambda_{hex})}\ k\sqrt{\log k} (1+o(1)) \le g(k) \le C k\log k,$$ so $g(k) \asymp k\sqrt{\log k}$ with an explicit constant…

Metric Geometry · Mathematics 2025-10-14 Lucas Wang

We say that $f:[0,1]\to [0,1]$ is a {\it piecewise continuous interval map} if there exists a partition $0=x_0<x_1<\cdots<x_{d}<x_{d+1}=1$ of $[0,1]$ such that $f\vert_{(x_{i-1},x_i)}$ is continuous and the lateral limits $w_0^+=\lim_{x\to…

Dynamical Systems · Mathematics 2016-03-09 Benito Pires

We find optimal (up to constant) bounds for the following measures for the regularity of the Schramm-Loewner evolution (SLE): variation regularity, modulus of continuity, and law of the iterated logarithm. For the latter two we consider the…

Probability · Mathematics 2026-01-23 Nina Holden , Yizheng Yuan

Proving the ``expectation-threshold'' conjecture of Kahn and Kalai, we show that for any increasing property $\mathcal{F}$ on a finite set $X$, $$p_c(\mathcal{F})=O(q(\mathcal{F})\log \ell(\mathcal{F})),$$ where $p_c(\mathcal{F})$ and…

Combinatorics · Mathematics 2023-04-14 Jinyoung Park , Huy Tuan Pham

Let $\varepsilon>0$ and, for an odd prime $p$, set $$ S_\ell(p):=\sum_{n\le \ell}\left(\frac{n}{p}\right). $$ Define the first-passage time $$ f_\varepsilon(p):=\min\{\ell\ge 1:\ S_\ell(p)<\varepsilon\ell\}. $$ We prove that there exists a…

Number Theory · Mathematics 2026-01-21 Quanyu Tang , Hao Zhang