Big reorganisation of the repo

1 files changed, 10 insertions, 0 deletions

diff --git a/presentation/extended_abstract.txt b/presentation/extended_abstract.txt
new file mode 100644
index 0000000..47a12b9
--- /dev/null
+++ b/presentation/extended_abstract.txt
@@ -0,0 +1,10 @@
+Title: How can we estimate the parameters of a graph by observing its cascades?
+
+
+A standard problem in Social Network Theory is to understand how the parameters of a graph affect the properties of its cascades, which are diffusion processes that spread from node to node along the graph's weighted edges. In other words, can we predict cascades from the graph's parameters?
+
+Recent work has considered the dual problem: what knowledge about the existence of an edge in the graph do we gain by observing its cascades and how can we leverage that knowledge efficiently? A natural extension to this problem is: can we learn the weights of the graph's edges from cascades? These questions are fundamental to many aspects of social network theory: knowing the parameters of the graph precedes influence maximization or conversely influence minimization. 
+
+In this talk, we present a "sparse recovery" framework for tackling the "graph inference" problem from cascades. This framework achieves a better convergence rate under weaker assumptions than prior work. We show that we (almost) match the lower bound and that our assumptions are robust to approximately sparse graphs. Finally, the approach is validated on synthetic networks.
+
+Joint work with Thibaut Horel
\ No newline at end of file