diff options
| author | Thibaut Horel <thibaut.horel@gmail.com> | 2015-05-18 19:16:14 +0200 |
|---|---|---|
| committer | Thibaut Horel <thibaut.horel@gmail.com> | 2015-05-18 19:16:14 +0200 |
| commit | 2ba75084c8d7f230fcd8fe2fe506b8d8e71f2de1 (patch) | |
| tree | ff4eb64fb290ea20aeb4af7af19d1608406a94f3 /paper | |
| parent | ea0af4abc93a0ceb099c3e5bb520f6057e9ae215 (diff) | |
| download | cascades-2ba75084c8d7f230fcd8fe2fe506b8d8e71f2de1.tar.gz | |
Fix a few typos
Diffstat (limited to 'paper')
| -rw-r--r-- | paper/sections/model.tex | 4 | ||||
| -rw-r--r-- | paper/sections/results.tex | 2 |
2 files changed, 3 insertions, 3 deletions
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} diff --git a/paper/sections/results.tex b/paper/sections/results.tex index 1db8288..2292ce3 100644 --- a/paper/sections/results.tex +++ b/paper/sections/results.tex @@ -44,7 +44,7 @@ A discussion of the $(S,\gamma)$-{\bf(RE)} assumption in the context of generalized linear cascade models can be found in Section~\ref{sec:re}. In our setting we require that the {\bf(RE)}-condition holds for the Hessian of the log-likelihood function $\mathcal{L}$: it essentially captures the fact that -the binary vectors of the set of active nodes (\emph{i.e} the measurement) are +the binary vectors of the set of active nodes (\emph{i.e} the measurements) are not \emph{too} collinear. |
