Related papers: On Block Sensitivity and Fractional Block Sensitiv…
For $0 \leq \beta < \alpha < 1$ the distribution $\mathcal{H}$ over Boolean functions $h \colon \{-1, 1\}^d \to \{-1, 1\}$ that minimizes the expression \begin{equation*} \rho_{\alpha, \beta} = \frac{\log(1/\Pr_{\substack{h \sim \mathcal{H}…
This article aims to study fractal interpolation functions corresponding to a sequence of iterated function systems (IFSs). For a suitable choice of a sequence of IFS parameters, the corresponding non-stationary fractal function is a better…
We show an equivalence between 1-query quantum algorithms and representations by degree-2 polynomials. Namely, a partial Boolean function $f$ is computable by a 1-query quantum algorithm with error bounded by $\epsilon<1/2$ iff $f$ can be…
Based on the recent breakthrough of Huang (2019), we show that for any total Boolean function $f$, the deterministic query complexity, $D(f)$, is at most quartic in the quantum query complexity, $Q(f)$: $D(f) = O(Q(f)^4)$. This matches the…
We present an innovating sensitivity analysis for stochastic differential equations: We study the sensitivity, when the Hurst parameter~$H$ of the driving fractional Brownian motion tends to the pure Brownian value, of probability…
We study several stronger versions of sensitivity for minimal group actions, including $n$-sensitivity, thick $n$-sensitivity and blockily thick $n$-sensitivity, and characterize them by the regionally proximal relation.
Approximation of scattered data is often a task in many engineering problems. The Radial Basis Function (RBF) approximation is appropriate for large scattered (unordered) datasets in d-dimensional space. This approach is useful for a higher…
We observe $n$ heteroscedastic stochastic processes $\{Y_v(t)\}_{v}$, where for any $v\in\{1,\ldots,n\}$ and $t \in [0,1]$, $Y_v(t)$ is the convolution product of an unknown function $f$ and a known blurring function $g_v$ corrupted by…
The role of symmetry in Boolean functions $f:\{0,1\}^n \to \{0,1\}$ has been extensively studied in complexity theory. For example, symmetric functions, that is, functions that are invariant under the action of $S_n$, is an important class…
We investigate first and second order fluctuations of additive functionals of a fractional Brownian motion (fBm) of the form \begin{align}\label{eq:abstractmain} Z_n=\left\{\int_{0}^{t}f(n^{H}(B_{s}-\lambda))ds\ ; t\geq 0 \right\}…
The problem of approximately computing the $k$ dominant Fourier coefficients of a vector $X$ quickly, and using few samples in time domain, is known as the Sparse Fourier Transform (sparse FFT) problem. A long line of work on the sparse FFT…
We show that in boundary CFTs, there exists a one-to-one correspondence between the boundary operator expansion of the two-point correlation function and a power series expansion of the layer susceptibility. This general property allows the…
The length of minimal and maximal blocks equally distant on log-log scale versus fluctuation function considerably influences bias and variance of DFA. Through a number of extensive Monte Carlo simulations and different fractional Brownian…
Let $f : \{0,1\}^n \times \{0,1\}^n \rightarrow \{0,1\}$ be a 2-party function. For every product distribution $\mu$ on $\{0,1\}^n \times \{0,1\}^n$, we show that $$\mathsf{CC}^\mu_{0.49}(f) = O\left(\left(\log \mathsf{prt}_{1/8}(f) \cdot…
We study the recently introduced idea of worst-case sensitivity for monotone submodular maximization with cardinality constraint $k$, which captures the degree to which the output argument changes on deletion of an element in the input. We…
In this paper, we aim to estimate block-diagonal covariance matrices for Gaussian data in high dimension and in fixed dimension. We first estimate the block-diagonal structure of the covariance matrix by theoretical and practical estimators…
New jet observables are defined which characterize both fractal and scale-dependent contributions to the distribution of hadrons in a jet. These infrared safe observables, named Extended Fractal Observables (EFOs), have been applied to…
We consider the problem of testing whether a Boolean function has Fourier degree $\leq k$ or it is $\epsilon$-far from any Boolean function with Fourier degree $\leq k$. We improve the known lower bound of $\Omega(k)$ \cite{BBM11,CGM10}, to…
The surface brightness fluctuations (SBF) method measures the variance in a galaxy's light distribution arising from fluctuations in the numbers and luminosities of individual stars per resolution element. Once calibrated for stellar…
We show that a fractal affine function $f(x)$ defined by a system $\mathcal S$ which does not satisfy weak separation property is a quadratic function.