MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).
2

Take a large integer $R$, and let $(X_j)_{j\geq R}$ be a sequence of exponentially distributed random variables with parameters $\pi_j := j^{1+\alpha}$ ($\alpha>0$), so that $\sum_{j\geq R} \frac{1}{\pi_j} < +\infty$. Set $X_R := \sum_{j\geq R} X_j$. Assume that $t>0$ is small enough that $\mathbb{E}X_R \ll t$.

I am interested in good upper bounds for $\mathbb{P}(X_R>t)$. By using $\mathbb{P}(X_R>t) = \mathbb{P}(e^{\lambda X_r}> e^{\lambda t})$, applying Markov's inequality, and optimizing over $\lambda$, I think that I can get bounds like

\begin{equation*}\mathbb{P}(X_R>t)\leq C\exp(-ctR^{1+\varepsilon}) \end{equation*}

for $0<\varepsilon<\alpha$, but I am not sure if these are close to being optimal.

flag

1 Answer

1

This (in a very slightly different setting) is analyzed thoroughly in this paper (Giuliano and Macci, Large deviations for normalized ..., 2012).

link|flag
I am not sure if these results are applicable, since (in the notation of that paper) $\gamma_n$ is required to be infinite, but is necessarily finite in the context I am interested in. – mfolz Aug 17 at 23:13
I haven't read the paper in detail, but even if the results don't apply, I am sure the techniques do... – Igor Rivin Aug 18 at 0:55

Your Answer

Get an OpenID
or

Not the answer you're looking for? Browse other questions tagged or ask your own question.