diff options
Diffstat (limited to 'notes')
| -rw-r--r-- | notes/reportYaron.tex | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/notes/reportYaron.tex b/notes/reportYaron.tex index d5822ed..acdfaea 100644 --- a/notes/reportYaron.tex +++ b/notes/reportYaron.tex @@ -19,9 +19,7 @@ Given a set of observed cascades, the \textbf{graph reconstruction problem} cons \section{Related Work} -There have been several works tackling the graph reconstruction problem in variants of the independent cascade. We briefly summarize their results and approaches below. - - +In previous work, this problem has been formulated in different ways, including a convex optimization and a maximum likelihood problem. However, there is no known algorithm for graph reconstruction with theoretical guarantees and with a reasonable required sample size. \section{The Voter Model} @@ -280,6 +278,7 @@ $\delta_4 = .54$ & $\delta_4 = .37$ & $\delta_4 = .43$ & $\delta_4 = .23$ \\ The results of our findings on a very small social network (a subset of the famous Karate club), show that as the number of cascades increase the RIP constants decrease and that if $p_\text{init}$ is small then the RIP constant decrease as well. Finally the constants we obtain are either under or close to the $.25$ mark set by the authors of \cite{candes}. + \subsection{Testing our algorithm} |