Skip to main content

All Questions

8 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
4 votes
0 answers
131 views

Log of a truncated binomial

Let $X$ follow a binomial distribution with $n$ trials and success probability $p$, and let $0\leq k\leq n$. Are there any natural approximations or bounds for the ratio $$\frac{\boldsymbol{E}\log\...
Tom Solberg's user avatar
  • 4,049
2 votes
0 answers
147 views

How is the Cauchy-Schwarz equality and the assumption on the support of $g$ used to derive this bound?

I am currently reading On Uniqueness Properties of Solutions of Schrödinger Equations and a having trouble understanding a claim made on page 1819. Context from the paper: let $g\in C^\infty_0(\...
Dispersion's user avatar
2 votes
0 answers
65 views

Minimal condition $\sum \rho_{ij} \Psi_{ij} s_i s_j < \sum s_i s_j $, $\mid \rho_{ij} \mid \leq 1$, $s_i \in \mathbb R$ and $\Psi_{ij} \in \{0,1\}$

Consider a sequence of real number $\{s_i\}_{i\leq n}$. Now consider the real numbers $F$, $G$ and $\alpha$ defined below $$F= \sqrt{ \left( \sum ~\rho_{ij} ~\Psi_{ij}~ s_i ~s_j \right)^+}, $$ $$G = ...
user50278's user avatar
  • 123
1 vote
0 answers
370 views

Lower bound on the sum of the product of random variables

Let $X_i$ be the $i$-th element of the vector $X=(X_1, ..., X_m)$ of i.i.d. random variables. I am looking for a lower bound for the expression $\mathbb{P}((\sum^n_{i=1}\prod^{m_i}_{j=1}(X_j))^2 \geq ...
Scriddie's user avatar
  • 129
1 vote
0 answers
234 views

"Tails" of a multinomial distribution

Let $X_1,\dots,X_N$ denote a collection of independent samples of a uniform multinomial random variable in $\mathbb{Z}^k$, with the number of trials equal to $n\ll k$. (By "uniform", I mean ...
Tom Solberg's user avatar
  • 4,049
1 vote
0 answers
118 views

Finding the infimum of the range of a certain non-negative function associated to a $ C^{*} $-algebra

Let $ A $ be a non-trivial $ C^{*} $-algebra and $ n \in \mathbb{N} $. Setting $ \mathcal{D} \stackrel{\text{df}}{=} A^{n} \setminus \{ (0_{A},\ldots,0_{A}) \} $, we can define a function $ f: \...
Transcendental's user avatar
0 votes
0 answers
106 views

Upper bounding the sum with hypergeometric and binomial probabilities

Could you please help me upper bound this tricky expression: $$P(A)=\sum_{i=0}^n{\left( 1 - \dfrac{\binom kq \binom {n-k}{i-q}}{\binom {n}{i}} \right)}^I \binom ni p^i {(1-p)}^{n-i}$$. So far I only ...
abs135's user avatar
  • 1
0 votes
0 answers
131 views

Estimating when does a certain binomial sum exceed an upper bound

Given a fixed integer $n > 0$ and $0 \le m \le n$ let us define the numbers $$f_{n,m} = \sum_{i=\lfloor m/2 \rfloor}^m {n-2i \choose n - m -i}{i+1 \choose m - i +1}.$$ For example $f_{n,0} = 1,f_{...
Jernej's user avatar
  • 3,463