vbrandl/masterthesis
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Proper math listings

Browse Source
This commit is contained in:
Valentin Brandl 2021-12-07 12:58:08 +01:00
parent 772191c436
commit 51b83bb383
1 changed files with 10 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
content.tex
View File

@ -54,11 +54,18 @@ This lack of a \ac{spof} makes \ac{p2p} botnets more resilient to take-down atte
Formally, a \ac{p2p} botnet can be modeled as a digraph Formally, a \ac{p2p} botnet can be modeled as a digraph
\[ \begin{align*}
G = (V, E) G &= (V, E)
\] \end{align*}
With the set of vertices \(V\) describing the bots in the network and the set of edges \(E\) describing the \enquote{is neighbour of} relationships between bots. With the set of vertices \(V\) describing the bots in the network and the set of edges \(E\) describing the \enquote{is neighbour of} relationships between bots.
For a vertex \(v \in V\), the in and out degree \(\deg^{+}\) and \(\deg^{-}\) describe how many bots know \(v\) or are known by \(v\) respectively.
\begin{align*}
\deg^{+}(v) &= \abs{\{ u \in V \mid (u, v) \in E \}} \\
\deg^{-}(v) &= \abs{\{ u \in V \mid (v, u) \in E \}}
\end{align*}
For a vertex \(v \in V\), the in degree \(\deg^{+}(v) = \abs{\{ u \in V \mid (u, v) \in E \}}\) and out degree \(\deg^{-}(v) = \abs{\{ u \in V \mid (v, u) \in E \}}\) describe how many bots know \(v\) and how many nodes \(v\) knows respectively. For a vertex \(v \in V\), the in degree \(\deg^{+}(v) = \abs{\{ u \in V \mid (u, v) \in E \}}\) and out degree \(\deg^{-}(v) = \abs{\{ u \in V \mid (v, u) \in E \}}\) describe how many bots know \(v\) and how many nodes \(v\) knows respectively.
% TODO: source for constantly growing, position in text % TODO: source for constantly growing, position in text