Suppose $p=(p_1,p_2,...,p_N)$ is a discrete probability distribution. Are there any assumptions we could make about $p$, say $1/(C_1 N) \leq p_i \leq C_2/N$ for every $i$ and $C_1, C_2>1$, that would enable us to bound from above the following ratio $$\frac{\sum_{i=1}^N p_i \big|\frac{1}{p_i}-N \big|^3}{\big(\sum_{i=1}^N \frac{1}{p_i} -N^2\big)^{3/2}}$$ by a quantity that neither depends on $N$ nor on $p$ ? The problem with separately bounding the nominator from above and the denominator from below is that the denominator equals zero when $p$ is the uniform distribution and I cannot afford an assumption about $p$ that excludes $p$ being close to uniform.
2026-04-04 09:36:32.1775295392
Bounding a ratio that depends on a discrete probability distribution
59 Views Asked by user17762 https://math.techqa.club/user/user17762/detail At
1
There are 1 best solutions below
Related Questions in REAL-ANALYSIS
- how is my proof on equinumerous sets
- Finding radius of convergence $\sum _{n=0}^{}(2+(-1)^n)^nz^n$
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- On sufficient condition for pre-compactness "in measure"(i.e. in Young measure space)
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- Calculating the radius of convergence for $\sum _{n=1}^{\infty}\frac{\left(\sqrt{ n^2+n}-\sqrt{n^2+1}\right)^n}{n^2}z^n$
- Is this relating to continuous functions conjecture correct?
- What are the functions satisfying $f\left(2\sum_{i=0}^{\infty}\frac{a_i}{3^i}\right)=\sum_{i=0}^{\infty}\frac{a_i}{2^i}$
- Absolutely continuous functions are dense in $L^1$
- A particular exercise on convergence of recursive sequence
Related Questions in PROBABILITY
- How to prove $\lim_{n \rightarrow\infty} e^{-n}\sum_{k=0}^{n}\frac{n^k}{k!} = \frac{1}{2}$?
- Is this a commonly known paradox?
- What's $P(A_1\cap A_2\cap A_3\cap A_4) $?
- Prove or disprove the following inequality
- Another application of the Central Limit Theorem
- Given is $2$ dimensional random variable $(X,Y)$ with table. Determine the correlation between $X$ and $Y$
- A random point $(a,b)$ is uniformly distributed in a unit square $K=[(u,v):0<u<1,0<v<1]$
- proving Kochen-Stone lemma...
- Solution Check. (Probability)
- Interpreting stationary distribution $P_{\infty}(X,V)$ of a random process
Related Questions in PROBABILITY-THEORY
- Is this a commonly known paradox?
- What's $P(A_1\cap A_2\cap A_3\cap A_4) $?
- Another application of the Central Limit Theorem
- proving Kochen-Stone lemma...
- Is there a contradiction in coin toss of expected / actual results?
- Sample each point with flipping coin, what is the average?
- Random variables coincide
- Reference request for a lemma on the expected value of Hermitian polynomials of Gaussian random variables.
- Determine the marginal distributions of $(T_1, T_2)$
- Convergence in distribution of a discretized random variable and generated sigma-algebras
Related Questions in UPPER-LOWER-BOUNDS
- Bound for difference between arithmetic and geometric mean
- Show that $\frac{1}{k}-\ln\left(\frac{k+1}{k}\right)$ is bounded by $\frac{1}{k^2}$
- Bounding Probability with Large Variance
- Connectivity of random graphs - proof $\frac{logn}{n}$ is threshold
- Natural log integral inequality
- Spectrum of a matrix after applying an element-wise function (e.g. elementwise log)
- Majorization form for a given set of integers in some interval.
- Proving $(λ^d + (1-λ^d)e^{(d-1)s})^{\frac{1}{1-d}}\leq\sum\limits_{n=0}^\infty\frac1{n!}λ^{\frac{(d^n-1)d}{d-1}+n}s^ne^{-λs}$
- Upper bound for distribution function of the standard normal distribution
- Show $0 < f'(x) \leqslant \frac{1}{2}$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
It cannot be done. Consider $Np_i = 1 + \frac{\epsilon_i}{\sqrt N}$, where the $\epsilon_i$ are small, and $\sum\epsilon_i = 0$. Then $\frac1{Np_i} \approx 1 - \frac{\epsilon_i}{\sqrt N} + \frac{\epsilon_i^2}N$. Then $$ \left(\sum\frac1{p_i} - N^2\right)^{3/2} \approx \left(\sum \epsilon_i^2\right)^{3/2} $$ Also $$ \sum p_i |\tfrac1{p_i}-N|^3 \approx \sum \frac1N |\sqrt N\epsilon_i|^3 = \sum \sqrt N |\epsilon_i|^3 .$$ So if we choose $\epsilon_1 = -\epsilon_2$, and $\epsilon_i = 0$ for $i \ge 3$, we see that the upper bound is larger than a constant times $\sqrt N$.
However, an upper bound of order $\sqrt N$ can be proven. \begin{align} \sum p_i |\tfrac1{p_i}-N|^3 &= \sum p_i^{-1/2} |\tfrac1{\sqrt{p_i}}-N\sqrt{p_i}|^3 \\&\le \left(\sum p_i^{-1/3} |\tfrac1{\sqrt{p_i}}-N\sqrt{p_i}|^2\right)^{3/2} \\&\le \sqrt{C_1 N} \left(\sum |\tfrac1{\sqrt{p_i}}-N\sqrt{p_i}|^2\right)^{3/2},\end{align} and $$ \sum \left(\frac1{\sqrt{p_i}} - N\sqrt{p_i} \right)^2 = \sum\frac1{p_i} - N^2.$$