aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorjeanpouget-abadie <jean.pougetabadie@gmail.com>2015-02-03 14:24:22 -0500
committerjeanpouget-abadie <jean.pougetabadie@gmail.com>2015-02-03 14:24:22 -0500
commita9125f9e7c23063e42eeaceead8c8014686c6427 (patch)
tree7714f2628dbe8588255db0034c21b89a389c13be
parent072f7f0b0a2965d7d640a9fcf5ef60feb0756d93 (diff)
downloadcascades-a9125f9e7c23063e42eeaceead8c8014686c6427.tar.gz
adding experiments section
-rw-r--r--paper/sections/experiments.tex5
-rw-r--r--src/cascade_creation.py3
2 files changed, 6 insertions, 2 deletions
diff --git a/paper/sections/experiments.tex b/paper/sections/experiments.tex
new file mode 100644
index 0000000..f4acc06
--- /dev/null
+++ b/paper/sections/experiments.tex
@@ -0,0 +1,5 @@
+\begin{itemize}
+\item Compare edge recovery to First Edge and Greedy as number of cascades grows on different types of graphs...
+\item Plot upper-bound of parameters in graph as number of cascades grows
+\item Show robustness: plot recall and F1 score for graphs with different number of small edges + "corrected recall' etc...how many strong edges do we get, how many edges to we get in general?
+\end{itemize} \ No newline at end of file
diff --git a/src/cascade_creation.py b/src/cascade_creation.py
index c647b9a..c297f76 100644
--- a/src/cascade_creation.py
+++ b/src/cascade_creation.py
@@ -25,8 +25,7 @@ class InfluenceGraph(nx.DiGraph):
p : proba of rewiring edge
"""
G = nx.connected_watts_strogatz_graph(n, k, p)
- self.add_edges_from(G.edges())
- #TODO: Make the graph directed!
+ G = nx.convert_to_directed(G)
self.add_edges_from(G.edges())
def import_from_file(self, file_name):