相关论文: Sign changes of the partial sums of a random multi…

We consider the problem of unconstrained minimization of finite sums of functions. We propose a simple, yet, practical way to incorporate variance reduction techniques into SignSGD, guaranteeing convergence that is similar to the full sign…

Let $\varepsilon_1,\ldots,\varepsilon_n$ be independent identically distributed Rademacher random variables, that is $\mathbb{P}\{\varepsilon_i=\pm1\}=1/2$. Let $S_n=a_1\varepsilon_1+\cdots+a_n\varepsilon_n$, where…

This paper is concerned with the asymptotic behavior of sums of terms which are a test function f evaluated at successive increments of a discretely sampled semimartingale. Typically the test function is a power function (when the power is…

In this paper, we evaluate asymptotically a smoothed version of the sum \[ \displaystyle \sideset{}{^*}\sum_{d \leq X} \left( \sum_{n \leq Y} \lambda_f(n)\Big(\frac{8d}{n}\Big)\right)^2, \] where $\Big ( \frac{8d}{\cdot}\Big )$ is the…

Suppose that i.i.d. random variables $X_{1}, X_{2}, \ldots$ are chosen uniformly from $[0,1]$, and let $f: [0,1] \rightarrow [0,1]$ be an increasing bijection. Define $\mu_{f}$ to be the expected value of $f(X_{i})$ for each $i$. Define the…

Granville-Soundararajan, Harper-Nikeghbali-Radziwill, and Heap-Lindqvist independently established an asymptotic for the even natural moments of partial sums of random multiplicative functions defined over integers. Building on these works,…

We introduce a new, elementary method for studying random differences in arithmetic progressions and convergence phenomena along random sequences of integers. We apply our method to obtain significant improvements on previously known…

Single-parameter summaries of variable effects in regression settings are desirable for ease of interpretation. However (partially) linear models for example, which would deliver these, may fit poorly to the data. On the other hand, an…

We consider the distribution of the binomial probability mass function (pmf) among arithmetic progressions and obtain an average-type theorem. As applications, we consider the possible visits to a kind of sieved sets of integers or lattice…

For a half integral weight modular form $f$ we study the signs of the Fourier coefficients $a(n)$. If $f$ is a Hecke eigenform of level $ N$ with real Nebentypus character, and $t$ is a fixed square-free positive integer with $a(t)\neq 0$,…

We determine the order of magnitude of $\mathbb{E}|\sum_{n \leq x} f(n)|^{2q}$, where $f(n)$ is a Steinhaus or Rademacher random multiplicative function, and $0 \leq q \leq 1$. In the Steinhaus case, this is equivalent to determining the…

We will study the asymptotic behavior of summation functions of a natural argument, including the asymptotic behavior of summation functions of a prime argument in the paper. A general formula is obtained for determining the asymptotic…

We observe a length-$n$ sample generated by an unknown,stationary ergodic Markov process (\emph{model}) over a finite alphabet $\mathcal{A}$. Given any string $\bf{w}$ of symbols from $\mathcal{A}$ we want estimates of the conditional…

In this thesis we show that the partial sums of the Maclaurin series for a certain class of entire functions possess scaling limits in various directions in the complex plane. In doing so we obtain information about the zeros of the partial…

Let $\eta_{1},\eta_2,...$ be independent (not necessarily identically distributed) zero-mean random variables (r.v.'s) such that $|\eta_i|\le1$ almost surely for all $i$, and let $Z$ stand for a standard normal r.v. Let $a_1,a_2,...$ be any…

We show that the $L^1$ norm of an exponential sum of length $X$ and with coefficients equal to the Liouville or M\"{o}bius function is at least $\gg_{\varepsilon} X^{1/4 - \varepsilon}$ for any given $\varepsilon$. For the Liouville…

Following Selberg it is known that uniformly for V << (logloglog T)^{1/2 - \epsilon} the measure of those t \in [T;2T] for which log |\zeta(1/2 + it)| > V*((1/2)loglog T)^{1/2} is approximately T times the probability that a standard…

Let $d(n)$ be the divisor function. In 1916, S. Ramanujan stated but without proof that $$\sum_{n\leq x}d^2(n)=xP(\log x)+E(x), $$ where $P(y)$ is a cubic polynomial in $y$ and $$ E(x)=O(x^{{3\over 5}+\epsilon}), $$ where $\epsilon$ is a…

In this paper we give a refinement of the bound of D. A. Burgess for multiplicative character sums modulo a prime number $q$. This continues a series of previous logarithmic improvements, which are mostly due to H. Iwaniec and E. Kowalski.…

We consider the summatory function of the number of prime factors for integers $\leq x$ over arithmetic progressions. Numerical experiments suggest that some arithmetic progressions consist more number of prime factors than others. Greg…