From 2ba75084c8d7f230fcd8fe2fe506b8d8e71f2de1 Mon Sep 17 00:00:00 2001
From: Thibaut Horel <thibaut.horel@gmail.com>
Date: Mon, 18 May 2015 19:16:14 +0200
Subject: Fix a few typos

---
 paper/sections/model.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to 'paper/sections/model.tex')

diff --git a/paper/sections/model.tex b/paper/sections/model.tex
index bc09f6d..26e1a8d 100644
--- a/paper/sections/model.tex
+++ b/paper/sections/model.tex
@@ -293,7 +293,7 @@ measurements and not the number of cascades.
 \paragraph{Regularity assumptions}
 
 We would like program~\eqref{eq:pre-mle} to be a convex program in order to
-solve it efficiently. A sufficient condition, A sufficient condition is to
+solve it efficiently. A sufficient condition is to
 assume that $\mathcal{L}_i$ is a concave function. This will be the case if,
 for example, $f$ and $(1-f)$ are both log-concave functions. Remember that
 a twice-differentiable function $f$ is log-concave iff. $f''f \leq f'^2$. It is
@@ -319,7 +319,7 @@ non-isolated nodes.  In the Independent Cascade Model, $\frac{f'(z)}{f(z)} =
 as $p_{i,j}\geq \alpha$ for all $(i,j)\in E$ which is always satisfied for some
 $\alpha\in(0,1)$.
 
-For the data-independent bound of Proposition~\ref{prop:fi}, we will the
+For the data-independent bound of Proposition~\ref{prop:fi}, we will require the
 following additional regularity assumption:
 \begin{equation}
   \tag{LF2}
-- 
cgit v1.2.3-70-g09d2

