English
Related papers

Related papers: On Shapley Values and Threshold Intervals

200 papers

The following anticoncentration property is proved. The probability that the $k$-order statistic of an arbitrarily correlated jointly Gaussian random vector $X$ with unit variance components lies within an interval of length $\varepsilon$…

Statistics Theory · Mathematics 2021-07-23 Damian Kozbur

We show that any sequence of well-behaved (e.g. bounded and non-constant) real-valued functions of $n$ boolean variables $\{f_n\}$ admits a sequence of coordinates whose $L^1$ influence under the $p$-biased distribution, for any…

Discrete Mathematics · Computer Science 2024-06-18 Andrew J. Young , Henry D. Pfister

For a periodic function $f$ with bounded variation and integral zero on its period interval, we show that $\sum_{k=1}^\infty c_k^2 (\log\log k)^\gamma <\infty$, $\gamma>4$ implies the almost everywhere convergence of $\sum_{k=1}^\infty c_k…

Classical Analysis and ODEs · Mathematics 2012-11-20 Istvan Berkes

The sensitivity of a Boolean function f is the maximum over all inputs x, of the number of sensitive coordinates of x. The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean…

Computational Complexity · Computer Science 2016-04-27 Parikshit Gopalan , Rocco Servedio , Avishay Tal , Avi Wigderson

Let $\xi_1,\xi_2,\ldots$ be independent, identically distributed random variables with infinite mean $\mathbf E[|\xi_1|]=\infty.$ Consider a random walk $S_n=\xi_1+\cdots+\xi_n$, a stopping time $\tau=\min\{n\ge 1: S_n\le 0\}$ and let…

Probability · Mathematics 2019-07-23 Denis Denisov

Using recent developments on the theory of locally decodable codes, we prove that the critical size for Szemer\'edi's theorem with random differences is bounded from above by $N^{1-\frac{2}{k} + o(1)}$ for length-$k$ progressions. This…

Combinatorics · Mathematics 2024-11-06 Jop Briët , Davi Castro-Silva

Let $(X_i, \mathcal{F}_i)_{i\geq1}$ be a martingale difference sequence in a smooth Banach space. Let $S_n=\sum_{i=1}^nX_i, n\geq 1,$ be the partial sums of $(X_i, \mathcal{F}_i)_{i\geq 1}$. We give upper bounds on the quantity…

Probability · Mathematics 2019-09-13 Xiequan Fan , Davide Giraudo

We consider a model of the Riemann zeta function on the critical axis and study its maximum over intervals of length $(\log T)^{\theta}$, where $\theta$ is either fixed or tends to zero at a suitable rate. It is shown that the deterministic…

Probability · Mathematics 2022-10-26 Louis-Pierre Arguin , Guillaume Dubach , Lisa Hartung

Given a continuous real-valued function on [0, 1], and a closed subset E \subset [0, 1] we denote by f E the restriction of f to E, that is, the function defined only on E that takes the same values as f at every point of E >. The…

Classical Analysis and ODEs · Mathematics 2007-11-29 Jean-Pierre Kahane , Yitzhak Katznelson

The threshold degree of a Boolean function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p such that f(x)=sgn p(x). We construct two halfspaces on {0,1}^n whose intersection has threshold degree Theta(sqrt n), an exponential…

Computational Complexity · Computer Science 2016-09-08 Alexander A. Sherstov

We develop an approach for solving one-sided optimal stopping problems in discrete time for general underlying Markov processes on the real line. The main idea is to transform the problem into an auxiliary problem for the ladder height…

Probability · Mathematics 2018-10-29 Sören Christensen , Albrecht Irle

In this note we prove a trace theorem in fractional spaces with variable exponents. To be more precise, we show that if $p\colon\overline{\Omega}\times \overline{\Omega}\to (1,\infty)$ and $q:\partial \Omega \rightarrow (1,\infty)$ are…

Analysis of PDEs · Mathematics 2017-09-25 Leandro M. Del Pezzo , Julio D. Rossi

We study monotonicity testing of functions $f \colon \{0,1\}^d \to \{0,1\}$ using sample-based algorithms, which are only allowed to observe the value of $f$ on points drawn independently from the uniform distribution. A classic result by…

Data Structures and Algorithms · Computer Science 2024-08-21 Hadley Black

In this paper we investigate the problem of quantifying the contribution of each variable to the satisfying assignments of a Boolean function based on the Shapley value. Our main result is a polynomial-time equivalence between computing…

Databases · Computer Science 2023-06-27 Ahmet Kara , Dan Olteanu , Dan Suciu

We consider the Stochastic Boolean Function Evaluation (SBFE) problem in the well-studied case of $k$-of-$n$ functions: There are independent Boolean random variables $x_1,\dots,x_n$ where each variable $i$ has a known probability $p_i$ of…

Data Structures and Algorithms · Computer Science 2025-11-25 Mads Anker Nielsen , Lars Rohwedder , Kevin Schewior

For $0<\alpha<1$ let $V(\alpha)$ denote the supremum of the numbers $v$ such that every $\alpha$-H\"older continuous function is of bounded variation on a set of Hausdorff dimension $v$. Kahane and Katznelson (2009) proved the estimate $1/2…

Probability · Mathematics 2016-11-29 Omer Angel , Richárd Balka , András Máthé , Yuval Peres

Let $0 < \epsilon < 1/2$ be a noise parameter, and let $T_{\epsilon}$ be the noise operator acting on functions on the boolean cube $\{0,1\}^n$. Let $f$ be a nonnegative function on $\{0,1\}^n$. We upper bound the entropy of $T_{\epsilon}…

Information Theory · Computer Science 2016-06-23 Alex Samorodnitsky

Suppose that f is a boolean function from F_2^n to {0,1} with spectral norm (that is the sum of the absolute values of its Fourier coefficients) at most M. We show that f may be expressed as +/- 1 combination of at most 2^(2^(O(M^4)))…

Classical Analysis and ODEs · Mathematics 2010-04-02 Ben Green , Tom Sanders

For $k \geq 4$, we establish that $p = (e/n)^{1/k}$ is a sharp threshold for the existence of the $k$-th power $H$ of a Hamilton cycle in the binomial random graph model. Our proof builds upon an approach by Riordan based on the second…

Combinatorics · Mathematics 2025-02-21 Tamás Makai , Matija Pasch , Kalina Petrova , Leon Schiller

Let S_n=X_1+...+X_n be a sum of independent symmetric random variables such that |X_{i}|\leq 1. Denote by W_n=\epsilon_{1}+...+\epsilon_{n} a sum of independent random variables such that \prob{\eps_i = \pm 1} = 1/2. We prove that…

Probability · Mathematics 2019-11-13 Dainius Dzindzalieta , Matas Šileikis , Tomas Juškevičius