English
Related papers

Related papers: On Shapley Values and Threshold Intervals

200 papers

We show that for a wide class of functions $F$ that: $$ {\lim_{\epsilon \downarrow 0} {\frac{1}{\epsilon}} \int_0^t \Big\{F(s, X_s) - F(s, X_s - \epsilon)\Big\} d\big<X,X\big>_s} = - \int_0^t\int_{\R} F(s, x) d L_s^x $$ where $X_t$ is a…

Probability · Mathematics 2007-05-23 Raouf Ghomrasni

We prove that there exists a bivariate function f with f(k,l) = O(l k log k) such that for every naturals k and l, every graph G has at least k vertex-disjoint cycles of length at least l or a set of at most f(k,l) vertices that meets all…

Combinatorics · Mathematics 2012-05-07 Samuel Fiorini , Audrey Herinckx

We prove that, to compute a Boolean function $f$ on $N$ variables with error probability $\epsilon$, any quantum black-box algorithm has to query at least $\frac{1 - 2\sqrt{\epsilon}}{2} \rho_f N = \frac{1 - 2\sqrt{\epsilon}}{2} \bar{S}_f$…

Quantum Physics · Physics 2007-05-23 Yaoyun Shi

In this paper we prove results regarding Boolean functions with small spectral norm (the spectral norm of f is $\|\hat{f}\|_1=\sum_{\alpha}|\hat{f}(\alpha)|$). Specifically, we prove the following results for functions $f:\{0,1\}^n \to…

Computational Complexity · Computer Science 2013-05-23 Amir Shpilka , Avishay Tal , Ben lee Volk

A Boolean function $f:\{0,1\}^n \to \{0,1\}$ is said to be noise sensitive if inserting a small random error in its argument makes the value of the function almost unpredictable. Benjamini, Kalai and Schramm showed that if the sum of…

Combinatorics · Mathematics 2010-03-10 Nathan Keller , Guy Kindler

Let $L$ be a linear differential operator with constant coefficients of order $n$ and complex eigenvalues $\lambda_{0},...,\lambda_{n}$. Assume that the set $U_{n}$ of all solutions of the equation $Lf=0$ is closed under complex…

Classical Analysis and ODEs · Mathematics 2010-09-24 J. M. Aldaz , O. Kounchev , H. Render

Let $(\xi_k)$ and $(\eta_k)$ be infinite independent samples from different distributions. We prove a functional limit theorem for the maximum of a perturbed random walk $\underset{0\leq k\leq n}{\max}\,(\xi_1+\ldots+\xi_k+\eta_{k+1})$ in a…

Probability · Mathematics 2014-02-20 Alexander Iksanov , Andrey Pilipenko

We study the number of queries needed to identify a monotone Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$. A query consists of a 0-1-sequence, and the answer is the value of $f$ on that sequence. It is well-known that the number of…

We consider the space $A(\mathbb{T}^d)$ of absolutely convergent Fourier series on the torus $\mathbb{T}^d$. The norm on $A(\mathbb{T}^d)$ is naturally defined by $\|f\|_{A}=\|\widehat{f}\|_{l^1}$, where $\widehat{f}$ is the Fourier…

Classical Analysis and ODEs · Mathematics 2019-04-12 Vladimir Lebedev

Let $S(t,f)=\pi^{-1}\arg L(1/2+it, f)$, where $f$ is a holomorphic Hecke cusp form of weight $2$ and prime level $q$. In this paper, we establish an unconditional asymptotic formula for the moments of $S(t,f)$, providing a level aspect…

Number Theory · Mathematics 2026-04-14 Qingfeng Sun , Hui Wang

We develop a new technique for proving concentration inequalities which relate between the variance and influences of Boolean functions. Using this technique, we 1. Settle a conjecture of Talagrand [Tal97] proving that $$\int_{\left\{…

Probability · Mathematics 2020-03-13 Ronen Eldan , Renan Gross

The theorem states that: Every Boolean function can be $\epsilon -approximated$ by a Disjunctive Normal Form (DNF) of size $O_{\epsilon}(2^{n}/\log{n})$. This paper will demonstrate this theorem in detail by showing how this theorem is…

Computational Complexity · Computer Science 2020-05-13 Yunhao Yang , Andrew Tan

We prove that any submodular function f: {0,1}^n -> {0,1,...,k} can be represented as a pseudo-Boolean 2k-DNF formula. Pseudo-Boolean DNFs are a natural generalization of DNF representation for functions with integer range. Each term in…

Machine Learning · Computer Science 2012-08-14 Sofya Raskhodnikova , Grigory Yaroslavtsev

Let $T\subset\mathbb{R}$, $M$ be a metric space with metric $d$, and $M^T$ be the set of all functions mapping $T$ into $M$. Given $f\in M^T$, we study the properties of the approximate variation $\{V_\varepsilon(f)\}_{\varepsilon>0}$,…

Functional Analysis · Mathematics 2021-11-05 Vyacheslav V. Chistyakov

The noise sensitivity of a Boolean function $f: \{0,1\}^n \rightarrow \{0,1\}$ is one of its fundamental properties. A function of a positive noise parameter $\delta$, it is denoted as $NS_{\delta}[f]$. Here we study the algorithmic problem…

Data Structures and Algorithms · Computer Science 2019-04-16 Ronitt Rubinfeld , Arsen Vasilyan

We show that on every product probability space, Boolean functions with small total influences are essentially the ones that are almost measurable with respect to certain natural sub-sigma algebras. This theorem in particular describes the…

Combinatorics · Mathematics 2011-11-15 Hamed Hatami

The estimation of signal frequency count in the presence of background noise has had much discussion in the recent physics literature, and Mandelkern [1] brings the central issues to the statistical community, leading in turn to extensive…

Data Analysis, Statistics and Probability · Physics 2009-11-10 D. A. S. Fraser , N. Reid , A. C. M. Wong

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

Let $\R(\cdot)$ stand for the bounded-error randomized query complexity. We show that for any relation $f \subseteq \{0,1\}^n \times \mathcal{S}$ and partial Boolean function $g \subseteq \{0,1\}^n \times \{0,1\}$, $\R_{1/3}(f \circ g^n) =…

Computational Complexity · Computer Science 2018-01-11 Swagato Sanyal

This paper develops a threshold model with a time-varying threshold, represented using a wavelet series expansion. The model adequately captures irregular and abrupt variations, as well as smooth changes in the threshold parameter, allowing…

Methodology · Statistics 2026-05-19 Rhea Davis , N. Balakrishna