Related papers: On Shapley Values and Threshold Intervals

Recent work demonstrated the existence of Boolean functions for which Shapley values provide misleading information about the relative importance of features in rule-based explanations. Such misleading information was broadly categorized…

Let $n \in \mathbb{N}_{\geq 1}$. Let $1 \leq p_1, \ldots, p_n < \infty$ and set the H\"older combination $p := (p_1; \ldots ; p_n) := \left( \sum_{j=1}^n p_j^{-1} \right)^{-1}$. Assume further that $0 < p \leq 1$ and that for the H\"older…

We consider the graph dynamical systems known as k-reversible processes. In such processes, each vertex in the graph has one of two possible states at each discrete time step. Each vertex changes its state between the current time and the…

Let $ X_1, \ldots, X_n $ be independent random variables taking values in the alphabet $ \{0, 1, \ldots, r\} $, and $ S_n = \sum_{i = 1}^n X_i $. The Shepp--Olkin theorem states that, in the binary case ($ r = 1 $), the Shannon entropy of $…

We study Boolean functions on the $p$-biased hypercube $(\{0,1\}^n,\mu_p^n)$ through the lens of Fourier (spectral) entropy, i.e. the Shannon entropy of the squared $p$-biased Fourier coefficients. Motivated by recent restriction-based…

The spectral norm of a Boolean function $f:\{0,1\}^n \to \{-1,1\}$ is the sum of the absolute values of its Fourier coefficients. This quantity provides useful upper and lower bounds on the complexity of a function in areas such as learning…

Let $(\varphi_i)_{i=1}^n$ be mutually orthogonal functions on a probability space such that $\|\varphi_i\|_\infty \leq 1 $ for all $i \in [n]$. Let $\alpha > 0$. Let $\Phi(u) = u^2 \log^{\alpha}(u)$ for $u \geq u_{0}$, and $\Phi(u) =…

Let $N$ be a fixed positive integer, and let $f\in S_k(N)$ be a primitive cusp form given by the Fourier expansion $f(z)=\sum_{n=1}^{\infty} \lambda_f(n)n^{\frac{k-1}{2}}e(nz)$. We consider the partial sum $S(x,f)=\sum_{n\leq…

The threshold degree of a Boolean function $f\colon\{0,1\}^n\to\{0,1\}$ is the minimum degree of a real polynomial $p$ that represents $f$ in sign: $\mathrm{sgn}\; p(x)=(-1)^{f(x)}.$ A related notion is sign-rank, defined for a Boolean…

This paper deals with the study of dependencies between two given events modeled by point processes. In particular, we focus on the context of DNA to detect favored or avoided distances between two given motifs along a genome suggesting…

A real valued function $f$ defined on a real open interval $I$ is called $\Phi$-monotone if, for all $x,y\in I$ with $x\leq y$ it satisfies $$ f(x)\leq f(y)+\Phi(y-x), $$ where $\Phi:[0,\ell(I)[\,\to\mathbb{R}_+$ is a given nonnegative…

Let $f\in \mathbb{R}[x_1,\ldots, x_k]$, for $k\ge 2$. For any finite sets $A_1,\ldots, A_k\subset \mathbb{R}$, consider the set $$ f(A_1,\ldots, A_k):=\{f(a_1,\ldots, a_k)\mid (a_1,\cdots,a_k)\in A_1\times\cdots \times A_k\}, $$ that is,…

In the paper, by directly verifying an inequality which gives a lower bound for the first order modified Bessel function of the first kind, the authors supply a new proof for the complete monotonicity of a difference between the exponential…

Consider a random graph G in G(n,p) and the graph property: G contains a copy of a specific graph H. (Note: H depends on n; a motivating example: H is a Hamiltonian cycle.) Let q be the minimal value for which the expected number of copies…

A function $f:\ \{-1,1\}^n\rightarrow \mathbb{R}$ is called pseudo-Boolean. It is well-known that each pseudo-Boolean function $f$ can be written as $f(x)=\sum_{I\in {\cal F}}\hat{f}(I)\chi_I(x),$ where ${\cal F}\subseteq \{I:\ I\subseteq…

Let $d_k(n) = \sum_{n_1 \cdots n_k = n}1$ be the $k$-fold divisor function. We call a function $f:\mathbb{N} \to \mathbb{C}$ a $d_k$-bounded multiplicative function, if $f$ is multiplicative and $|f(n)| \leq d_k(n)$ for every $n \in…

For $p\ge 1$ let $\varphi_p(x)=x^2/2$ if $|x|\le 1$ and $\varphi_p(x)=1/p|x|^p-1/p+1/2$ if $|x|>1$. For a random variable $\xi$ let $\tau_{\varphi_p}(\xi)$ denote $\inf\{a\ge 0:\;\forall_{\lambda\in\mathbb{R}}\;…

This paper proposes an algorithm for deciding consistency of systems of Boolean equations in several variables with co-efficients in the two element Boolean algebra $B_{0}=\{0,1\}$ and find all satisfying assignments. The algorithm is based…

We determine the asymptotic behavior of the $l_{p}$-norms of the sequence of Taylor coefficients of $b^{n}$, where $b=\frac{z-\lambda}{1-\bar{\lambda}z}$ is an automorphism of the unit disk, $p\in[1,\infty]$, and $n$ is large. It is known…

We pursue a systematic study of the following problem. Let f:{0,1}^n -> {0,1} be a (usually monotone) Boolean function whose behaviour is well understood when the input bits are identically independently distributed. What can be said about…