From a13116fa67cd0811c8660d38e20500433bb7a3a3 Mon Sep 17 00:00:00 2001
From: jeanpouget-abadie <jean.pougetabadie@gmail.com>
Date: Tue, 19 May 2015 01:15:33 +0200
Subject: fixed typos

---
 paper/sections/intro.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

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

diff --git a/paper/sections/intro.tex b/paper/sections/intro.tex
index cc29ed7..206fbf6 100644
--- a/paper/sections/intro.tex
+++ b/paper/sections/intro.tex
@@ -62,7 +62,7 @@ required number of observed cascades is $\O(poly(s)\log m)$
 \cite{Netrapalli:2012, Abrahao:13}.
 
 A more recent line of research~\cite{Daneshmand:2014} has focused on applying
-advances in sparse recovery to the graph inference problem. Indeed, the graph
+advances in sparse recovery to the network inference problem. Indeed, the graph
 can be interpreted as a ``sparse signal'' measured through influence cascades
 and then recovered.  The challenge is that influence cascade models typically
 lead to non-linear inverse problems and the measurements (the state of the
-- 
cgit v1.2.3-70-g09d2

