相关论文: On monotonicity of Ramanujan function for binomial…
Certain monotonicity properties of the Poisson approximation to the binomial distribution are established. As a natural application of these results, exact (rather than approximate) tests of hypotheses on an unknown value of the parameter…
An asymptotic series in Ramanujan's second notebook (Entry 10, Chapter 3) is concerned with the behavior of the expected value of $\phi(X)$ for large $\lambda$ where $X$ is a Poisson random variable with mean $\lambda$ and $\phi$ is a…
We say that a random integer variable $X$ is monotone if the modulus of the characteristic function of $X$ is decreasing on $[0,\pi]$. This is the case for many commonly encountered variables, e.g., Bernoulli, Poisson and geometric random…
This paper is motivated by determining the location of modes of some unimodal Eulerian-type polynomials. The notion of ratio monotonicity was introduced by Chen-Xia when they investigated the $q$-derangement numbers. Let…
In the article, the authors establish the monotonicity of the ratios \begin{equation*} \frac{B_{2n-1}(t)}{B_{2n+1}(t)}, \quad \frac{B_{2n}(t)}{B_{2n+1}(t)},\quad \frac{B_{2m}(t)}{B_{2n}(t)},\quad \frac{B_{2n}(t)}{B_{2n-1}(t)}…
Let $b(x)$ be the probability that a sum of independent Bernoulli random variables with parameters $p_1, p_2, p_3, \ldots \in [0,1)$ equals $x$, where $\lambda := p_1 + p_2 + p_3 + \cdots$ is finite. We prove two inequalities for the…
We offer an alternative and shorter proof to a result by Jan J.Ub{\o}e about monotonicity properties of a one-dimensional function that appeared in the Mathematical Intelligencer in 2015. Our proof is based on reducing the problem to…
In this paper, the authors present sharp approximations in terms of sine function and polynomials for the so-called Ramanujan constant (or the Ramanujan $R$-function) $R(a)$, by showing some monotonicity, concavity and convexity properties…
This paper studies the problem of testing whether a function is monotone from a nonparametric Bayesian perspective. Two new families of tests are constructed. The first uses constrained smoothing splines, together with a hierarchical…
The ratio monotonicity of a polynomial is a stronger property than log-concavity. Let P(x) be a polynomial with nonnegative and nondecreasing coefficients. We prove the ratio monotone property of P(x+1), which leads to the log-concavity of…
Let X be a random variable. We shall call an independent random variable Y to be a symmetrizer for X, if X+Y is symmetric around zero. A random variable is said to be symmetry resistant if the variance of any symmetrizer Y, is never smaller…
We show an algorithm for computing the permanent of a random matrix with vanishing mean in quasi-polynomial time. Among special cases are the Gaussian, and biased-Bernoulli random matrices with mean 1/lnln(n)^{1/8}. In addition, we can…
A Boolean function $f:\{0,1\}^n \mapsto \{0,1\}$ is said to be $\eps$-far from monotone if $f$ needs to be modified in at least $\eps$-fraction of the points to make it monotone. We design a randomized tester that is given oracle access to…
Shape restrictions such as monotonicity on functions often arise naturally in statistical modeling. We consider a Bayesian approach to the problem of estimation of a monotone regression function and testing for monotonicity. We construct a…
One can consider $\mu$-Martin-L\"of randomness for a probability measure $\mu$ on $2^{\omega}$, such as the Bernoulli measure $\mu_p$ given $p \in (0, 1)$. We study Bernoulli randomness of sequences in $n^{\omega}$ with parameters $p_0,…
Pearson's is the most common correlation statistic, used mainly in parametric settings. Most common among nonparametric correlation statistics are Spearman's and Kendall's. We show that for bivariate normal i.i.d. samples the pairwise…
We prove a lower bound of $\Omega(n^{1/2 - c})$, for all $c>0$, on the query complexity of (two-sided error) non-adaptive algorithms for testing whether an $n$-variable Boolean function is monotone versus constant-far from monotone. This…
In 1845, Bertrand conjectured that for all integers $x\ge2$, there exists at least one prime in $(x/2, x]$. This was proved by Chebyshev in 1860, and then generalized by Ramanujan in 1919. He showed that for any $n\ge1$, there is a…
In a 1916 paper, Ramanujan studied the additive convolution $S_{a, b}(n)$ of sum-of-divisors functions $\sigma_a(n)$ and $\sigma_b(n)$, and proved an asymptotic formula for it when $a$ and $b$ are positive odd integers. He also conjectured…
We consider the problem of testing equality of functions $f_j:[0,1]\to \mathbb{R}$ for $j=1,2,...,J$ the basis of $J$ independent samples from possibly different distributions under the assumption that the functions are monotone. We provide…