You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
\caption{Friendship network of a UK university faculty. Source: \textbf{igraphdata} R package (Csardi, 2015). Figure drawn using the R package \textbf{netplot} (yours truly, https://github.com/usccana/netplot)}
39
41
\end{figure}
40
42
43
+
## What drives \sout{\color{USCCardinal}social} networks?
44
+
45
+
If \color{gray}\textit{[blank]}\color{black}{} asks you to predict a network\pause
46
+
47
+
\Huge What kind of model?\pause
48
+
49
+
\Huge What features would you include?\pause
50
+
51
+
\normalsize
52
+
41
53
## Exponential Family Random Graph Models (ERGMs)
42
54
43
55
Why are you and I are \color{gray}\textit{[blank]} \color{black}? (friends, collaborators, etc.)
- And since we like things to be positive... we just exponentiate it!
71
+
\note{First, we will focus on counts: "How many edges?", "How many homophilic ties?".
72
+
We will call them "sufficient statistics"}
73
+
\note{As we do in \sout{life} statistics, let's assume it is an additive model (we add stuff up), in a weighted fashion (i.e. we have model parameters!)}
74
+
\note{And since we like things to be positive... we just exponentiate it!}
75
+
\note{Finally, as probabilities should add up to 1, we will divide the thing by the sum of all possible cases (the "normalizing constant")}
Where $\kappa\left(\params, \Indepvar\right)$ is the normalizing constant and equals $\sum_{\graph'\in\GRAPH}\exp{\transpose{\params}\sufstats{\graph', \Indepvar}}$. \pause
98
+
<!-- - The model is centered around a vector of \textbf{sufficient statistics} $\sufstats{}$, and is operationalized as: -->
\large because of \color[HTML]{af0000}$\GRAPH$\color{black},
115
+
the \color[HTML]{5726e7} \textbf{normalizing constant}\color{black}{} is \linebreak[4] a summation of $2^{n(n-1)}$ terms \includegraphics[width=.05\linewidth]{fig/scared.png}!\normalsize\pause
116
+
117
+
-----
118
+
119
+
To solve this, instead of directly computing this function, estimation is done by approximating ratios of likelihood functions instead (TL;DR we use simulations).
- The set of sufficient statistics reflects social and psychological mechanisms that are hypothesized to drive the network structure. Figure \autoref{fig:ergm-structs} shows some examples of values in $\sufstats{}$.\pause
133
+
<!-- Where $\kappa\left(\params, \Indepvar\right)$ is the normalizing constant and equals $\sum_{\graph'\in\GRAPH}\exp{\transpose{\params}\sufstats{\graph', \Indepvar}}$. \pause-->
94
134
95
-
- In the case of directed networks, $\GRAPH$ has $2^{n(n-1)}$ terms.\pause
135
+
<!-- - The set of sufficient statistics reflects social and psychological mechanisms that are hypothesized to drive the network structure. Figure \autoref{fig:ergm-structs} shows some examples of values in $\sufstats{}$.\pause -->
136
+
137
+
<!-- - In the case of directed networks, $\GRAPH$ has $2^{n(n-1)}$ terms.\pause -->
138
+
139
+
<!-- - See Wasserman, Pattison, Robins, Snijders, Handcock, Butts, and others. -->
140
+
141
+
142
+
## Let's get going
143
+
144
+
We will use the famous Monk data from @sampson1969novitiate
145
+
146
+
```{r ergm-monks, message=FALSE}
147
+
library(ergm)
148
+
data(samplk, package="ergm")
149
+
150
+
# A glimpse into a network object (from the network package loaded with ergm)
\caption{\label{fig:ergm-structs}Besides of the common edge count statistic (number of ties in a graph), ERGMs allow measuring other more complex structures that can be captured as sufficient statistics. }
0 commit comments