aboutsummaryrefslogtreecommitdiffstats
path: root/paper
diff options
context:
space:
mode:
authorjeanpouget-abadie <jean.pougetabadie@gmail.com>2015-02-05 11:12:15 -0500
committerjeanpouget-abadie <jean.pougetabadie@gmail.com>2015-02-05 11:12:15 -0500
commit3f3630af30845ab7f305638f6cc2a80abb8435f5 (patch)
treef4c8659991565f0689e2ae6ddb4f2ae8c7ded7f8 /paper
parent661fca9e50e29f072b7e592b82462c744c16355a (diff)
downloadcascades-3f3630af30845ab7f305638f6cc2a80abb8435f5.tar.gz
small changes
Diffstat (limited to 'paper')
-rw-r--r--paper/sections/results.tex3
1 files changed, 1 insertions, 2 deletions
diff --git a/paper/sections/results.tex b/paper/sections/results.tex
index 46521ed..95a0826 100644
--- a/paper/sections/results.tex
+++ b/paper/sections/results.tex
@@ -164,8 +164,7 @@ Choosing $\lambda\defeq 2\sqrt{\frac{\log m}{\alpha n^{1-\delta}}}$ concludes th
proof.
\end{proof}
-Note how the proof of Lemma 3 relied crucially on Azuma-Hoeffding's inequality: by supposing ... We now show how to use Theorem~\ref{thm:main} to recover the support of
-$\theta^*$, that is, to solve the Graph Inference problem.
+Note how the proof of Lemma~\ref{lem:ub} relied crucially on Azuma-Hoeffding's inequality, which allows us to handle correlated observations, and obtain bounds on the number of measurements rather than the number of cascades. We now show how to use Theorem~\ref{thm:main} to recover the support of $\theta^*$, that is, to solve the Graph Inference problem.
\begin{corollary}
\label{cor:variable_selection}