blob: f4acc06bf2aeeca070a30f6a651bda5155743177 (
plain)
1
2
3
4
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}
|
