Related papers: Upper bounds on product and multiplier empirical p…

Let ($X,Y)$ be a random vector with distribution function $F(x,y),$ and $(X_{1},Y_{1}),(X_{2},Y_{2}),...,(X_{n},Y_{n})$ are independent copies of ($X,Y).$ Let $X_{i:n}$ be the $i$th order statistics constructed from the sample…

Bilinear Fourier multipliers of the form $e^{i (|\xi| + |\eta|+ |\xi + \eta|)} \sigma (\xi, \eta)$ are considered. It is proved that if $\sigma (\xi, \eta)$ is in the H\"ormander class $S^{m}_{1,0} (\mathbb{R}^{2n})$ with $m=-(n+1)/2$ then…

We consider the problem of discriminating finite-dimensional quantum processes, also called quantum supermaps, that can consist of multiple time steps. Obtaining the ultimate performance for discriminating quantum processes is of…

Given a multiplicative function $f$, we let $S(x,f)=\sum_{n\leq x}f(n)$ be the associated partial sum. In this note, we show that lower bounds on partial sums of divisor-bounded functions result in lower bounds on the partial sums…

Let $\xi_i$, $i\in \mathbb {N}$, be independent copies of a L\'{e}vy process $\{\xi(t),t\geq0\}$. Motivated by the results obtained previously in the context of the random energy model, we prove functional limit theorems for the process…

We obtain several extensions of Talagrand's lower bound for the small deviation probability using metric entropy. For Gaussian processes, our investigations are focused on processes with sub-polynomial and, respectively, exponential…

The supremum of the standardized empirical process is a promising statistic for testing whether the distribution function $F$ of i.i.d. real random variables is either equal to a given distribution function $F_0$ (hypothesis) or $F \ge F_0$…

In this paper, we develop a general machinery for finding explicit uniform probability and moment bounds on sub-additive positive functionals of random processes. Using the developed general technique, we derive uniform bounds on the…

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

We discuss the computational complexity of approximating maximum a posteriori inference in sum-product networks. We first show NP-hardness in trees of height two by a reduction from maximum independent set; this implies non-approximability…

We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum…

Let $r \ge 2$ be an integer and let $A$ be a finite, nonempty set of nonzero integers. We will obtain a lower bound for the number of squarefree integers $n$, up to $x$, for which the products $\prod_{p \mid n} (p+a)$ (over primes $p$) are…

In the field of reinforcement learning there has been recent progress towards safety and high-confidence bounds on policy performance. However, to our knowledge, no practical methods exist for determining high-confidence policy performance…

In this paper, we study the asymptotic distribution of the maxima of suprema of dependent Gaussian processes with trend. For different scales of the time horizon we obtain different normalizing functions for the convergence of the maxima.…

Recent years have seen the development of methods for multiagent planning under uncertainty that scale to tens or even hundreds of agents. However, most of these methods either make restrictive assumptions on the problem domain, or provide…

This manuscript explores many convolution (restricted summation) type sequences via certain types of matrix based factorizations that can be used to express their generating functions. The last primary (non-appendix) section of the thesis…

In this paper, we use methods from spectral graph theory to obtain some results on the sum-product problem over finite valuation rings $\mathcal{R}$ of order $q^r$ which generalize recent results given by Hegyv\'ari and Hennecart (2013).…

We present a new technique for proving empirical process invariance principle for stationary processes $(X_n)_{n\geq 0}$. The main novelty of our approach lies in the fact that we only require the central limit theorem and a moment bound…

Let \xi_t, t\in[0,T], be a strong Markov process with values in a complete separable metric space (X,\rho) and with transition probability function P_{s,t}(x,dy), 0\le s\le t\le T, x\in X. For any h\in[0,T] and a>0, consider the function…

Let $\phi(n)$ be the Euler totient function and $\phi_k(n)$ its $k$-fold iterate. In this note, we improve the upper bound for the number of positive $n\leqslant x$ such that $\phi_{k+1}(n)\geqslant cn$. Comparing with the upper bound which…