aboutsummaryrefslogtreecommitdiffstats
path: root/paper
diff options
context:
space:
mode:
authorThibaut Horel <thibaut.horel@gmail.com>2015-03-30 13:51:10 -0400
committerThibaut Horel <thibaut.horel@gmail.com>2015-03-30 13:51:10 -0400
commit842a1685a5fcf9545cc3ef0e79b4ab67781d9ab9 (patch)
tree19f91cb9ee830b73696575f6b9b52c8190ccf691 /paper
parent1c7ad85bbc751bae7cc2e110db5cd6936a2b3816 (diff)
downloadcascades-842a1685a5fcf9545cc3ef0e79b4ab67781d9ab9.tar.gz
Fix minor typo and formulation
Diffstat (limited to 'paper')
-rw-r--r--paper/rebuttal.txt4
1 files changed, 2 insertions, 2 deletions
diff --git a/paper/rebuttal.txt b/paper/rebuttal.txt
index 7e13878..0911224 100644
--- a/paper/rebuttal.txt
+++ b/paper/rebuttal.txt
@@ -64,7 +64,7 @@ This is an interesting point. However, in the problem we study the graph is
unknown to us. Suppose that two cascades start at the same time at two very
different points in the graph. Despite the fact that the infected nodes from
each cascade will not overlap, we cannot in practice attribute an infected node
-to either cascade because this information is hidden to us.
+to either cascade because we don't know which source is closer to it.
"
Running time is not discussed here.
@@ -76,7 +76,7 @@ comparison of running times can be be included.
"
The inference in discrete time, one-time-susceptible contagion
-processes is less interesting and easier than the continuos version.
+processes is less interesting and easier than the continuous version.
"
This is an interesting point. We note that the generalized cascade model class
is sufficiently flexible to include multiple-time-susceptible contagion