aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
-rw-r--r--notes/formalisation.tex4
1 files changed, 3 insertions, 1 deletions
diff --git a/notes/formalisation.tex b/notes/formalisation.tex
index a0f7d23..54f7efd 100644
--- a/notes/formalisation.tex
+++ b/notes/formalisation.tex
@@ -97,7 +97,9 @@ For small $\delta_T$, the above equation defines a `loose' orthonormality proper
\section{Warm up: the voter model}
-In the voter model, there are two types of nodes, {\it red} and {\it blue}. At every turn, each node $u$ chooses one of its neighbors uniformly (with probability $\frac{1}{deg(u)}$) and adopts the color of that neighbor. In most cases, we consider that the graphs includes self-loops, meaning the node has the option to keep his color for the next round. We fix a horizon $T$, and a set of {\it blue} nodes, and we observe the evolution of set of $red$ nodes.
+In the voter model, there are two types of nodes, {\it red} and {\it blue}. At every turn, each node $u$ chooses one of its neighbors uniformly (with probability $\frac{1}{deg(u)}$) and adopts the color of that neighbor. In most cases, we consider that the graphs includes self-loops, meaning the node has the option to keep his color for the next round. We fix a horizon $T$, and a set of {\it blue} nodes, and we observe the evolution of set of $red$ nodes.
+
+
\section{Independent Cascade Model}