Methods.Handbook.tex

%%! Created by: Kaylee Davis
%   https://www.linkedin.com/in/KayleeDavisIN


%%! Document created using R's .rnw document editing, not LaTeX
%   platform (although both should work). UTF-8
%   Consider knitr, index, and bibliography when compiling.
%   Please read preamble, change file locations as necessary.
%   Similarly, some data are called file a local file-path.

%%! All data are free and fair use, but please consider proper citation.
%   Some data have been collected via Google Big Query and TwittR;
%   These data have only partially been deidentified; please consider online
%   privacy when publishing/sharing data used here.


%------------ Quick Note on Coding Conventions -----------------

%  Primarily the intent for the document is in the .pdf output,
%  however, I have taken measures to add notes and organization
%  in the coding of this document, for my own use and for openness
%  to future authors.

%  %--- lines typically divide and add some organization
%  %!   usually indicates an important comment, or section
%  #    The same is true for notes in R code (##!) and (#---)

%----------------------- Preamble ------------------------------

\documentclass[12pt]{article}\usepackage[]{graphicx}\usepackage[]{color}
% maxwidth is the original width if it is less than linewidth
% otherwise use linewidth (to make sure the graphics do not exceed the margin)
\makeatletter
\def\maxwidth{ %
  \ifdim\Gin@nat@width>\linewidth
    \linewidth
  \else
    \Gin@nat@width
  \fi
}
\makeatother

\definecolor{fgcolor}{rgb}{0.882, 0.878, 0.898}
\makeatletter
\@ifundefined{AddToHook}{}{\AddToHook{package/xcolor/after}{\definecolor{fgcolor}{rgb}{0.882, 0.878, 0.898}}}
\makeatother
\newcommand{\hlnum}[1]{\textcolor[rgb]{0.82,0.78,0.62}{#1}}%
\newcommand{\hlstr}[1]{\textcolor[rgb]{0.82,0.78,0.62}{#1}}%
\newcommand{\hlcom}[1]{\textcolor[rgb]{0.404,0.408,0.42}{#1}}%
\newcommand{\hlopt}[1]{\textcolor[rgb]{0.882,0.878,0.898}{#1}}%
\newcommand{\hlstd}[1]{\textcolor[rgb]{0.882,0.878,0.898}{#1}}%
\newcommand{\hlkwa}[1]{\textcolor[rgb]{0.384,0.675,0.808}{\textbf{#1}}}%
\newcommand{\hlkwb}[1]{\textcolor[rgb]{0.902,0.675,0.196}{#1}}%
\newcommand{\hlkwc}[1]{\textcolor[rgb]{0.812,0.522,0.388}{#1}}%
\newcommand{\hlkwd}[1]{\textcolor[rgb]{0.733,0.388,0.812}{#1}}%
\let\hlipl\hlkwb

\usepackage{framed}
\makeatletter
\newenvironment{kframe}{%
 \def\at@end@of@kframe{}%
 \ifinner\ifhmode%
  \def\at@end@of@kframe{\end{minipage}}%
  \begin{minipage}{\columnwidth}%
 \fi\fi%
 \def\FrameCommand##1{\hskip\@totalleftmargin \hskip-\fboxsep
 \colorbox{shadecolor}{##1}\hskip-\fboxsep
     % There is no \\@totalrightmargin, so:
     \hskip-\linewidth \hskip-\@totalleftmargin \hskip\columnwidth}%
 \MakeFramed {\advance\hsize-\width
   \@totalleftmargin\z@ \linewidth\hsize
   \@setminipage}}%
 {\par\unskip\endMakeFramed%
 \at@end@of@kframe}
\makeatother

\definecolor{shadecolor}{rgb}{.97, .97, .97}
\definecolor{messagecolor}{rgb}{0, 0, 0}
\definecolor{warningcolor}{rgb}{1, 0, 1}
\definecolor{errorcolor}{rgb}{1, 0, 0}
\makeatletter
\@ifundefined{AddToHook}{}{\AddToHook{package/xcolor/after}{
\definecolor{shadecolor}{rgb}{.97, .97, .97}
\definecolor{messagecolor}{rgb}{0, 0, 0}
\definecolor{warningcolor}{rgb}{1, 0, 1}
\definecolor{errorcolor}{rgb}{1, 0, 0}
}}
\makeatother
\newenvironment{knitrout}{}{} % an empty environment to be redefined in TeX

\usepackage{alltt}

% Margins:
\usepackage[top = 1in, left = 1in, right = 1in, bottom = 1in]{geometry}

% Holdover packages from long ago:
\usepackage{graphicx, epsfig}                   % tex tools
\usepackage{amsfonts, amsmath, amsthm, amssymb} % Math tools/ symbols
\usepackage{relsize}                            % for mathlarger mathsmaller

% Setting local graphics pathing:
\graphicspath{{C:/Users/mailk/OneDrive/Documents/R/Graduate_Methods_Handbook/figure}}

% No idea:
\usepackage{textcomp} % Just for tildas I think \sim?
\usepackage{verbatim} % No Idea

% For images and stuff, I think:
\usepackage{wrapfig}                                % Wrap Figures and caption easier
\usepackage{setspace}
\usepackage[bookmarks = false, hidelinks]{hyperref} % Hides red box around links
\usepackage{booktabs}
%   \usepackage{subcaption}

%% Type Face/ Font Stuff    % fixed?
\usepackage[english]{babel}
% \usepackage{baskervald}
% \usepackage[T1]{fontenc}
% \usepackage[style = american]{csquotes}

%% Making an Index:
\usepackage{makeidx}

%% Making a Bibliography:
% \usepackage{natbib}
% \bibliographystyle{apsr}
% Reference customization is included in the reference section.

%% Footnote Formatting
% \setlist{nolistsep, noitemsep}
\setlength{\footnotesep}{1.2\baselineskip}
% \deffootnote[.2in]{0in}{0em}{\normalsize\thefootnotemark.\enskip}

%% Section Formatting
\def\ci{\perp\!\!\!\perp}
% \titleformat*{\section}{\large\bfseries}
% \titleformat*{\subsection}{\normalsize\bfseries}

%% Table of Contents Formatting (babel)
\addto\captionsamerican{ \renewcommand*\contentsname{Table of Contents:}}

%! Used in making graphs and plotting:
\usepackage{tikz}
\usetikzlibrary{positioning}
\usepackage{tkz-graph}
\usetikzlibrary{shapes,arrows}
\usepackage{caption}

% Custom Shortcuts:
\newcommand*{\h}{\hspace{5pt}} % for indentation
\newcommand*{\hh}{\h\h}        % double indentation

%! For tables:
\usepackage{dcolumn}
\usepackage{float}  % To use "H" in tables, place in location of LaTeX code
\usepackage{longtable}
\usepackage{array}

% for \thedate and other titling conveniences
\usepackage{titling}
\date{\today} % so that it's today (specified)

% -------------------------------------------------------------------
% ------------------------- Begin Document --------------------------
% -------------------------------------------------------------------
\makeindex
\IfFileExists{upquote.sty}{\usepackage{upquote}}{}
\begin{document}
% \SweaveOpts{concordance=TRUE}
% \graphicspath{Data Files}
\begin{titlepage}
    \begin{center}
        \vspace*{1cm}

        \Huge
        \textbf{Introduction to Data Science With R}

        \vspace{0.5cm}
        \LARGE
        A Survey of Statistical Methodology

        \vspace{1.5cm}
        \textbf{Kaylee L. Davis}

        \vfill

        \Large
        For the most recent version: \\
        \normalsize
        \url{https://github.com/KayleeDavisGitHub/Graduate_Methods_Handbook} \\
        \Large
        Summer 2017 --- \thedate ~(last updated) \\

    \end{center}
\end{titlepage}

% FlushLeft Start:
\begin{flushleft}
\setlength{\parindent}{1cm} %1cm indent

\clearpage

%%! Page for Table of Contents:
\tableofcontents
\thispagestyle{empty}
\clearpage

\section{Introduction}
\setcounter{page}{1}

\subsection{Who Should Read This Book}
\hfill \\

The purpose of this book is to provide an overview and tutorial for executing and critically interpreting various methods. The key contribution of this book is the simplified primer to various data science topics with code for those interested in expanding and learning more.

Beyond the more stream-lined methods topics, there are sections on causal inference, time series modeling, network analysis, and even brief sections devoted to qualitative methodology. The online .pdf version of the book includes hyperlinks for the table of contents and index for quick access to information (useful for reviewing). The scope of this book will be only in R, with rare mentions to other tools like Tableau, Power BI, Python, and SQL.

The book follows various data sets and topics from beer rankings to popular Reddit posts. I have tried my best to include copies of all data tables at the GitHub repository.\footnote{\url{https://github.com/KayleeDavisGitHub/Graduate_Methods_Handbook/tree/master/data}} If the data is not available there the source will be mentioned in the text.

To learn the content in this book better I would suggest applying the basic ideas here to a project you care about, and just taking time to run code and teach others what you've done. This is also not an exhaustive list of statistical methods and I may reference something but never cover it later on. This only covers courses I've taken in my PhD program at Ohio State, but some of my insights from my work later on may be folded in to provide relevance for those in the business or government industry.

Code in this document will appear as follows:




\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{#  Example Code:}
\hlstd{> }\hlstd{X} \hlkwb{<-} \hlstr{"String"}
\hlstd{> }\hlstd{inverse_logit} \hlkwb{<-} \hlkwa{function}\hlstd{(}\hlkwc{x}\hlstd{)\{}
\hlstd{+ }     \hlstd{base}\hlopt{::}\hlkwd{exp}\hlstd{(x)}\hlopt{/}\hlstd{(}\hlnum{1} \hlopt{+} \hlstd{base}\hlopt{::}\hlkwd{exp}\hlstd{(x))}
\hlstd{+ }\hlstd{\}}
\end{alltt}
\end{kframe}
\end{knitrout}


\newpage
\subsection{Why Choose R?}
\hfill \\
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}
\includegraphics[width=\maxwidth,height=0.8\textheight]{figure/GoogleTrends-1} 
\end{knitrout}


%%! Clear page; set page counter at page "1"
\clearpage
%----------------------------------------------------------------------------------

\section{Causal Inference and Assumptions}

What is a \textit{cause}? More specifically, what in social science can really ``cause'' anything, is it ever really measurable? These are the questions that have been plaguing scientists for years, and with increases in methodology and theory we have tried to answer causal questions --- or at the very least, accurately report our assumptions and errors. A lot of the first few pages of this guide will be explicit in describing the assumptions we make with various methods, because these should be explicit for the audience when we find ``causal effects.''

Here we are using one language to define ``cause,'' specifically that used by social scientists, which is the first theoretical assumption. A cause here, in the simplest terms that maximizes the utility of the word -- \textbf{is a treatment}. Anytime you see the word ``cause'' you could also say treatment, and the reverse. Therefore, race, gender, any attribute is \textbf{not} a cause because we can not give people a new race or gender on a fundamental and societal level. But obviously these things matter! Here we would divide up our study, \textit{stratifying} on gender, race, etc for all of those groups which we cannot assign a new race or gender. Being creative in design up front can save a lot of our analysis on the back-end too; for example, creating an online program that generates a name or image for you on some online messenger program may give you a new \textit{perceieved race} or \textit{perceieved gender} which we can randomize and identify. The key point here is that our definition of ``causal'' already introduces some problems, and a lot of what follows is attempting to advert them, understand them, and explain them accurately to the audience through \textit{causal inference}. Causal inference, then, is the way we infer causality through many design and analytic choices. One take-away here is that by broadening our language we strengthen the assumptions we can make, it's a give-and-take that has become convention. \index{cause}

\begin{longtable}{ll}
\hline\noalign{\smallskip}
\textbf{Symbol} & \textbf{Meaning} \\
\noalign{\smallskip}\hline\noalign{\smallskip}
$D$ & Indicating Treatment Group ($1$) or Control Group ($0$)\\
$Y$ & Dependent Variable of Some Theoretical Interest        \\
$Y_0$ and $Y_1$ & Dependent Variable when Controlled or Treated\\
$X$ or $x_1$ etc. & Independent Variables\\
$V$ or $\sigma^2$ & Variance\\
E[~~]  & Expectation of Something, Typically the Mean\\
$E[Y |D]$ & Expectation of Y \textit{Given Some} D\\
$\mu_{ATE}$ & The Average Treatment Effect\\
$\mu_{ATT}$ & The Average Treatment of the Treated Group\\
$\mu_{ATC}$ & The Average Treatment of the Control Group\\
$\xrightarrow[]{d}$ & The Distribution Becomes\\
$n$ or $N$ & The Number of Observations\\
$\mathcal{N}$ & Normally Distributed\\
$\hat{\theta}$ & Estimated Parameters\\
$X_{it}$ & All Rows Within X (i) and At Each Time (t)\\
\noalign{\smallskip}\hline\noalign{\smallskip}
\end{longtable}


\clearpage
%-----------------------------------------------------------------------------------

\subsection{Pearl vs. Rubin Models of Causal Inference}
\hfill \\

We frequently hear the saying ``correlation does not equal causation.''\footnote{For a particularly hilarious article involving correlation versus causation see: Maltzman, Forrest, James H. Lebovic, Elizabeth N. Saunders, and Emma Furth. ``Unleashing presidential power: The politics of pets in the White House.'' PS: Political Science \& Politics 45, no. 3 (2012): 395-400.} Working with similar definitions of ``cause'' Rubin and Pearl are two scholars that have had different approaches to tackling causal inference. Both focus on weighted averages (means) to make the jump between data to the ``real world.'' Note that we could care about the distribution or variance instead of weighted means, but this won't be covered here. Rubin's approach is more algebraic, focusing on how attributes cannot be causal, and specifically stating when errors originate and cross between variables. Pearl leans on graphing theories, creating ``DAG'' plots (this will be covered later) to draw out for readers which variables influence others. Pearl's approach is intuitive and straightforward and seems to encapsulate theory just as well as Rubin's approach but has been criticized for not being explicit enough in error tracking between nodes of the theory plots. However, in some ways Pearl is more explicit algebraically, consider a fundamental mean difference in means between treatment and controls:

\begin{equation}
\text{Rubin approach:} ~~~~ E[Y_1] - E[Y_0]
\end{equation}

\begin{equation}
\text{Pearl approach:} ~~~~ E[Y_1 | \text{do}(D=1)] - E[Y_0 | \text{do}(D=0)]
\end{equation}

Pearl's approach, using the \textit{do()} operator explicitly states what the researcher \textit{did} and does not assume the reader has knowledge of what the researcher did in notation.


\hfill \\
\addcontentsline{toc}{subsubsection}{The DAG Plot}
\noindent \textbf{The DAG Plot:}
\hfill \\

% Here are some examples that should help:
\begin{center}
% The beginning tikzpicture [brackets] has the settings
% and functions for the rest of the graph, the graph will
% generate the nodes (the center connecting points) and
% the paths (the lines intersecting these nodes)

% more details on the measurements of these lines:
% https://tex.stackexchange.com/questions/8260/what-are-the-various-units-ex-em-in-pt-bp-dd-pc-expressed-in-mm
\begin{tikzpicture}[%
    ->,
    shorten >=2pt,
    >=stealth,
    node distance=3cm,
    noname/.style={%
      rectangle,
      minimum width=2em,
      minimum height=2em,
      draw
    }
  ]
  % Nodes:
    \node[noname] (C)                                   {C};
    \node[noname] (D) [node distance=2cm, below right=of C] {D};
    \node[noname] (O) [right=of C]        				{O};
    \node[noname] (Y) [node distance=2cm, below right=of O] {Y};
  % Paths:
    \path (D) edge     node {} (Y)
          (C) edge     node {} (D)
          (C) edge     node {} (O)
          (O) edge     node {} (Y);
\end{tikzpicture}
\end{center}
\hfill

Consider our first plot (above), and imagine that it is some causal ``story'' we wish to convey to the reader. Here C influences both O and D which both influence Y. If we care about the effect of D on Y then we ought be careful that we are not measuring any effect of O on Y as well. This is the backbone to more complex DAG plots, or dynamic acyclic graphs. As a few definitions with these going forward, a \textbf{back door path} is any possible influence that goes into our causal variable rather than coming \textit{from} our causal variable to the dependent variable. Here C is a backdoor path, because Y could influence O (thus C) against the arrow, which in turn gives us false results if we merely measure D on Y. A \textbf{collider} is a node which has multiple variables running into it (in social science most variables will be colliders). Colliders hand-off information into these ``hubs'' which can greatly complicate our findings if not accounted for. Sometimes we may see broken lines or different shapes and subscripts to denote errors in these graphs and how these are thought to exist between nodes. Note that DAG plots are made entirely from theory, and that qualitative and quantitative data alike can sculpt how we might model our causal phenomena of interest. Ultimately we care about a few things, (1) identifying exogenous variation, (2) blocking backdoor paths, (3) sum up the front door paths. But how do we ``block'' these dangerous paths? Well there are many ways, the most common in experiments is to stratify the experiment by the node, but the \textbf{curse of dimensionality} tells us that as we do this more and more we will run out of respondents (countries, etc) to be able to afford all of the strata we may want. Thus, many methods such as matching, and design choices help us account for blocking difficulties. \index{Curse of Dimensionality} \index{DAG} \index{Back-Door-Paths} \index{colliders}

Another great way to account for back-door-paths is to simply randomize, randomize everything in many different ways. By randomizing we shuffle who might get treated or not, with no interaction between them (SUTVA), and no selection into treatment. Although this will be mentioned in detail later. A final note is that sometimes researchers will put coefficients and effect sizes on the edges between nodes to show effects between and within variables of a study. Also when we see circles and dotted lines these are not easily observable variables that are not measurable, or observable.


%----------------------------------------------------------------------
\begin{center}
\begin{tikzpicture}[%
    ->,
    shorten >=2pt,
    >=stealth,
    node distance=2cm,
    noname/.style={%
      rectangle,
      minimum width=2em,
      minimum height=2em,
      draw
    }
  ]
  % Nodes:
    \node[noname] (A)                               {A};
    \node[noname] (u) [circle, node distance=2cm, right=of A]   {u};
    \node[noname] (B) [node distance= 1cm, above =of u]        	{B};
    \node[noname] (C) [right=of u]                  {C};
  % Paths:
    \path (A) edge     node [above] {} (B);
    \path (B) edge     node [above] {} (A);
    \path (B) edge     node [above] {} (C);
    \path (C) edge     node [above] {} (B);
    \path[dashed] (u) edge     node [left]  {} (A);
    \path[dashed] (u) edge     node [right] {} (C);
    \path[dashed] (A) edge     node [left]  {} (u);
    \path[dashed] (C) edge     node [right] {} (u);

    %\draw[->] (C) to [bend right] node [above] {?} (A);
\end{tikzpicture}
\end{center}
%------------------------------------------------------------------------


\subsection{Formal Modeling}

The late statistician George Box once said ``All models are wrong, but some are useful.'' Formal Modeling (which I'll sometimes call game theory interchangeably) can be used to define the the particular assumptions leading to an empirical test. Instead of writing long-hand the history, studies, and assumptions that go alongside our theory we explicitly state relevant ``variables'' in math notation leading right up to a logical empirical test. This has many obvious benefits, chiefly it disciplines one to be explicit with their assumptions (similar, but more involved than DAG plots from the causal inference chapter). Also, this allows for clear objections and revisions to be made by future scholarship. Indeed many models, such as Downs' ``Median Voter Theorem'' has been revised multiple times given the clear writing from the original mathematical formal modeling.


\hfill \\

\noindent \textbf{Utility, First Best, Nash Equilibrium, Comparative Static}

\index{utility}
\noindent To begin, utility is one's preferences for one thing over another. For example, preferring guns to butter:

$$ u_i(\textit{Guns}) = 10 ~~~~ u_i(\textit{Butter}) = 1 $$\\

\noindent Which, note, is the same as this \textit{utility function}:

$$ u_i(\textit{Guns}) = 8,675,309 ~~~~ u_i(\textit{Butter}) = 1,337 $$\\

One's \textit{expected utility} is the mathematical calculation of one's probability of each event happening multiplied by each utility per outcome.\footnote{pg. 339 of Bueno de Mesquita's ``Political Economy for Public Policy has a great example of this. }

\index{First Best} \index{Nash Equilibrium}
\noindent Considering the standard 2x2 matrix format:

  \begin{table}[h!]
  \centering
    \setlength{\extrarowheight}{2pt}
    \begin{tabular}{cc|c|c|}
      & \multicolumn{1}{c}{} & \multicolumn{2}{c}{Player $Y$}\\
      & \multicolumn{1}{c}{} & \multicolumn{1}{c}{$A$}  & \multicolumn{1}{c}{$B$} \\\cline{3-4}
      {Player $X$}  & $A$ & $(x,y)$ & $(x,y)$ \\\cline{3-4} % \multirow{2}* was in front of {player}
      & $B$ & $(x,y)$ & $(x,y)$ \\\cline{3-4}
    \end{tabular}
  \end{table}

The \textit{First Best} is the bolded sections given the best strategic decisions per potential choice by the other player.


  \begin{table}[h!] % here!
  \centering        % I guess this is the only way to center the table?
    \setlength{\extrarowheight}{2pt}
    \begin{tabular}{cc|c|c|}
      & \multicolumn{1}{c}{} & \multicolumn{2}{c}{Country $Y$}\\
      & \multicolumn{1}{c}{} & \multicolumn{1}{c}{Don't Arm}  & \multicolumn{1}{c}{Arm} \\\cline{3-4}
      {Country $X$}  & Don't Arm & $\textbf{4, 4} $ & 0,\textbf{3} \\\cline{3-4}
      & Arm & \textbf{3},0 & 1,1 \\\cline{3-4}
    \end{tabular}
  \end{table}

The \textit{Nash Equilibrium} is the ``first best of the first bests'' or where all players reach an equilibrium around one set of strategies -- even though they may not have the highest pay-off or reward for a particular player. Note that the process here for solving a 3x3 to NxN matrix is similar to the standard 2x2. Also the Nash Equilibrium(a) can be solved algebraically as well; graphically it is the intersection of two lines which represent the strategic continuum a player has. A Nash Equilibrium(a) can be notated by any given variable: $\theta^*$.

\index{subgame perfect Nash Equilibrium}
A variation of the Nash Equilibrium is the \textit{subgame perfect Nash Equilibrium}, or the regular Nash Eqilibria per subgame of a longer, more dynamic, game.

\index{comparative static}
Another term, the \textit{comparative static} is the component of a model that connects our theory to our empiricism through game-theoretic reasoning. Typically the comparative static is deployed in papers to test hypotheses, arrive at novel findings, argue for an expansion of a particular model or theory, or just to describe a phenomenon with more precision than before.



\subsection{Treatment (Causal) Effects, SUTVA, Confounding}

In its simplest form, we care about the difference between the average treated effect and the average control effect. The difference between the two is the \textbf{Naive Differences in Means}, or the naively simple calculation of treatment effects. Why is it naive? Well, we haven't considered any assumptions surrounding the groups, and the fundamental problem of causal inference --- the counterfactual. A counterfactual is the ``what if'' of being in the other group than the one assigned. \index{Naive Differences in Means}

\begin{equation}
\hat{\mu}_\text{Naive} = E[Y|D=1] - E[Y|D=0]
\end{equation}

Think for a second, given all of this, when might the $\hat{\mu}_\text{Naive} = \hat{\mu}_\text{ate}$? Or, when might the naive estimator be the same as our average treatment effect (ATE)? Remember that the reason why $\mu_{naive}$ is naive is because it never observes the counterfactual world.

\hfill \\

\noindent \textit{Answer:}\\

Note that the above equation has no decorations on $Y$, we are assuming that all respondents are not interacting with each other, even over time, (SUTVA) and that our design is absolutely complete (think of a complete DAG plot) such that we really are just getting $ E[Y_1] - E[Y_0]$. So no error, and no SUTVA violation we get the $ate$ to equal $\mu_{Naive}$. \index{SUTVA} Here SUTVA is doing a lot of work, we are assuming with SUTVA that there is no interference and treatment variation ($ Y = Y_1)$. This is a pretty monstrous assumption, countries, people, politicians, the media, \textit{everyone} often communicates and shares what they have been ``treated'' with all the time! Beyond this, treatments often effect people very differently depending on affiliation, openness to feedback, or if you ate breakfast that morning. Some methods like network analysis will embrace this fact instead of avoiding, although this method will not be covered here.

\hfill \\

\noindent SUTVA, or the Stable Unit Treatment Value Assumption, follows two primary tenants:

\hfill \\

\begin{itemize}
\item[1.] That the treated and controlled units are not interacting between one another.
\item[2.] That the method of how someone gets treated does not vary between units, or is at least equivalent.
\end{itemize}

\hfill \\

\noindent Some core assumptions are not only SUTVA (consistency) but also that no \textit{confounding} occurs (also known as selection on observables, ignorability). This is when the people that were to benefit most from the treatment select into the treatment. No confounding formally is: \index{confounding} \index{selection on observables} \index{ignorability}

\begin{equation}
D ~ | ~ Y_1, Y_0 = P(D=1 ~ | ~ Y_1, Y_0)
\end{equation}

This language, by the way, is really annoying because: selection on observables $=$ conditional independence $=$ conditional ignorability $=$ no confounding, conditional on covariates $=$ blocking all back door paths. \index{blocking} \index{selection on observables} \index{back door paths} Open backdoor paths, is Pearlsian DAG-speak for having confounding. If we have more treated folk for each $Y_0$'s than $Y_1$'s then we have imbalance. If X is correlated with $Y_1$ and $Y_0$ for \textit{any reason}, then even though we randomized, then $Y_1$ and $Y_0$ would be informative about $X$ - And therefore $Y_1$ and $Y_0$ would be informative about our treatment D! Therefore we have a broken experiment.

Some other things to look out for is the plug-in estimator and conditional expectation functions, each of these are just examining average treatment effects around conditions (control variables). The \textit{plug-in estimator} is when we condition on and control for the average treatment effect (ATE) summing up over our controlled $X$'s.

\begin{equation}
E_X[E[Y | D = 1, X] - E[Y | D = 0,X]]
\end{equation}

\noindent The conditional expectation function (CEF) is when we take the average treatment effect to see conditional causal effects.

\begin{equation}
E[Y | D] = E[Y_0] + \mu_{ate}D
\end{equation}

We could think about taking into account all variables and possible conditions, this is the hope of Rubin's \textit{saturated model}, which has it's roots in imputation for trying to find missing data (the missing data here in our case would be the counterfactuals). Saturated models do come with particular downsides however, mostly in the errors it produces, and our lack of knowing the exact causal pathway given that adding new variables can open up back-door-paths to our causal estimand. \index{saturated modeling} \index{imputation}


%--------------------------------------------------------------------------------------------------------------
\hfill \\

\subsection{Identification Through Randomization, Hypothesis Testing}

Identification strategies are the attempt to find the missing data that we don't know due to the fundamental problem of causal inference. Two popular paths to do this are using controls and randomization.

There are different types of randomization to help us gain inference. Simple randomization is a probability of treatment per individual ($D$ ``treatment'' being applied) in all possible cases; complete randomization is deciding what fraction of observations we need to fulfill for our total group and then curate our probability of treatment to this. Using randomization, we can hope to ``block'' on these observations (like gender, or X) which we cannot randomly assign.

\begin{equation}
D ~ | ~ Y_1, Y_0 | X ~ \text{or,} ~ P(D=1 ~ | ~ Y_1, Y_0; X) = p
\end{equation}

\hfill \\

Essentially, we could calculate the naive differences in means for each possible estimation of all of treatment and control groups: and that is called randomization inference (Rubin's causal model).


\hfill \\

In hypothesis testing we could just take with and without treatment and see how our distributions converge (remember the t-test stuff)

\begin{equation}
\sqrt{n}(\hat{\mu} - \mu) \xrightarrow[]{d} \mathcal{N}(0, \sigma^2)
\end{equation}

\index{p-values}
Cool, what's the p-values that we get from this? It is saying that conditional on the null hypothesis (i.e., conditional on $\mu_{ate} = 0$ ), what is the (frequentist) probability of observing this extreme an estimate of $\hat{\mu}$? This is typically in regards to a sharp null hypothesis of zero average effects, $Y_1 = Y_0$ always. \index{sharp null hypothesis}


%------------------------------------------------------------------------------------------

\hfill \\

% Slide 45 of causal 4 has regression components.

%------------------------------------------------------------------------------------------
%    Law of iterated expectations? it is when we take the E[E(Y|D)] we can boil it down to E[Y]

\noindent On hypothesis testing, in most cases we start off with testing against a \textit{sharp null hypothesis of zero average effects}. That is, $\mu_{ate} = 0$. Note that this is probably the most boring, unrealistic, and uninteresting null hypothesis that we could ever test against. Does anything, in social science, really ever have a sharp zero effect? Probably not, but we use our handy friends, the z-test and t-test, to find the statistical significance of our finding compared to the zero effect. For small samples we often assume that, because of the large sample size used, the unknown population variance may be replaced by the sample variance. That is, instead of a z score we use a t score:

\begin{equation}
z= \frac{\bar{x} - \mu}{\sigma / \sqrt{n}}
\end{equation}

\noindent one would use:

\begin{equation}
t = \frac{\bar{x} - \mu}{s_x / \sqrt{n}}
\end{equation}


\subsection{Frequentism and Bayesianism}

``Statistics'' has its roots, interestingly, in social sciences as the origins of the word derives from ``state-istics'' or the study of the state. This methodology, uniquely bred for States to understand it's citizenry, statistics have become fascinatingly turned for the \textit{people} to now understand their State. Following World War II this was more important than ever, a social science with deep philosophical, theoretical, and qualitative research began to explode with quantitative methodology in through the 1950's. These methodologies, deeply aided by fields like biology, computer science, and econometric, have both drawn us closer to understanding public and governmental behavior \textit{and} has driven us farther from these concepts as methodology has been misused (e.g. p-hacking), misunderstood, and miscommunicated.

To begin to understand why we use statistics, general linear models, or machine learning, one must first understand a few basic underpinnings of frequentist theory versus Bayesian theory. Frequentism comes in social science largely from R.A. Fisher's idea of likelihood theory of inference. It argues that one true parameter ($\theta$) exists in nature and all scientists are doing are getting multiple samples to guess the one-true-fixed $\theta$. Our results are likelihoods that are close to measuring the one-true DGP but \textbf{always} with some uncertainty. In theory, we can map our estimated DGP $\hat{\theta}$ in two-dimensions pretty easily (think of a basic x--y coordinate grid). Yet, the social world is very complex, as we add more and more variables we begin to get to a point where we find ourselves in hyperspace, unable to map and visualize our surroundings (thus, machine learning helps here, but this will come up later). To help find interesting points when we do these regressions, we (in frequentist theory) seek the MLE or the Maximum Likelihood Estimation. Note this is purposefully not the Maximum \textit{Probabilistic} Estimation, in likelihoodist theory these words mean very different things. The take-away here should be to be careful when speaking in likelihoods (a relative measure of uncertainty) versus probabilities (results only from randomized experiments) as these words have strict definitions in causal inference.

An MLE is interesting because it is the impasse between our estimated parameter $\hat{\theta}$ and our $y$ dependent variable. This typically occurs at the ``highest'' or maximum point on whatever curve we have. Consider the image below, the red line indicates the plateau or maximum point, for the liklihood ($L$) of $y$ (estimated by $x_1$, etc.) on our $\theta$.

\begin{center}
\includegraphics[scale=2]{MLEex}
\end{center}

To find, mathematically, our MLE (which occurs under-the-hood in R) we compute the following: \index{MLE}

\begin{list}{}{}
\item[1.] We $\log$ the likelihood function for ease of computation.
\item[2.] We then take the derivative (also known as the score-function).
\item[3.] Then set this derivative equal to zero (to find our flat top part).
\item[4.] we then solve for $\hat{\theta}$.
\item[5.] We then make sure found the maximum and not some minimum peak (note we could have found the other peak in the above image). To do this we check the sign of the second derivative, if negative we know the curve is downward-facing. We finish by calculating the Fisher information (the second derivative) to find our confidence via variance and standard errors.
\end{list}



\subsection{Running Assumptions}


Typically we trade-off assumptions but can never completely eliminate them, only show or \textit{prove} that we have fulfilled them -- all to get closer to causation (causal inference). Some running assumptions and axioms are:

\begin{itemize}
\item[1.] SUTVA
\item[2.] No confounding
\item[3.] Probability exists only between 0 and 1 (probability axiom).
\end{itemize}

\noindent If we attempt to ``lean-into'' one of these assumptions to be able to measure it, we may come across additional assumptions like ``parallel paths'' or various representation and error assumptions. Some of these will be discussed in the Regression section of this book. Probabilistic axioms can be broken, and probability ranges can be reinterpreted to be from 0 to 200\%, for example, but there's usually no reason for this.


\subsection{Non-parametric Modeling}

A few non-parametric models help us lean away from certain assumptions. This could be an entire class on it's own, but I have a few notes that I'll share here.


\subsubsection{Multiple Comparisons}


\subsubsection{Marginal Structural Models (MSM)}
\index{Marginal Structural Modeling}

If we are working with relational datasets, and do have downstream effects at $t_1$, $t_2$, $t_n$ we cannot solve this problem by using fixed effects. Because we are assuming with fixed effects that our estimands do not change over time, this is actually a core assumption that is violated all the time. However, fear not, for marginal structural models can help us when fixed effects cannot.

Assuming time doesn't influence previous times (which may be an issue if we're studying some forecasting or strategic process that appears in our data). we can look at the outcome in the last time period and stack each time period on top of one another. This is very different from adding a bunch of dummy variables, it is stacking the time periods together; we can treat for the histories in this way and potential influence among them.\footnote{It may be a good idea to check out time series analysis here, just in case you problems can be solved with your data.}

So marginal structural models can work with different treatment histories (arms) than fixed effects. Let's fit a model for every ``D,'' and just weight each of these down the road. We condition the history of past events, and if the model pukes at us then we drop the bad cases and redefine the subsample we are talking about, and how it's still interesting.

Note, we do not get out of the unobservables problem, we still need to set up this model with the same theory and careful design. \textit{You cannot analyize your way out of a bad design. }

Some code to look into, (and notes):

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# GLM has an argument called "weights," don't trust it...}
\hlstd{> }
\hlstd{> }\hlkwd{library}\hlstd{(survey)} \hlcom{# this is better for a variety of reasons.}
\hlstd{> }     \hlkwd{svydesign}\hlstd{(}\hlkwc{ids} \hlstd{= ,} \hlkwc{weights} \hlstd{=} \hlopt{~}\hlnum{1}\hlstd{, data)}
\hlstd{> }     \hlkwd{svyglm}\hlstd{(Y} \hlopt{~} \hlstd{D, unweighted_design,} \hlkwc{family} \hlstd{= quasibinomial)}
\hlstd{> }     \hlkwd{coef}\hlstd{(The_Model)}
\end{alltt}
\end{kframe}
\end{knitrout}

These weighted coefficients can help us, but we can try to stabilize the weights we get, especially in cases of low probability events. For this we need non-dynamic probabilities. Assign these values with R's ``mgcv'' package, and function ``bam'' and some smoothing with \texttt{s()}. Get the t-specific weights, and there are ways to plot the improvements  from doing this. Then, put the weights together (stabilized) so mean around 1, and multiply these easily with \texttt{prod(weights)}. Change out these weights in above, instead of \texttt{1} we can use \texttt{ weights}:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# after checking out:}
\hlstd{> }\hlkwd{library}\hlstd{(mgcv)}
\hlstd{> }     \hlkwd{bam}\hlstd{()}
\hlstd{> }     \hlkwd{s}\hlstd{()}
\hlstd{> }
\hlstd{> }\hlcom{# Then we can edit things:}
\hlstd{> }\hlkwd{library}\hlstd{(survey)} \hlcom{# this is better for a variety of reasons.}
\hlstd{> }     \hlkwd{svydesign}\hlstd{(}\hlkwc{ids} \hlstd{= ,} \hlkwc{weights} \hlstd{=} \hlopt{~}\hlstd{weights, data)}
\hlstd{> }     \hlkwd{svyglm}\hlstd{(Y} \hlopt{~} \hlstd{D, weighted_design,} \hlkwc{family} \hlstd{= quasibinomial)}
\hlstd{> }     \hlkwd{coef}\hlstd{(The_Model)}
\hlstd{> }
\hlstd{> }     \hlcom{# Might wan to check out package: cbmsm}
\end{alltt}
\end{kframe}
\end{knitrout}

We can then get predicted probabilities from our marginal structural models. So essentially with marginal structural models:

\begin{itemize}
\item[1.] Set up data so each outcome has multiple individuals and prior time periods.
\item[2.] Model treatment in each period without tie-varying covariates with them.
\item[3.] Assess balance (repeat 2 if necessary).
\item[4.] stabilize weights.
\item[5.] calculate weighted estimates of QOI's.
\item[6.] What is N anymore? Let's just always bootstrap the heck out of this: doing (2), (4), (5), over 1,000 times over.
\end{itemize}

\hfill \\
\hfill \\

%------------------------------------------------------------

\subsection{Finding Causal Estimands:}

\hfill \\

\subsubsection{Matching and Propensity Scores:}

\textbf{Matching is weighting} each observation to all strata. Much of this is really the same thing, matching is pairing individuals and comparing causal estimands and weighting is forcefully multiplying a ``weight'' onto our variables to pair them to reality (say the Census). Subclassifcation is the same thing, in the long, as matching and weighting. If we don't have exact matches we can use a coarse matching approach where we break up a continuous variable into deciles. This is similar to K-Nearest Neighbor subclassification matching. \index{matching} And a propensity score is just the probability of treatment given some X. \index{propensity scores}

\begin{equation}
e(X) = Pr(D = 1|X)
\end{equation}

The idea is then to coarsen/subclassify or nearest-neighbor match on the \textbf{propensity score}. \index{coarse matching} \index{nearest-neighbor} \textbf{Subclassification} is making the probabilities of treatment and control equivilant in observational studies. Doing this, we help create balance in our treated and controlled groups. This is similar to complete randomization in experimental trials. (What machine learning techniques can help us here?) \index{subclassification}

Some machine learning approaches that can help us here (see machine learning chapter for more) include regression trees and other classification approaches. These can help us identify groups to match on create more balance in our data.




\hfill \\

\subsubsection{Fixed Effects:}

Fixed effects are dummy variables (are stratification) and are turning ``on or off'' a year, country, or some other theoretically interesting variable to ``account'' for the things that pour into a time or place. Using this we assume no carry over between years to previous or future years. Here are the assumptions with fixed effects: \index{Fixed Effects} \index{Marginal Structural Models}

\hfill \\

\begin{itemize}
\item[1.] no unobserved time-varying confounds exist
\item[2.] past outcomes do not directly affect current outcome
\item[3.] past outcomes do not directly affect current treatment
\item[4.] past treatments do not directly affect current outcome
\end{itemize}

\hfill \\

\noindent One larger problem is that the linear fixed effect does not consistently estimate the ATE:

\begin{equation}
\beta_{LFE} \rightarrow \frac{E[V^i \mu^i_{naive}]}{E[V^i]} \neq \mu_{ate}
\end{equation}

\noindent But marginal structural models allow for our times and events to influence one another (more on that later).


\hfill \\

\subsubsection{Differences in Differences}
\index{Differences in Differences}
Differences in Differences is a way to estimate our causal estimand (ATT, ATE, etc) and map it when treatment rolls out. Say we have three time points 1, 2, and 3, where all are untreated at 1, some are treated at 2, and all are treated at 3. To get the estimand from differences in differences we first subtract (getting the difference) of the mean outcomes between times and 2 and time 1 for the treated and controlled then calculate the differences in those two groups between the two time groups. We could do the same thing for 3 and 2. An assumption for difference in differences designs is that things were to be on the same parallel paths, or that we need to prove to the reader (often through theory) that the treated and controlled group -- in a world where no treatment occurred, actually would've been the same (parallel to one another). Further, that it is only our treatment group that caused a change between the control and treated group, not anything that would've happened anyways.

\hfill \\

\subsubsection{Instrumental Variables}

Here imagine we are interested in the causal effect of D --> Y but our errors, or some unknown (u) covariate influences both our treatment and outcome. What we can do is add in some "garbage" variable (Z) into the mix, and see just how Z passes through to Y. It helps me think of "pipes" where we want to see how much [insert liquid here] passes through D to Y, neverminding covariate u.

\begin{center}
\begin{tikzpicture}[%
    ->,
    shorten >=2pt,
    >=stealth,
    node distance=3cm,
    noname/.style={%
      rectangle,
      minimum width=2em,
      minimum height=2em,
      draw
    }
  ]
  % Nodes:
    \node[noname] (Z)                                   {Z};
    \node[noname] (D) [node distance=2cm, right=of Z] {D};
    \node[noname] (Y) [right=of D]        				{Y};
    \node[noname] (u) [circle, node distance=2cm, above right=of D] {u};
  % Paths:
    \path (D) edge     node {} (Y)
          (Z) edge     node {} (D)
          (u) edge     node {} (D)
          (u) edge     node {} (Y);
\end{tikzpicture}
\end{center}
\hfill

\subsection{Conclusion: Causal Inference}

In the end, whether you agree or disagree that causality can truly ever be found in our social world, the efforts we take to ensure that theory is at the forefront of our models is never time wasted. Thinking through - seriously - the exact relationships between our variables and carefully crafting our models make them more convincing be it scientifically, in a business scenario, or in government work. It shows our hand, hides nothing, and clarifies our thinking. It encourages teamwork and collaboration around a shared thought and research agenda, and it helps in presentation by painting a clear picture of the work accomplished. Further chapters are not meant to be shortcuts to this chapter, but additions to it.

%----------------------------------------------------------------------------------
\clearpage
\section{Introductory Statistics}
\hfill \\

While causal effects are certainly the cream-of-the-crop in terms of statistical findings; it's not necessary to examine our social world. In fact, in many cases it's not possible to get causal effects for human behavior. I cannot, for example, randomly assign a population to become black, female, or Hispanic to study the effects of discrimination. However, there is an intersection of causality and correlation: the likelihood. That is, how likely is X to happen, given a list of set assumptions?

There's an example involving famous statistician Ronald Fisher, someone we've heard of. Story has it, someone in his office one day claimed that she was a passionate tea lover, so passionate that she could tell from taste alone whether tea was added to milk or if milk was before the tea. Fisher, ever-fun at parties, questioned the lady's passion with statistical analysis. How would we set up a \textit{causal} analysis of this however? Well, we don't have multiple universes of passionate tea-loving ladies to examine; yet, we can test the lady's abilities against random chance. Assuming random guessing would lend us a 50/50 chance of success if the lady were to defy those odds to such a great detail we could claim her successful. As the story goes, the lady could not correctly guess the difference against random chance after Fisher had her blindfolded and tested. Something deep inside me hopes this story is true.

This all begs the question, how do we statistically examine the degree to which someone ``defies odds'' or what can we call ``statistically significant'' success at something? Fisher, not leaving the world hanging, had other projects besides breaking old ladies hopes and dreams. In a study on manure on farming yields Fisher noted that ``statistical significance'' could be found at three separate thresholds which could be best communicated using associated p-values. These p-values are simply representations of the ``probability of unusualness'' found via transformation of our standard errors giving a set distribution. The thresholds are usually on the 10\% tail (.10), 5\% tail (.05), and the most unusual 1\% tail observations (.01). If a set observation, or population distribution were to exist in these tail regions, passing these thresholds we could claim statistical significance. These thresholds were noted by Fisher to be ``usual, and convenient'' enough in the scientific enterprise to use them universally. This also means that the origins of the p-value are mired in farm manure.

In this section of the methods handbook I'll go over the fundamentals of t-tests, population distributions, z-scores, chi-squared testing, and other tests that all come back to the same notion of testing ``unusualness'' in the world. This may not be causal observations but can be powerful, these tests are deployed by cancer researchers to aerospace engineers - it has saved lives and it's perversion has conversely caused great harm. These examples and many more will be included along the way. Last note, there very well could be a section on our assumptions and tests for them, however I will just integrate these issues alongside the tests and direct specific attention to this in the introduction section on OLS regression.

\subsection{T Testing}

\index{t-test}
Directly, t-score is a ratio between the difference between two groups and the difference within the groups. The larger the t-score, the more difference there is between groups. The smaller the t-score, the more similarity there is between groups. A t-score of 3 means that the groups are three times as different from each other as they are within each other. When you run a t-test, the bigger the t-value, the more likely it is that the results are repeatable. When we work with t-tests we are typically working with sample populations rather than whole population data (with a known $\sigma$ error like we saw with z-testing). There are three ways we usually find a t-test:

\begin{itemize}
\item[1.] An Independent Samples t-test compares the means for two groups.
\item[2.] A Paired sample t-test compares means from the same group at different times (say, one year apart).
\item[3.] A One sample t-test tests the mean of a single group against a known mean. Say, a sample statistic to a census statistic.
\end{itemize}

Each of these follow the same theory with slight variations to account for differences in known variance or not. Each of these test against a standardized null hypothesis of zero average effects ($ H_0 : \mu_1 - \mu_2 = 0$) and, conversely, our alternative hypothesis can be that our sample is anything but zero ($H_A : \mu_1 - \mu_2 \neq 0$) or existing only in one tail ($H_A : \mu_1 - \mu_2 > 0$). However, our alternative hypothesis specification doesn't really change our test much - just our interpretation of the critical values and our multiplicative testing parameter, similar to the z test.

Formally, our t-test takes the following form when we are comparing our data to a known population mean:

$$ t = \frac{\bar{x} - \mu_0}{\sqrt{s^2 / n}} \sim t_{df=n-1} $$

Here $\mu_0$ is our postulated value of the population where as $\bar{x}$ is the sample mean. Our test should, now, not follow a normal distribution but rather a student's t-distribution which is similar to a normal distribution but rather we take into account the degrees of freedom ($n-1$). Why subtract one? Well this is because we ``spend'' one degree of freedom when finding our sample mean, with additional parameters we ``use'' more degrees of freedom in our estimation process. In the denominator we account for our sample variance and the quotient with of our sample size, all square rooted. To find $s$:

$$ s = \sqrt{\frac{(X-\bar{x})^2 \text{...} (X_n - \bar{x})^2 }{n-1}} $$

Recall our degrees of freedom being calculated in $s$ not in the actual t-test. Without speeding ahead too fast let's stop and consider an example before opening it up to two sample differences. Suppose we gave a small class an exam from a well-published textbook. The textbook company claims that, on average, students get an 85\% on the exam. Is our class \textit{significantly} better or worse than the national average?

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Class scores:}
\hlstd{> }\hlstd{class1} \hlkwb{<-} \hlkwd{c}\hlstd{(}\hlnum{60}\hlstd{,}\hlnum{70}\hlstd{,}\hlnum{80}\hlstd{,}\hlnum{78}\hlstd{,}\hlnum{98}\hlstd{,}\hlnum{86}\hlstd{,}\hlnum{78}\hlstd{,}\hlnum{82}\hlstd{,}\hlnum{93}\hlstd{,}\hlnum{99}\hlstd{,}\hlnum{86}\hlstd{,}\hlnum{86}\hlstd{,}\hlnum{79}\hlstd{,}\hlnum{0}\hlstd{,}\hlnum{77}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlcom{# Finding s:}
\hlstd{> }\hlstd{s} \hlkwb{<-} \hlkwd{sqrt}\hlstd{(} \hlkwd{sum}\hlstd{(((class1} \hlopt{-} \hlkwd{mean}\hlstd{(class1))}\hlopt{^}\hlnum{2}\hlstd{))} \hlopt{/} \hlkwd{length}\hlstd{(class1)}\hlopt{-}\hlnum{1}\hlstd{)}
\hlstd{> }\hlcom{# Finding our t statistic:}
\hlstd{> }\hlstd{t} \hlkwb{<-} \hlstd{(}\hlkwd{mean}\hlstd{(class1)} \hlopt{-} \hlnum{85}\hlstd{)} \hlopt{/} \hlstd{(}\hlkwd{sqrt}\hlstd{(s}\hlopt{^}\hlnum{2}\hlopt{/}\hlkwd{length}\hlstd{(class1)))}
\hlstd{> }\hlstd{t}
\end{alltt}
\begin{verbatim}
## [1] -1.400315
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# p-value:}
\hlstd{> }\hlkwd{pt}\hlstd{(t,} \hlkwc{df} \hlstd{=} \hlkwd{length}\hlstd{(class1)}\hlopt{-}\hlnum{1}\hlstd{)} \hlcom{# using t-distribution! (pt)}
\end{alltt}
\begin{verbatim}
## [1] 0.09159503
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# Testing this against R's function}
\hlstd{> }\hlstd{r_results} \hlkwb{<-} \hlkwd{t.test}\hlstd{(class1,} \hlkwc{mu}\hlstd{=}\hlnum{85}\hlstd{)}
\hlstd{> }\hlstd{r_results}\hlopt{$}\hlstd{statistic}
\end{alltt}
\begin{verbatim}
##        t 
## -1.35152
\end{verbatim}
\end{kframe}
\end{knitrout}

We see that according to Fisher's definition of statistical significance we pass the 10\% threshold of ``unusualness'' but not the significance level of .05 or .01.

Suppose we were to compare exam scores for our class to a comparative school across a local river. Here we would need to use to two-sample t-test. Luckily, the formula doesn't change much except that we need a pooled sample standard deviation in the denominator:

$$ t = \frac{\bar{x}-\bar{y}}{Sp \sqrt{1/m + 1/n}} $$

Where our $Sp$ standardized deviation is:

$$ Sp = \sqrt{ \frac{ (x_1 - \bar{x})^2 + \text{...} + (x_m - \bar{x})^2 + (y_1 - \bar{y})^2 + \text{...} + (y_n - \bar{y})^2  }{m+n -2}} $$

Note the pooled observation $-2$ because of the two sample mean estimations already used. This follows the same t-distribution ($t_{m+n-2}$). Is our class significantly better than the other schools?

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Two samples:}
\hlstd{> }\hlstd{class1} \hlkwb{<-} \hlkwd{c}\hlstd{(}\hlnum{60}\hlstd{,}\hlnum{70}\hlstd{,}\hlnum{80}\hlstd{,}\hlnum{78}\hlstd{,}\hlnum{98}\hlstd{,}\hlnum{86}\hlstd{,}\hlnum{78}\hlstd{,}\hlnum{82}\hlstd{,}\hlnum{93}\hlstd{,}\hlnum{99}\hlstd{,}\hlnum{86}\hlstd{,}\hlnum{86}\hlstd{,}\hlnum{79}\hlstd{,}\hlnum{0}\hlstd{,}\hlnum{77}\hlstd{)}
\hlstd{> }\hlstd{class2} \hlkwb{<-} \hlkwd{c}\hlstd{(}\hlnum{40}\hlstd{,}\hlnum{100}\hlstd{,}\hlnum{81}\hlstd{,}\hlnum{88}\hlstd{,}\hlnum{98}\hlstd{,}\hlnum{86}\hlstd{,}\hlnum{90}\hlstd{,}\hlnum{82}\hlstd{,}\hlnum{93}\hlstd{,}\hlnum{99}\hlstd{,}\hlnum{86}\hlstd{,}\hlnum{86}\hlstd{,}\hlnum{80}\hlstd{)}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlcom{# Using Cohen 1988:}
\hlstd{> }\hlstd{sp} \hlkwb{<-} \hlkwd{sqrt}\hlstd{(} \hlkwd{sd}\hlstd{(class1)}\hlopt{^}\hlnum{2} \hlopt{+} \hlkwd{sd}\hlstd{(class2)}\hlopt{^}\hlnum{2} \hlopt{/} \hlnum{2}\hlstd{)}
\hlstd{> }\hlcom{# But wait:}
\hlstd{> }\hlkwd{sd}\hlstd{(class1)} \hlopt{==} \hlkwd{sd}\hlstd{(class2)}
\end{alltt}
\begin{verbatim}
## [1] FALSE
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlstd{t} \hlkwb{<-} \hlstd{(}\hlkwd{mean}\hlstd{(class1)} \hlopt{-} \hlkwd{mean}\hlstd{(class2))} \hlopt{/}
\hlstd{+ }     \hlkwd{sqrt}\hlstd{(} \hlkwd{sd}\hlstd{(class1)}\hlopt{^}\hlnum{2}\hlopt{/}\hlkwd{length}\hlstd{(class1)} \hlopt{+} \hlkwd{sd}\hlstd{(class2)}\hlopt{^}\hlnum{2}\hlopt{/}\hlkwd{length}\hlstd{(class2))}
\hlstd{> }\hlcom{# p-value; x2 for both tails}
\hlstd{> }\hlnum{2}\hlopt{*}\hlkwd{pt}\hlstd{(t,} \hlkwc{df} \hlstd{= (}\hlkwd{length}\hlstd{(class1)} \hlopt{+} \hlkwd{length}\hlstd{(class2)} \hlopt{-} \hlnum{2}\hlstd{) )}
\end{alltt}
\begin{verbatim}
## [1] 0.259778
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlstd{r_results} \hlkwb{<-} \hlkwd{t.test}\hlstd{(class1,class2)}
\hlstd{> }\hlstd{r_results}\hlopt{$}\hlstd{statistic}
\end{alltt}
\begin{verbatim}
##         t 
## -1.152065
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlstd{r_results}\hlopt{$}\hlstd{p.value}
\end{alltt}
\begin{verbatim}
## [1] 0.2605557
\end{verbatim}
\end{kframe}
\end{knitrout}

Note that here we could not prove that our standard deviations are equal so we had to do a different standard deviation test where the denominator uses the standard deviations independently instead of pooling them. Our results are exactly what R's t.test function would have given us however it should be noted that there is some nuance here in selecting exactly how we account for standard deviations. For more information consider Welch's t-test versus choosing the smaller df as a conservative estimate against our Type 1 error.

Above I used a very sharp test to see if our standard deviations were equal or not, however we can add some nuance to this assumption and see if our standard deviations are significantly different from one another. Testing this assumption can be done with an F-test. \index{F-test} Unsurprisingly, the ``F'' in F-test is in regards to Fisher who thought the F-test could be used to help researchers make better decisions in the variation of t-test they use.

$$ F = \frac{s_x^2}{s_y^2} \sim F_{m-1,n-1,\alpha} $$

Using an F-test table we can find our critical value and test the null hypothesis that $s_x - s_y = 0$. That is, if we reject the null hypothesis using the F-test we would not use a pooled test and if we could not reject the null we would have to keep the standard deviations separated.



\subsection{Z Testing}

$$ z = \frac{\bar{x} - \mu_0}{\sigma / \sqrt{n}} $$ This is distributed normal mean 0 standard deviation of 1.


$$ z = \frac{ \bar{x} - \bar{y} - E[\bar{x}-\bar{y}]}{SD(\bar{x}-\bar{y})} $$

Where $E[\bar{x}-\bar{y}]$ is just our null hypothesis statement, note our null hypothesis argues zero average ($E$) effects - so this usually just wipes out given the zero. So what we get is:

$$ z = \frac{\bar{x}-\bar{y} }{\sqrt{\sigma_x^2/m  + \sigma_y^2/n}} $$

We would take this result, compare it with a z-table depending on our $\alpha$ and either use our observed value to either reject or accept the null. These z-tables can be found online and basically act as the pass/fail for much of these scores.

If our standard deviations are equal then we can:

$$ z = \frac{\bar{x}-\bar{y} }{\sigma \sqrt{1/m  + 1/n}} $$

Finding confidence intervals for all of this are as simple as taking the upper and lower threshold desired (say 95 percent or 90 percent) and then reporting the upper/lower in a table. Some models in the regression segment will do this for variety.

I found a really good article online about confidence intervals if you are looking for more notes on this:
\url{http://sphweb.bumc.bu.edu/otlt/MPH-Modules/BS/BS704_Confidence_Intervals/BS704_Confidence_Intervals_print.html}

\subsection{Chi-Squared Testing}

The chi-square test of independence is used to analyze the frequency table (i.e. contingency table) formed by two categorical variables. The chi-square test evaluates whether there is a significant association between the categories of the two variables.

Let's review an example of this in R. We'll pull R's native iris data and separate the sepal lengths into two categorical variables - big and small depending on if it's above or below the median.

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlstd{dat} \hlkwb{<-} \hlstd{iris}
\hlstd{> }
\hlstd{> }\hlstd{dat}\hlopt{$}\hlstd{size} \hlkwb{<-} \hlkwd{ifelse}\hlstd{(dat}\hlopt{$}\hlstd{Sepal.Length} \hlopt{<} \hlkwd{median}\hlstd{(dat}\hlopt{$}\hlstd{Sepal.Length),}
\hlstd{+ }  \hlstr{"small"}\hlstd{,} \hlstr{"big"}
\hlstd{+ }\hlstd{)}
\hlstd{> }
\hlstd{> }\hlcom{# here's our contingency table:}
\hlstd{> }\hlkwd{table}\hlstd{(dat}\hlopt{$}\hlstd{Species, dat}\hlopt{$}\hlstd{size)}
\end{alltt}
\begin{verbatim}
##             
##              big small
##   setosa       1    49
##   versicolor  29    21
##   virginica   47     3
\end{verbatim}
\end{kframe}
\end{knitrout}


This is great, and below we will use R functions to calculate that chi-squared statistic:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# calculate chi-squared (full results)}
\hlstd{> }\hlstd{test} \hlkwb{<-} \hlkwd{chisq.test}\hlstd{(}\hlkwd{table}\hlstd{(dat}\hlopt{$}\hlstd{Species, dat}\hlopt{$}\hlstd{size))}
\hlstd{> }\hlstd{test} \hlcom{# full results}
\end{alltt}
\begin{verbatim}
## 
## 	Pearson's Chi-squared test
## 
## data:  table(dat$Species, dat$size)
## X-squared = 86.035, df = 2, p-value < 2.2e-16
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlstd{test}\hlopt{$}\hlstd{statistic} \hlcom{# chi-squared result}
\end{alltt}
\begin{verbatim}
## X-squared 
##  86.03451
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlstd{test}\hlopt{$}\hlstd{p.value} \hlcom{# p-value}
\end{alltt}
\begin{verbatim}
## [1] 2.078944e-19
\end{verbatim}
\end{kframe}
\end{knitrout}

From the output and from test p.value argument we see that the p-value is less than the significance level of 5\%. Like any other statistical test, if the p-value is less than the significance level, we can reject the null hypothesis.

Finally, we can combine the contingency table with the statistical results together in a concise visual:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# This gives us the ability to make mosaic plots pretty easily.}
\hlstd{> }\hlkwd{library}\hlstd{(vcd)}
\end{alltt}


{\ttfamily\noindent\color{warningcolor}{\#\# Warning: package 'vcd' was built under R version 4.1.3}}

{\ttfamily\noindent\itshape\color{messagecolor}{\#\# Loading required package: grid}}\begin{alltt}
\hlstd{> }\hlkwd{mosaic}\hlstd{(}\hlopt{~} \hlstd{Species} \hlopt{+} \hlstd{size,}
\hlstd{+ }  \hlkwc{direction} \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"v"}\hlstd{,} \hlstr{"h"}\hlstd{),}
\hlstd{+ }  \hlkwc{data} \hlstd{= dat,}
\hlstd{+ }  \hlkwc{shade} \hlstd{=} \hlnum{TRUE}
\hlstd{+ }\hlstd{)}
\end{alltt}
\end{kframe}
\includegraphics[width=\maxwidth]{figure/chisquared3-1} 
\end{knitrout}

This mosaic plot with colored cases shows where the observed frequencies deviates from the expected frequencies if the variables were independent. The red cases means that the observed frequencies are smaller than the expected frequencies, whereas the blue cases means that the observed frequencies are larger than the expected frequencies.


\subsection{Permutation Testing}

\index{permutation}

Much of this section on permutation testing comes straight from Thomas Leeper upon me meeting him at Ohio State in 2016. I highly recommend following him on Github, or checking out the relevant article for this section linked at the end of this section.

Thomas writes that an increasingly common statistical tool for constructing sampling distributions is the permutation test (or sometimes called a randomization test). Like bootstrapping, a permutation test builds - rather than assumes - sampling distribution (called the ``permutation distribution'') by resampling the observed data. Specifically, we can ``shuffle'' or permute the observed data (e.g., by assigning different outcome values to each observation from among the set of actually observed outcomes). Unlike bootstrapping, we do this without replacement.

Permutation tests are particularly relevant in experimental studies, where we are often interested in the sharp null hypothesis of no difference between treatment groups. In these situations, the permutation test perfectly represents our process of inference because our null hypothesis is that the two treatment groups do not differ on the outcome (i.e., that the outcome is observed independently of treatment assignment). When we permute the outcome values during the test, we therefore see all of the possible alternative treatment assignments we could have had and where the mean-difference in our observed data falls relative to all of the differences we could have seen if the outcome was independent of treatment assignment. While a permutation test requires that we see all possible permutations of the data (which can become quite large), we can easily conduct ``approximate permutation tests'' by simply conducting a vary large number of resamples. That process should, in expectation, approximate the permutation distribution.

For example, if we have only n=20 units in our study, the number of permutations is:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{factorial}\hlstd{(}\hlnum{20}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1] 2.432902e+18
\end{verbatim}
\end{kframe}
\end{knitrout}

That number exceeds what we can reasonably compute. But we can randomly sample from that permutation distribution to obtain the approximate permutation distribution, simply by running a large number of resamples. Let's look at this as an example using some made up data:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{set.seed}\hlstd{(}\hlnum{1}\hlstd{)}
\hlstd{> }\hlstd{n} \hlkwb{<-} \hlnum{100}
\hlstd{> }\hlstd{tr} \hlkwb{<-} \hlkwd{rbinom}\hlstd{(}\hlnum{100}\hlstd{,} \hlnum{1}\hlstd{,} \hlnum{0.5}\hlstd{)}
\hlstd{> }\hlstd{y} \hlkwb{<-} \hlnum{1} \hlopt{+} \hlstd{tr} \hlopt{+} \hlkwd{rnorm}\hlstd{(n,} \hlnum{0}\hlstd{,} \hlnum{3}\hlstd{)}
\end{alltt}
\end{kframe}
\end{knitrout}

The difference in means is, as we would expect (given we made it up), about 1:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{diff}\hlstd{(}\hlkwd{by}\hlstd{(y, tr, mean))}
\end{alltt}
\begin{verbatim}
## [1] 1.341389
\end{verbatim}
\end{kframe}
\end{knitrout}

To obtain a single permutation of the data, we simply resample without replacement and calculate the difference again:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlstd{s} \hlkwb{<-} \hlkwd{sample}\hlstd{(tr,} \hlkwd{length}\hlstd{(tr),} \hlnum{FALSE}\hlstd{)}
\hlstd{> }\hlkwd{diff}\hlstd{(}\hlkwd{by}\hlstd{(y, s, mean))}
\end{alltt}
\begin{verbatim}
## [1] 1.283456
\end{verbatim}
\end{kframe}
\end{knitrout}

Here we use the permuted treatment vector s instead of tr to calculate the difference and find a very small difference. If we repeat this process a large number of times, we can build our approximate permutation distribution (i.e., the sampling distribution for the mean-difference). We'll use replicate do repeat our permutation process. The result will be a vector of the differences from each permutation (i.e., our distribution):

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlstd{dist} \hlkwb{<-} \hlkwd{replicate}\hlstd{(}\hlnum{2000}\hlstd{,} \hlkwd{diff}\hlstd{(}\hlkwd{by}\hlstd{(y,} \hlkwd{sample}\hlstd{(tr,} \hlkwd{length}\hlstd{(tr),} \hlnum{FALSE}\hlstd{), mean)))}
\end{alltt}
\end{kframe}
\end{knitrout}

We can look at our distribution using hist and draw a vertical line for our observed difference:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{hist}\hlstd{(dist,} \hlkwc{xlim} \hlstd{=} \hlkwd{c}\hlstd{(}\hlopt{-}\hlnum{3}\hlstd{,} \hlnum{3}\hlstd{),} \hlkwc{col} \hlstd{=} \hlstr{"black"}\hlstd{,} \hlkwc{breaks} \hlstd{=} \hlnum{100}\hlstd{)}
\hlstd{> }\hlkwd{abline}\hlstd{(}\hlkwc{v} \hlstd{=} \hlkwd{diff}\hlstd{(}\hlkwd{by}\hlstd{(y, tr, mean)),} \hlkwc{col} \hlstd{=} \hlstr{"blue"}\hlstd{,} \hlkwc{lwd} \hlstd{=} \hlnum{2}\hlstd{)}
\end{alltt}
\end{kframe}
\includegraphics[width=4in]{figure/perm6-1} 
\end{knitrout}

At face value, it seems that our null hypothesis can probably be rejected. Our observed mean-difference appears to be quite extreme in terms of the distribution of possible mean-differences observable were the outcome independent of treatment assignment. But we can use the distribution to obtain a p-value for our mean-difference by counting how many permuted mean-differences are larger than the one we observed in our actual data. We can then divide this by the number of items in our permutation distribution (i.e., 2000 from our call to replicate, above):

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{sum}\hlstd{(dist} \hlopt{>} \hlkwd{diff}\hlstd{(}\hlkwd{by}\hlstd{(y, tr, mean)))}\hlopt{/}\hlnum{2000}  \hlcom{# one-tailed test}
\end{alltt}
\begin{verbatim}
## [1] 0.012
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{sum}\hlstd{(}\hlkwd{abs}\hlstd{(dist)} \hlopt{>} \hlkwd{abs}\hlstd{(}\hlkwd{diff}\hlstd{(}\hlkwd{by}\hlstd{(y, tr, mean))))}\hlopt{/}\hlnum{2000}  \hlcom{# two-tailed test}
\end{alltt}
\begin{verbatim}
## [1] 0.021
\end{verbatim}
\end{kframe}
\end{knitrout}

Using either the one-tailed test or the two-tailed test, our difference is unlikely to be due to chance variation observable in a world where the outcome is independent of treatment assignment.

There are many packages that assist in permutation testing and sampling, a few are used in future chapters. One Thomas Leeper uses in his article (quoted nearly verbatim in this chapter) is the library ``coin''. Visit his article linked below to review this package to see if it may help. \\


\noindent \url{https://github.com/leeper}
\noindent \url{https://thomasleeper.com/Rcourse/Tutorials/permutationtests.html}


\clearpage
\section{Regression:}

\begin{equation}
\mathlarger{ y = \beta_0 + \beta X + \epsilon }
\end{equation}

The General Linear Model (GLM) consists of a \textit{stochastic and systematic} components. The stochastic component is the section in the equation which changes (``randomly'') and has error our error term ($\epsilon$), whereas the systematic component remains constant with data values ($X$) and is used to test our dependent variable ($y$) and give us interpretive values in the form of coefficients ($\beta$). To ``generalize'' this to other models (as we'll see in this document) we need a distribution and a link function, which will come up later.

It should be mentioned that this GLM formula has it's genesis in basic geometry's equation for a line $y=mx + b$ the root of this should be intuitive as we attempt to fit a line to our data and estimate it using maximum likelihood.

No matter what the model we're specifying throughout this document, be it logit, probit, Poisson, or survival models the linear predictor will always be the same:

\begin{equation}
\mathlarger{ \eta = X\beta \text{ \text{  }  or,  }}
\mathlarger{ \eta_i = \beta_0 + \beta_1 x_{i1} \textbf{...} \beta_q x_{iq} }
\end{equation}
One example of when we might use regression is when trying to determine the best quality of beer based upon mean judged ratings, these are the questions that matter the most. Beer ratings range from $-1$: ``Fair'', to $0$: ``Good'', and $1$: ``Great.'' Consider our first model where we consider how expensive the beer is:

\begin{equation}
\mathlarger{ \text{Beer Rating} = \beta_0 + \beta \text{Beer Price} + \epsilon }
\end{equation}

\noindent Given the information from our data regressed in R: (This is shown on the following page)

\begin{equation}
\mathlarger{ \text{Beer Rating} = (-0.76) + (.26) \text{Beer Price} + \text{error} }
\end{equation}

We can solve this to find our beer rating with the substitution of a beer price, we remove the error term because we assume it's normally distributed and centered at zero (an assumption that will come up in the following section). Let's assume we are going out with friends and only have \$2.00:

\begin{equation}
\mathlarger{  \text{Beer Rating} = (-0.76)+(.26)\cdot 2.00 = -.24 }
\end{equation}

This means, given that our average (``Good'') beer rating is zero, that if we only had two dollars to spend on a beer we would get a slightly below average beer ($-.24$). This is assuming the price of beer and rating of beer is a linear relationship, this isn't an assumption we always have to make but one we will for now.

\clearpage
\noindent Showing this in R, let's load and set up our data and run the model that we used to get the numbers above: \index{loading data} \index{recoding data}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{## Initial pass: reading data, looking at variables.}
\hlstd{> }
\hlstd{> }\hlkwd{library}\hlstd{(readr)} \hlcom{# For reading data.}
\hlstd{> }\hlcom{# KayleeDavisGithub/Graduate_Methods_Handbook/master/data/beer.csv}
\hlstd{> }\hlstd{beer_data} \hlkwb{<-} \hlkwd{read_csv}\hlstd{(}\hlstr{"https://raw.githubusercontent.com/KayleeDavisGithub/Graduate_Methods_Handbook/master/data/beer.csv"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlkwd{library}\hlstd{(car)} \hlcom{# for ease of recoding variables}
\hlstd{> }\hlcom{# Our Beer ratings could be coded more intuitively:}
\hlstd{> }\hlstd{beer_data}\hlopt{$}\hlstd{rating} \hlkwb{<-} \hlkwd{as.numeric}\hlstd{(beer_data}\hlopt{$}\hlstd{rating)}
\hlstd{> }\hlkwd{head}\hlstd{(beer_data)} \hlcom{# Check out the variables we have available to us:}
\end{alltt}
\begin{verbatim}
## # A tibble: 6 x 16
##    ...1 rating beer     origin avail price  cost calories sodium alcohol class
##   <dbl>  <dbl> <chr>    <chr>  <dbl> <dbl> <dbl>    <dbl>  <dbl>   <dbl> <chr>
## 1     1     NA Anchor ~ USA        1  7.19  1.2       154     17     4.7 Supe~
## 2     2     NA Labatts  Canada     1  3.15  0.53      147     17     5   Prem~
## 3     3     NA Molson   Canada     1  3.35  0.56      154     17     5.1 Prem~
## 4     4     NA Budweis~ USA        0  2.59  0.43      144     15     4.7 Prem~
## 5     5     NA Heineken Holla~     0  4.59  0.77      152     11     5   Supe~
## 6     6     NA Kronenb~ France     1  4.39  0.73      170      7     5.2 Supe~
## # ... with 5 more variables: light <chr>, us <dbl>, quality <dbl>,
## #   good <dbl>, verygood <dbl>
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{nrow}\hlstd{(beer_data)} \hlcom{# For 35 beers:}
\end{alltt}
\begin{verbatim}
## [1] 35
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# Let's recode our rating dependent variable to be more intuitive:}
\hlstd{> }\hlcom{# reassign values: where 3 is now 0, etc..}
\hlstd{> }\hlstd{beer_data}\hlopt{$}\hlstd{rating} \hlkwb{<-} \hlkwd{recode}\hlstd{(beer_data}\hlopt{$}\hlstd{rating,} \hlstr{"3=0; 2=1; 1=2"}\hlstd{)}
\hlstd{> }\hlkwd{class}\hlstd{(beer_data}\hlopt{$}\hlstd{rating)} \hlcom{# numeric and coded intuitively, could be better...}
\end{alltt}
\begin{verbatim}
## [1] "numeric"
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# From -1 to 1}
\hlstd{> }\hlstd{beer_data}\hlopt{$}\hlstd{rating} \hlkwb{<-} \hlkwd{recode}\hlstd{(beer_data}\hlopt{$}\hlstd{rating,} \hlstr{"0=-1"}\hlstd{)}
\hlstd{> }\hlstd{beer_data}\hlopt{$}\hlstd{rating} \hlkwb{<-} \hlkwd{recode}\hlstd{(beer_data}\hlopt{$}\hlstd{rating,} \hlstr{"1=0"}\hlstd{)}
\hlstd{> }\hlstd{beer_data}\hlopt{$}\hlstd{rating} \hlkwb{<-} \hlkwd{recode}\hlstd{(beer_data}\hlopt{$}\hlstd{rating,} \hlstr{"2=1"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{beer_data}\hlopt{$}\hlstd{rating} \hlcom{# Setting median to zero will help our interpretation}
\end{alltt}
\begin{verbatim}
##  [1] NA NA NA NA NA NA NA NA NA NA NA NA NA NA NA NA NA NA NA NA NA NA NA NA
## [25] NA NA NA NA NA NA NA NA NA NA NA
\end{verbatim}
\end{kframe}
\end{knitrout}


\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{set.seed}\hlstd{(}\hlnum{12345}\hlstd{)} \hlcom{# Setting our seed will fix the randomness for replication}
\hlstd{> }
\hlstd{> }\hlcom{#    Let's do the basic linear model thing:}
\hlstd{> }\hlcom{##!  lm(Y ~ X, data selection)}
\hlstd{> }\hlstd{mod1} \hlkwb{<-} \hlkwd{lm}\hlstd{(rating} \hlopt{~} \hlstd{price,} \hlkwc{data} \hlstd{= beer_data)}
\end{alltt}


{\ttfamily\noindent\bfseries\color{errorcolor}{\#\# Error in lm.fit(x, y, offset = offset, singular.ok = singular.ok, ...): 0 (non-NA) cases}}\begin{alltt}
\hlstd{> }\hlcom{# just list our coefficients (to see everything use summary(mod1))}
\hlstd{> }\hlstd{mod1}\hlopt{$}\hlstd{coefficients}
\end{alltt}


{\ttfamily\noindent\bfseries\color{errorcolor}{\#\# Error in eval(expr, envir, enclos): object 'mod1' not found}}\end{kframe}
\end{knitrout}


\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Texreg Tables:}
\hlstd{> }\hlkwd{library}\hlstd{(texreg)}
\hlstd{> }
\hlstd{> }\hlkwd{texreg}\hlstd{(}\hlkwc{l}\hlstd{=} \hlkwd{list}\hlstd{(mod1),} \hlkwc{stars} \hlstd{=} \hlkwd{numeric}\hlstd{(}\hlnum{0}\hlstd{),}
\hlstd{+ }       \hlkwc{custom.coef.names}    \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"Intercept"}\hlstd{,} \hlstr{"Beer Price"}\hlstd{),}
\hlstd{+ }       \hlkwc{caption.above}        \hlstd{= T,} \hlkwc{float.pos} \hlstd{=} \hlstr{"h!"}\hlstd{,}
\hlstd{+ }       \hlkwc{custom.note}          \hlstd{=} \hlstr{"Dependent variable: Beer Rating"}\hlstd{)}
\end{alltt}
\end{kframe}
\end{knitrout}


\begin{table}[h!]
\caption{Statistical models}
\begin{center}
\begin{tabular}{l c }
\hline
 & Model 1 \\
\hline
Intercept  & $-0.76$  \\
           & $(0.36)$ \\
Beer Price & $0.26$   \\
           & $(0.11)$ \\
\hline
R$^2$      & 0.14     \\
Adj. R$^2$ & 0.11     \\
Num. obs.  & 35       \\
RMSE       & 0.74     \\
\hline
\multicolumn{2}{l}{\scriptsize{Dependent variable: Beer Rating}}
\end{tabular}
\end{center}
\end{table}

\index{texreg package}

The above table shows the standard errors (in parentheses) being two standard errors away from our coefficients, therefore being significant at the 95\% confidence level. We have 35 observations and our $\text{R}^2$ explains 14\% of the variation in our dependent variable. The adjusted $\text{R}^2$ accounts for the amount of variables added into a model and is slightly more robust, prevent against ``kitchen sink'' models which add many variables to get a high  $\text{R}^2$. It explains 11\% of the variation.
\index{R$^2$}

Our intercept is when all else is held at zero ($\beta_0$) so the most average priced beer has a rating of $-.76$, which is overall pretty poor quality beer. Yet, if we spend one dollar more, our ranking jumps by .26 (a quarter rank) each time. This can be visually represented alongside simulations in a plot here: \\
\index{Simulation}

\index{base-R plotting}
\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(arm)} \hlcom{# For sim()}
\hlstd{> }\hlcom{# Let's plot a simulation:}
\hlstd{> }\hlkwd{plot}\hlstd{(beer_data}\hlopt{$}\hlstd{price,} \hlkwd{jitter}\hlstd{(beer_data}\hlopt{$}\hlstd{rating),} \hlkwc{pch}\hlstd{=}\hlnum{19}\hlstd{,}
\hlstd{+ }     \hlkwc{xlab}\hlstd{=} \hlstr{"Price"}\hlstd{,}
\hlstd{+ }     \hlkwc{ylab}\hlstd{=} \hlstr{"Rating"}\hlstd{,}
\hlstd{+ }     \hlkwc{main}\hlstd{=} \hlstr{"Rating by Price of Beer: with 100 simulations"}\hlstd{)}
\end{alltt}


{\ttfamily\noindent\bfseries\color{errorcolor}{\#\# Error in if (xx != 0) xx/10 else z/10: argument is of length zero}}\begin{alltt}
\hlstd{> }\hlkwd{abline}\hlstd{(mod1)}  \hlcom{# Add our model line}
\end{alltt}


{\ttfamily\noindent\bfseries\color{errorcolor}{\#\# Error in abline(mod1): object 'mod1' not found}}\begin{alltt}
\hlstd{> }\hlcom{# Simulate 100 possible outcomes, take their lines, plot them on top}
\hlstd{> }\hlstd{m1sim} \hlkwb{<-} \hlkwd{sim}\hlstd{(mod1)}
\end{alltt}


{\ttfamily\noindent\bfseries\color{errorcolor}{\#\# Error in h(simpleError(msg, call)): error in evaluating the argument 'object' in selecting a method for function 'sim': object 'mod1' not found}}\begin{alltt}
\hlstd{> }\hlkwa{for} \hlstd{(i} \hlkwa{in} \hlnum{1}\hlopt{:}\hlnum{100}\hlstd{)\{}
\hlstd{+ }  \hlkwd{curve}\hlstd{(}\hlkwd{coef}\hlstd{(m1sim)[i,}\hlnum{1}\hlstd{]} \hlopt{+} \hlkwd{coef}\hlstd{(m1sim)[i,}\hlnum{2}\hlstd{]}\hlopt{*}\hlstd{x,} \hlkwc{add}\hlstd{=T,} \hlkwc{col}\hlstd{=}\hlstr{"grey"}\hlstd{)}
\hlstd{+ }\hlstd{\}}
\end{alltt}


{\ttfamily\noindent\bfseries\color{errorcolor}{\#\# Error in coef(m1sim): object 'm1sim' not found}}\begin{alltt}
\hlstd{> }\hlkwd{curve}\hlstd{(mod1}\hlopt{$}\hlstd{coef[}\hlnum{1}\hlstd{]} \hlopt{+} \hlstd{mod1}\hlopt{$}\hlstd{coef[}\hlnum{2}\hlstd{]}\hlopt{*}\hlstd{x,} \hlkwc{add}\hlstd{=T,} \hlkwc{lwd}\hlstd{=}\hlnum{3}\hlstd{)}
\end{alltt}


{\ttfamily\noindent\bfseries\color{errorcolor}{\#\# Error in eval(expr, envir = ll, enclos = parent.frame()): object 'mod1' not found}}\end{kframe}
\end{knitrout}
\end{center}

The grey lines here are simulations which display our confidence intervals around the black regression line for our model. They occupy a low amount of the variation in our dots so intuitively we can see how this would yield a low $\text{R}^2$ (our model only had $.14$). See below:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlstd{mod2} \hlkwb{<-} \hlkwd{lm}\hlstd{(d}\hlopt{$}\hlstd{rating} \hlopt{~} \hlstd{d}\hlopt{$}\hlstd{price} \hlopt{+} \hlstd{d}\hlopt{$}\hlstd{alcohol)}
\hlstd{> }
\hlstd{> }\hlkwd{texreg}\hlstd{(}\hlkwc{l}\hlstd{=} \hlkwd{list}\hlstd{(mod1, mod2),} \hlkwc{stars} \hlstd{=} \hlkwd{numeric}\hlstd{(}\hlnum{0}\hlstd{),}
\hlstd{+ }       \hlkwc{custom.coef.names} \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"Intercept"}\hlstd{,} \hlstr{"Beer Price"}\hlstd{,} \hlstr{"Alcohol Content"}\hlstd{),}
\hlstd{+ }       \hlkwc{caption.above} \hlstd{= T,} \hlkwc{float.pos} \hlstd{=} \hlstr{"h!"}\hlstd{,}
\hlstd{+ }       \hlkwc{custom.note} \hlstd{=} \hlstr{"Dependent variable: Beer Rating"}\hlstd{)}
\end{alltt}
\end{kframe}
\end{knitrout}


\begin{table}[h!]
\caption{Statistical models}
\begin{center}
\begin{tabular}{l c c }
\hline
 & Model 1 & Model 2 \\
\hline
Intercept       & $-0.76$  & $-2.89$  \\
                & $(0.36)$ & $(0.91)$ \\
Beer Price      & $0.26$   & $0.21$   \\
                & $(0.11)$ & $(0.11)$ \\
Alcohol Content &          & $0.50$   \\
                &          & $(0.20)$ \\
\hline
R$^2$           & 0.14     & 0.28     \\
Adj. R$^2$      & 0.11     & 0.23     \\
Num. obs.       & 35       & 35       \\
RMSE            & 0.74     & 0.69     \\
\hline
\multicolumn{3}{l}{\scriptsize{Dependent variable: Beer Rating}}
\end{tabular}
\end{center}
\end{table}

We could consider a model where alcohol content is additionally important, Model 2. Here our R$^2$ increases to .28; and our variables remain within two deviations of the error, with the slight exception of beer price. Our intercept loses it's interpretation, we are now looking at where alcohol content is at zero. Our beer rank jumps by .50 every one increase in alcohol content. Both of these effects are controlling for the other.




%----------------------------------------------------------------------------------------------

\clearpage
\subsection{Modeling Assumptions, Diagnostics}
\hfill \\
In social science empirical research there is no dearth of modeling errors. The following diagnostics and error-checking may not seem worthwhile because this work rarely makes it into the actual publication; but rather into a supplemental appendix. This work too helps a lot to ease skeptical readers about the claims we make (helping us get published).

\begin{equation}
\mathlarger{  \epsilon_i  \thicksim \mathcal{N}(0, \sigma^2)             }
\end{equation}
\noindent \textit{Errors are Normally Distributed}\\
We assume that the errors are normally distributed, to check for this histograms can give us a first pass, but one can also map the residuals and (hopefully) see their ``random'' distribution with no foreseeable trends. the \texttt{plot(model)} command in R can give a few of these plots in a row pretty easily too. Consider our beer rankings model from earlier: \\
\hfill \\

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{par}\hlstd{(}\hlkwc{mfrow}\hlstd{=}\hlkwd{c}\hlstd{(}\hlnum{2}\hlstd{,}\hlnum{2}\hlstd{))} \hlcom{# plot multiple alongside each other:}
\hlstd{> }\hlkwd{plot}\hlstd{(mod1)}        \hlcom{# plot our quick model checks}
\end{alltt}


{\ttfamily\noindent\bfseries\color{errorcolor}{\#\# Error in plot(mod1): object 'mod1' not found}}\begin{alltt}
\hlstd{> }\hlkwd{par}\hlstd{(}\hlkwc{mfrow}\hlstd{=}\hlkwd{c}\hlstd{(}\hlnum{1}\hlstd{,}\hlnum{1}\hlstd{))} \hlcom{# Reset plotting option}
\end{alltt}
\end{kframe}
\end{knitrout}
\end{center}
\index{checking linear models}

\noindent \textit{Bias in Error}\\
Next, we assume that there is no bias in our errors, meaning that our expectation of our errors in zero: $\text{E}(\epsilon_i) = 0$. It is rare to get exactly zero, but we should report exactly what our errors are and be sure to mention any outliers, leverage points, or otherwise influential points to the reader so they are not mislead. We can handle these situations in various ways:\\
 \textbf{Never outright delete data points.} Theoretically, the social world is vastly complex and rarities can (and do) exist in nature. If we have an influential point, where our data point(s) are not necessarily malicious or supremely rare, but rather pull our analysis in one way or another we can transform all of the data points (log or rescale the variable) to decrease the influence of one point. Observing points outside of ``Cook's Distance'' (in plot R command) can be a good way to observe influential points or outliers. \\
\hfill \\

\noindent \textit{Uniform Variance}\\
Our $\sigma^2$ is not subscripted, meaning we expect a uniform variance in our error term, where there is no increasing or decreasing in our errors. homoscedasticity here is a good thing, we can detect this by plotting our residuals and seeing random variance of our points across the mid-point. We do not want to see heteroscedasticity or where errors funnel outward or have a certain trend in themselves.

\hfill \\
\noindent \textit{Autocorrelation, iid}\\
We do not want our observations to correlate with one-another, meaning our individuals or observations are not influencing another individual respondent's results. Each data point should be independent draws from one another.

\hfill \\
\noindent \textit{Measurement Error (X)}\\
We need to make sure the phenomenon we wish to measure is actually being measured by our data. A question such as ``What do you think about healthcare'' can be responded by a battery of cognitive processes; but a question like ``To what degree of anger do you feel about the current healthcare policy?'' is far more precise to the theoretical process we care to study. Beyond theory, the scale of our variable and our operationalization can be changed and shifted to answer different questions. In Section 3 that follows, for example, we will dichotomize a variable to observe a different question about how we think about our beer rankings.

\clearpage
\hfill \\
\noindent \textit{Omitted Variable Bias (OVB)}
\end{flushleft}

\begin{wrapfigure}{R}{.4\textwidth}
\centering
\includegraphics[width=0.25\textwidth]{OVB}
\end{wrapfigure}
OVB occurs when both a a variable excluded from analysis (Z) both theoretically overlaps some of the variance in our dependent variable (Y) and another included variable (X). If Z only overlapped with Y excluding it would just lower our R$^2$ and we would lose some of our potential ability to explain our DV. If Z only overlapped our X variable then we need only acknowledge Z in theory. It is only when Z overlaps both that we run into problems, for both we lose explanation of our DV and we over-inflate the significance of X's influence on Y. This can (and always should) be corrected by building a model slowly, one variable at a time, alongside well thought theory to ensure accuracy and purpose in our problem solving.

\begin{flushleft}
\setlength{\parindent}{1cm} % 1cm indent reitterated after /wrapfigure

\noindent \textit{Parametric Linearity}\\
If we run a standard linear regression we should be sure that our theory informs the decision that this phenomenon is linear, but also check that our relationship between our variables is linear in nature too. Other modifications of the GLM framework can include non-linear distributions. Linearity in our variables can be aided via transformation, with a drawback being (potentially) in interpretation.

\hfill \\
\noindent \textit{Mathematical Concerns}\\
We should ensure that X and Y have enough variance to provide enough change for analysis. Also, we should ensure (as often as we can) that our number of observations (N) is larger than our parameters (K). While having too high of an N will be more likely to report significant results in nearly any scattering of points, too low of an N can either show sharply significant results or no results at all when the \textit{truth} can be the opposite. Typically having an N of 2,000 has been an accepted threshold.

\hfill \\
\noindent \textit{In Structure}\\
We also assume that our model is fully specified, and that our perameters ($\beta$) are ``fixed'' where our variables don't have a change-time or some external influence at a point in the data collection.

\hfill \\
\noindent \textit{Other Notes on Stochastic Robustness}

Note that much of the explainability and diagnostics of our model can be partially examined (at least as a first pass) through our R$^2$. Our R$^2$ is the amount of variance captured in Y from our model. More formally:
\begin{equation}
\mathlarger{ \text{R}^2 = 1 - \frac{\text{RSS}}{\text{TSS}} = 1- \frac{\Sigma \epsilon^{2}_i}{\Sigma\left(Y_i - \bar{Y}\right)^2} }
\end{equation}
This shows our amount of variance explained by our model, over what's unexplained. This quotient is subtracted by one, we get a pretty good interpretation from .00 to 1 where we explain nothing to explaining everything. Other forms significance tests can penalize models for including many variables both linearly (AIC) or nonlinearly (BIC) these will be introduced later alongside logistic regression.

\hfill \\
\subsubsection{Missing Data}


Often is the case that we have missing data and still models are ran as usual. Yet, missing data very often occurs for a reason, be it a question offends a respondent, a respondent doesn't know how to answer, or a unit of observation intentionally does not respond because the response may not be acceptable to the researcher. That is, the missing data is very often not missing completely at random (MCAR). Rather, data can be missing with surrounding answered variables that we can use to predict the missing response (imputation). If we have no variables to attempt to predict the missing data (NI) then there is nothing we can do. With MCAR data we would go on as normal, or impute because it wouldn't really hurt anything.

Assuming we can use multiple imputation, here we want to run 5 to 10 models of the predicted missing response using any variables we have (here a ``kitchen sink'' approach to missing data is a good thing because we want to cover the highest amount of variance). With these 5-10 theoretical data sets that could exist where the respondent answered the otherwise missing question, we can regress each of these hypothetical worlds and then take the mean of all of them to have the most likely responses included in our final result.

Two R packages that make this very easy is both ``mice'' and ``Zelig.'' The functions to run multiple imputation from these packages can usually only take one or two lines of code and will print each individual regression and the mean regression. See the "mice" help file example example below:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(mice)}
\hlstd{> }\hlcom{## Referring to the mice help file on imputation on medical data:}
\hlstd{> }
\hlstd{> }\hlcom{# do default multiple imputation on a numeric matrix}
\hlstd{> }\hlstd{imp} \hlkwb{<-} \hlkwd{mice}\hlstd{(nhanes)}
\end{alltt}
\begin{verbatim}
## 
##  iter imp variable
##   1   1  bmi  hyp  chl
##   1   2  bmi  hyp  chl
##   1   3  bmi  hyp  chl
##   1   4  bmi  hyp  chl
##   1   5  bmi  hyp  chl
##   2   1  bmi  hyp  chl
##   2   2  bmi  hyp  chl
##   2   3  bmi  hyp  chl
##   2   4  bmi  hyp  chl
##   2   5  bmi  hyp  chl
##   3   1  bmi  hyp  chl
##   3   2  bmi  hyp  chl
##   3   3  bmi  hyp  chl
##   3   4  bmi  hyp  chl
##   3   5  bmi  hyp  chl
##   4   1  bmi  hyp  chl
##   4   2  bmi  hyp  chl
##   4   3  bmi  hyp  chl
##   4   4  bmi  hyp  chl
##   4   5  bmi  hyp  chl
##   5   1  bmi  hyp  chl
##   5   2  bmi  hyp  chl
##   5   3  bmi  hyp  chl
##   5   4  bmi  hyp  chl
##   5   5  bmi  hyp  chl
\end{verbatim}
\end{kframe}
\end{knitrout}

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Our data: note the NA missing values}
\hlstd{> }\hlkwd{head}\hlstd{(nhanes}\hlopt{$}\hlstd{bmi,} \hlnum{3}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1]   NA 22.7   NA
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# list the actual imputations for BMI, with predicted imputed values}
\hlstd{> }\hlkwd{head}\hlstd{(imp}\hlopt{$}\hlstd{imp}\hlopt{$}\hlstd{bmi,} \hlnum{3}\hlstd{)}
\end{alltt}
\begin{verbatim}
##      1    2    3    4    5
## 1 33.2 22.0 33.2 35.3 27.2
## 3 22.0 30.1 22.0 26.3 22.0
## 4 24.9 21.7 24.9 22.7 20.4
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# first completed data matrix, can save this for analysis}
\hlstd{> }\hlkwd{head}\hlstd{(}\hlkwd{complete}\hlstd{(imp),} \hlnum{3}\hlstd{)}
\end{alltt}
\begin{verbatim}
##   age  bmi hyp chl
## 1   1 33.2   1 204
## 2   2 22.7   1 187
## 3   1 22.0   1 187
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## imputation on mixed data with a different method per column:}
\hlstd{> }\hlcom{# mice(nhanes2, meth=c('sample','pmm','logreg','norm'))}
\hlstd{> }\hlcom{## This will give you all information per column like before.}
\end{alltt}
\end{kframe}
\end{knitrout}

\hfill \\
\subsubsection{Outliers}

An outlier is an observation which is significantly different than the main system or bulk of a data set. An outlier differs from a standard ``influential point'' but is instead a pejorative data point which needs to be addressed. How exactly we ``address'' outlier points is up to debate, and largely depends upon theory and the data set as a whole, including the data collection methodology. In many cases outliers are true observations that really are part of an overall data generation process (DGP). To remove this point, then, poses a theoretical problem. On one hand removing the point is essential for many mean-based analytic methods (mean, standard deviation, variance) but on the other hand removing the observation essentially deludes ourselves from observing the ``real world'' where these observations exist. In the exercise below we take the most standard outlier detection methodology, the interquartile range, then practice analyzing the particular outlier observation. As standard practice, whenever outliers are removed they should be careful examined, questioned qualitatively, and then communicated in any technical communication.\\

Consider the graph below of a standard boxplot. These calculations are replicated mathematically in the code below for how to detect outlier data. \index{outlier} \index{boxplot}

\begin{center}
\includegraphics[scale=.9]{Boxplot infographic}
\end{center}

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(dplyr)} \hlcom{# for filter later}
\hlstd{> }\hlkwd{set.seed}\hlstd{(}\hlnum{1}\hlstd{)}    \hlcom{# set randomness of dgp for replication}
\hlstd{> }
\hlstd{> }\hlcom{# Generate random normal distribution data for test:}
\hlstd{> }\hlstd{df} \hlkwb{<-} \hlkwd{as.data.frame}\hlstd{(}\hlkwd{rnorm}\hlstd{(}\hlnum{1000}\hlstd{))}
\hlstd{> }\hlstd{df[}\hlnum{1}\hlstd{,]} \hlkwb{<-} \hlopt{-}\hlnum{14}   \hlcom{# create outliers}
\hlstd{> }\hlstd{df[}\hlnum{2}\hlstd{,]} \hlkwb{<-} \hlnum{14}
\hlstd{> }
\hlstd{> }\hlcom{# Compute first and third quartiles and IQR for our data:}
\hlstd{> }\hlstd{q1} \hlkwb{<-} \hlkwd{quantile}\hlstd{(df}\hlopt{$}\hlstd{`rnorm(1000)`,} \hlnum{0.25}\hlstd{)}
\hlstd{> }\hlstd{q3} \hlkwb{<-} \hlkwd{quantile}\hlstd{(df}\hlopt{$}\hlstd{`rnorm(1000)`,} \hlnum{0.75}\hlstd{)}
\hlstd{> }\hlstd{iqr} \hlkwb{<-} \hlstd{q3} \hlopt{-} \hlstd{q1}
\hlstd{> }
\hlstd{> }\hlcom{# Calculate lower and upper cutoffs:}
\hlstd{> }\hlstd{lower} \hlkwb{<-} \hlstd{q1} \hlopt{-} \hlnum{1.5} \hlopt{*} \hlstd{iqr}
\hlstd{> }\hlstd{upper} \hlkwb{<-} \hlstd{q3} \hlopt{+} \hlnum{1.5} \hlopt{*} \hlstd{iqr}
\hlstd{> }
\hlstd{> }\hlcom{# Filter data to find outliers given above cutoffs:}
\hlstd{> }\hlstd{df} \hlopt{%>%}
\hlstd{+ }     \hlkwd{filter}\hlstd{(df}\hlopt{$}\hlstd{`rnorm(1000)`} \hlopt{<} \hlstd{lower} \hlopt{|} \hlstd{df}\hlopt{$}\hlstd{`rnorm(1000)`} \hlopt{>} \hlstd{upper)}
\end{alltt}
\begin{verbatim}
##   rnorm(1000)
## 1  -14.000000
## 2   14.000000
## 3   -2.888921
## 4   -3.008049
## 5    3.810277
## 6   -2.939774
## 7    3.055742
## 8   -2.996949
\end{verbatim}
\end{kframe}
\end{knitrout}

The above observations are then our outliers and we can address each of those and make calculated decisions on whether to remove or include them in our data set.

\clearpage

\subsubsection{Model Specificiation, Distributional Functions}

Some important distributional notes:\footnote{Much thanks to Soubhik Barari, Ph.D. Candidate at Harvard University for sharing these notes with me during class.}

\begin{center}
\includegraphics[scale=0.80]{table_Soubhik Barari}
\end{center}

In the following sections each of these should be illuminated as we use them in regression and think about how these relate to the natural world.



%----------------------------------------------------------------------------------------

\clearpage
\subsection{Logit and Probit Modeling:}

Our dependent variable can take two values in logistic and probit regression; giving us a distribution such that:

\begin{gather*}
\begin{cases}
  1 = \text{for event occuring}    \\
  0 = \text{for event not occuring}
\end{cases}
\end{gather*}

\index{link function}
This can be used in a GLM framework where previously we had any continuous dependent variable available, we can have the dichotomous variable because of the necessary ``link function'' for our distribution. A link function is useful because it can be swapped out to fit any number of models we will see here in this document. This is absolutely important in GLM theory because it builds a connection between the mean of the data generating process to our linear predictors that otherwise would not pass our many assumptions if we were to just use standard OLS. Our two link functions for the logit and probit are as follows:

\begin{equation}
\mathlarger{ \text{logit:}~ \eta =  p\left( \frac{p}{1-p}\right) }
\end{equation}
\begin{equation}
\mathlarger{ \text{probit:}~ \eta = \Phi^{-1}(p) ~ \text{where}~  \Phi^{-1} ~ \text{ is the inverse normal distribution CDF} }
\end{equation}

Although probit and logit analyses are very similar in results, they differ in the distributions they allow. Probit regression works for a inverse normal distribution whereas logistic regression works for the logistic distribution (CDF's below). These are for the different theoretical DGP's, but the logit model is more likely to converge (data overlaps and varies enough) so we'll use that more often for accurate results, and often in social sciences we see the logit regression more often so given its canonical nature it is it more helpful at conveying important findings without confusion to the reader.

\begin{center}
\includegraphics[scale=.5]{VarLogit}
\end{center}

\clearpage

Below is an example of a model logit and probit regressions, reconsidering our beer data as the only real ranking of beer is ``Very Good'' or ``Fair''; after all a ``Good'' ranking may not make sense to be any different from ``Fair.'' Rather, these two rankings are combined to make a zero-one variable (``very good'' versus ``good or fair'').

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlstd{logmod1} \hlkwb{<-} \hlkwd{glm}\hlstd{(beer_data}\hlopt{$}\hlstd{verygood} \hlopt{~} \hlstd{beer_data}\hlopt{$}\hlstd{price,}
\hlstd{+ }               \hlkwc{family} \hlstd{=} \hlkwd{binomial}\hlstd{(}\hlkwc{link}\hlstd{=logit))}
\hlstd{> }\hlcom{## summary(logmod1)  # Check your output}
\hlstd{> }
\hlstd{> }\hlstd{promod1} \hlkwb{<-} \hlkwd{glm}\hlstd{(beer_data}\hlopt{$}\hlstd{verygood} \hlopt{~} \hlstd{beer_data}\hlopt{$}\hlstd{price,}
\hlstd{+ }               \hlkwc{family} \hlstd{=} \hlkwd{binomial}\hlstd{(}\hlkwc{link}\hlstd{=probit))}
\hlstd{> }\hlcom{## summary(posmod1)}
\hlstd{> }
\hlstd{> }\hlcom{# Plot:   Using library(texreg)}
\hlstd{> }\hlkwd{texreg}\hlstd{(}\hlkwc{l}\hlstd{=} \hlkwd{list}\hlstd{(logmod1, promod1),} \hlkwc{stars} \hlstd{=} \hlkwd{numeric}\hlstd{(}\hlnum{0}\hlstd{),}
\hlstd{+ }       \hlkwc{custom.model.names} \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"Logit Model"}\hlstd{,} \hlstr{"Probit Model"}\hlstd{),}
\hlstd{+ }       \hlkwc{custom.coef.names} \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"Intercept"}\hlstd{,} \hlstr{"Price"}\hlstd{),}
\hlstd{+ }       \hlkwc{caption.above} \hlstd{= T,} \hlkwc{float.pos} \hlstd{=} \hlstr{"h!"}\hlstd{,}
\hlstd{+ }       \hlkwc{custom.note} \hlstd{=} \hlstr{"Dependent variable: Very Good Beer (1)"} \hlstd{)}
\end{alltt}
\end{kframe}
\end{knitrout}



\index{texreg package}
\begin{table}[h!]
\caption{Statistical models}
\begin{center}
\begin{tabular}{l c c }
\hline
 & Logit Model & Probit Model \\
\hline
Intercept      & $-3.12$  & $-1.96$  \\
               & $(1.29)$ & $(0.75)$ \\
Price          & $0.75$   & $0.48$   \\
               & $(0.40)$ & $(0.23)$ \\
\hline
AIC            & 42.96    & 42.79    \\
BIC            & 46.07    & 45.90    \\
Log Likelihood & -19.48   & -19.39   \\
Deviance       & 38.96    & 38.79    \\
Num. obs.      & 35       & 35       \\
\hline
\multicolumn{3}{l}{\scriptsize{Dependent variable: Very Good Beer (1)}}
\end{tabular}
\end{center}
\end{table}

From the table we see things to be very similar between the two models, the error reports (AIC, BIC, Log Likelihood, Deviance) are all similar, our price coefficient is still in the same sign, the logit model barely avoids significance whereas the probit model barely makes significance standards. Both coefficients are in the same direction however. Our intercepts vary between each other, but both are negative and significant.

Reading dichotomous outputs like these can be difficult, for the logit model a coeficient is the \textbf{changes in logged odds from moving from zero to a one}. Therefore, our price of .75 is the logged odds change from moving from a zero (a ``Fair or Good'' beer) to a ``Very Good'' beer (1). But we often don't think in terms of logged odds, therefore it is always helpful to calculate the multiplicative effect of each variable.

We can try to understand more about what makes ``Very Good'' beer by building a model one block at a time until we think we have a complete model for the data we have - guided by our theory about very good beer in this case.

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Another texreg example: using library(texreg)}
\hlstd{> }\hlkwd{texreg}\hlstd{(}\hlkwc{l}\hlstd{=} \hlkwd{list}\hlstd{(logmod2, promod2),} \hlkwc{stars} \hlstd{=} \hlkwd{numeric}\hlstd{(}\hlnum{0}\hlstd{),}
\hlstd{+ }       \hlkwc{bold} \hlstd{= T,} \hlkwc{ci.force} \hlstd{= T,}   \hlcom{# Note some of these changes here}
\hlstd{+ }       \hlkwc{custom.model.names} \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"Logit Model"}\hlstd{,} \hlstr{"Probit Model"}\hlstd{),}
\hlstd{+ }       \hlkwc{custom.coef.names} \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"Intercept"}\hlstd{,} \hlstr{"Price"}\hlstd{,} \hlstr{"Availability"}\hlstd{,}
\hlstd{+ }                             \hlstr{"Alcohol Content"}\hlstd{,} \hlstr{"Caloric Content"}\hlstd{),}
\hlstd{+ }       \hlkwc{caption.above} \hlstd{= T,} \hlkwc{float.pos} \hlstd{=} \hlstr{"h!"}\hlstd{,}
\hlstd{+ }       \hlkwc{custom.note} \hlstd{=} \hlstr{"Dependent variable: Very Good Beer (1)"} \hlstd{)}
\end{alltt}
\end{kframe}
\end{knitrout}


\begin{table}[h!]
\caption{Statistical models}
\begin{center}
\begin{tabular}{l c c }
\hline
 & Logit Model & Probit Model \\
\hline
Intercept       & $\mathbf{-23.43}$ & $\mathbf{-14.03}$ \\
                & $[-43.03;\ -3.83]$    & $[-24.99;\ -3.07]$    \\
Price           & $1.11$                & $\mathbf{0.67}$   \\
                & $[-0.10;\ 2.33]$      & $[0.00;\ 1.33]$       \\
Availability    & $\mathbf{-3.53}$  & $\mathbf{-2.08}$  \\
                & $[-6.35;\ -0.71]$     & $[-3.63;\ -0.54]$     \\
Alcohol Content & $3.33$                & $1.94$                \\
                & $[-3.01;\ 9.67]$      & $[-1.59;\ 5.47]$      \\
Caloric Content & $0.04$                & $0.02$                \\
                & $[-0.10;\ 0.17]$      & $[-0.05;\ 0.10]$      \\
\hline
AIC             & 32.60                 & 32.20                 \\
BIC             & 40.37                 & 39.97                 \\
Log Likelihood  & -11.30                & -11.10                \\
Deviance        & 22.60                 & 22.20                 \\
Num. obs.       & 35                    & 35                    \\
\hline
\multicolumn{3}{l}{\scriptsize{Dependent variable: Very Good Beer (1)}}
\end{tabular}
\end{center}
\end{table}


The more specified table above includes the availability of the beer (is it often seen and promoted or more of an unknown beer to most bars), the alcohol, and caloric content; both of these are (at least chemically) to bring some form of pleasure and should be controlled. To switch up the data representation a little, confidence intervals are now shown and significance is indicated in bold.\footnote{ Texreg package customization, p.24 there is an example.} \index{texreg package}

Between the logit and probit models we still see a few differences, the intercept is again very different, likely because the difference in these models is the very distribution and link function they take which will shift the intercept; yet both are negative and significant. The price of the beer is insignificant for both models; yet, availability is significant for both models and in the negative direction (where 0 was a more frequent, popular beer). Alcohol and calorie levels are not significant for either model in predicting very good beers.\footnote{Interestingly caloric count is a low coefficient, likely because much of the variation is taken up by the alcohol content - which largely contributes to the calorie content in beer in the first place. An interaction between the two variables could be done, but this only inflates the alcohol content coefficient and all three variables become even further away from passing the significance threshold.} Finally, the model fitting reports are all very similar between the two models.

Going beyond sign and significance testing, let's first revisit our link function, if we take the inverse of the link function we can generate the ``mean function'' where instead of wrapping our link function around our linear predictor we can instead transform our DGP output itself. This can make more intuitive sense, and is again needed because then our values for $\eta$ will be from the zero to one interval.

\begin{equation}
\mathlarger{ \text{logit}^{-1} (\eta_i) = \frac{e^{\eta_i}}{1+e^{\eta_i}} \text{ to or from: } \eta_i = p\left( \frac{p}{1-p}\right) }
\end{equation}

Note from earlier that now in the logistic regression we are not dealing with a mere linear ``one unit in x causes an increase in y'' explanation. Rather, the logit regression is curved, and where we are at on the curve will determine how we read the regression coefficients. Generating predictive probabilities are always helpful, but require selecting a point of analysis per variable; this usually is set to the mean.

Consider our logit model from Table 4:

\begin{equation}
\mathlarger{ \text{logit}^{-1}(-23.43 + 1.11(\text{Price Value)} + \text{. . .} + 0.04(\text{Caloric Content))} }
\end{equation}

Here we could enter in mean numbers for each variable, and change the value we add per variable for interesting predicted probabilities in various scenarios that may be interesting to us. The number received is the probability of y happening given the parameters x given the data. This is both intuitive and interesting for readers.\footnote{Note this can also be done at the median of the data (intercept near zero), or at the middle category more generally. This is a case-by-case decision on whatever is most interesting given the question and data one is analyzing.}\index{``divide by four''}

The ``divide by four'' rule can be applied instead, were the beta coefficient is divided by four to yield the predictive probability \textit{at it's maximum in the middle of the curve}. At this point, directly in the middle (intercept = 0), the derivative of our function becomes equal to $\beta / 4$ allowing for an additional easy point estimate. Keep in mind this is best used for coefficients that are near the midpoint and not those on the tails because the logit distribution is much different at the tails than in the mid point. For example, in Table 4 our logit model showed the beer's availability had a large effect on the beer's rating. Taking it's availability $-3.53/4$ gives us a predictive probability of $-60.5$\%  That is, although this coefficient is away from the mean of the distribution, in example going from a widely available beer to a more sparse beer is likely to decrease the beer's rating (to the ``Good/Fair'' category) to a (approximate) 60.5\% probability.

Since it is usually better to represent these data in graphic form, consider a probability plot of our logistic curve for price now by the probability of receiving a very good beer:\footnote{The end section of this document, in quick overview, includes code for creating this.}


\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(arm)} \hlcom{# for inverse logit function}
\hlstd{> }             \hlcom{# (It may actually be in the MASS package)}
\hlstd{> }
\hlstd{> }\hlcom{# Recall our logit model:}
\hlstd{> }\hlstd{logmod1} \hlkwb{<-} \hlkwd{glm}\hlstd{(verygood} \hlopt{~} \hlstd{price,} \hlkwc{data} \hlstd{= beer_data,}
\hlstd{+ }               \hlkwc{family} \hlstd{=} \hlkwd{binomial}\hlstd{(}\hlkwc{link}\hlstd{=logit))}
\hlstd{> }
\hlstd{> }\hlcom{# The inverse logit gets us our predicted probabilities:}
\hlstd{> }\hlcom{#   All we're doing here is using some base-R plotting operations}
\hlstd{> }\hlcom{#   with creating our predicted probabilities per our coefficents}
\hlstd{> }\hlkwd{curve}\hlstd{(}\hlkwd{invlogit}\hlstd{(logmod1}\hlopt{$}\hlstd{coef[}\hlnum{1}\hlstd{]} \hlopt{+} \hlstd{logmod1}\hlopt{$}\hlstd{coef[}\hlnum{2}\hlstd{]}\hlopt{*}\hlstd{x),} \hlnum{1}\hlstd{,} \hlnum{5}\hlstd{,} \hlkwc{ylim}\hlstd{=}\hlkwd{c}\hlstd{(}\hlopt{-}\hlnum{.01}\hlstd{,}\hlnum{.9}\hlstd{),}
\hlstd{+ }      \hlkwc{xlim}\hlstd{=}\hlkwd{c}\hlstd{(}\hlnum{0}\hlstd{,}\hlnum{7.5}\hlstd{),} \hlkwc{xaxt}\hlstd{=}\hlstr{"n"}\hlstd{,} \hlkwc{xaxs}\hlstd{=}\hlstr{"i"}\hlstd{,} \hlkwc{mgp}\hlstd{=}\hlkwd{c}\hlstd{(}\hlnum{2}\hlstd{,}\hlnum{.5}\hlstd{,}\hlnum{0}\hlstd{),}
\hlstd{+ }      \hlkwc{ylab}\hlstd{=}\hlstr{"Pr(Very Good Beer)"}\hlstd{,} \hlkwc{xlab}\hlstd{=}\hlstr{"Price"}\hlstd{,}
\hlstd{+ }      \hlkwc{main}\hlstd{=}\hlstr{"Probability of Very Good Beer, by Price"}\hlstd{,} \hlkwc{lwd}\hlstd{=}\hlnum{4}\hlstd{)}
\hlstd{> }\hlkwd{curve}\hlstd{(}\hlkwd{invlogit}\hlstd{(logmod1}\hlopt{$}\hlstd{coef[}\hlnum{1}\hlstd{]} \hlopt{+} \hlstd{logmod1}\hlopt{$}\hlstd{coef[}\hlnum{2}\hlstd{]}\hlopt{*}\hlstd{x),} \hlopt{-}\hlnum{2}\hlstd{,} \hlnum{8}\hlstd{,} \hlkwc{lwd}\hlstd{=}\hlnum{4.5}\hlstd{,} \hlkwc{add} \hlstd{= T)}
\hlstd{> }\hlkwd{axis}\hlstd{(}\hlnum{1}\hlstd{,} \hlnum{1}\hlopt{:}\hlnum{7}\hlstd{,} \hlkwc{mgp}\hlstd{=}\hlkwd{c}\hlstd{(}\hlnum{2}\hlstd{,}\hlnum{.5}\hlstd{,}\hlnum{0}\hlstd{))}
\hlstd{> }\hlkwd{mtext} \hlstd{(}\hlstr{"(two dollars)"}\hlstd{,} \hlnum{1}\hlstd{,} \hlnum{1.5}\hlstd{,} \hlkwc{at}\hlstd{=}\hlnum{2}\hlstd{,} \hlkwc{adj}\hlstd{=}\hlnum{.5}\hlstd{)} \hlcom{# just adding text to x axis}
\hlstd{> }\hlkwd{mtext} \hlstd{(}\hlstr{"(six dollars)"}\hlstd{,} \hlnum{1}\hlstd{,} \hlnum{1.5}\hlstd{,} \hlkwc{at}\hlstd{=}\hlnum{6}\hlstd{,} \hlkwc{adj}\hlstd{=}\hlnum{.5}\hlstd{)}
\hlstd{> }\hlkwd{points}\hlstd{(}\hlkwd{jitter}\hlstd{(beer_data}\hlopt{$}\hlstd{price,} \hlnum{1.5}\hlstd{),} \hlkwd{jitter}\hlstd{(beer_data}\hlopt{$}\hlstd{verygood,} \hlnum{0.1}\hlstd{),}
\hlstd{+ }       \hlkwc{pch}\hlstd{=}\hlnum{20}\hlstd{,} \hlkwc{cex}\hlstd{=}\hlnum{.9}\hlstd{)} \hlcom{# Jittered points so we can see them}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/probplotlogit-1} 
\end{knitrout}
\end{center}


We can run some diagnostics on this similar to linear regression in that we're using residuals which are calculated similarly but for logit regression we have to ``bin'' these. I've done so for the initial model (only including price) and the full model (including calories and alcoholic content) below.\footnote{For more on why binned residual plotting: see Andrew Gelman (et. al's) article:\\ \url{http://www.stat.columbia.edu/~gelman/research/published/dogs.pdf}}

Here, ideally, we would want to see ``random noise'' around the dotted zero mark more average residuals. Additionally, we want about 95\% of the data to be encapsulated within the light grey lines. Thus, interpreting the graphs, we see a lot of data that stretches outside of the confidence bounds within both graphics. If one were to collect more data in the beer dataset we may be able to analyze this further, but as it is there seems to be not enough samples of very good beer to create a complete image of the ranking process in this dichotomous way. \index{Binned Residuals}

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(arm)}
\hlstd{> }
\hlstd{> }\hlcom{# Recall our logit models:}
\hlstd{> }\hlstd{logmod1} \hlkwb{<-} \hlkwd{glm}\hlstd{(verygood} \hlopt{~} \hlstd{price,} \hlkwc{data} \hlstd{= beer_data,}
\hlstd{+ }               \hlkwc{family} \hlstd{=} \hlkwd{binomial}\hlstd{(}\hlkwc{link}\hlstd{=logit))}
\hlstd{> }
\hlstd{> }\hlstd{logmod2} \hlkwb{<-} \hlkwd{glm}\hlstd{(verygood} \hlopt{~} \hlstd{price} \hlopt{+} \hlstd{avail} \hlopt{+} \hlstd{alcohol} \hlopt{+} \hlstd{calories,}
\hlstd{+ }               \hlkwc{data} \hlstd{= beer_data,}
\hlstd{+ }               \hlkwc{family} \hlstd{=} \hlkwd{binomial}\hlstd{(}\hlkwc{link}\hlstd{=logit))}
\hlstd{> }
\hlstd{> }\hlcom{## Binned Residual plotting ("arm" package)}
\hlstd{> }\hlkwd{par}\hlstd{(}\hlkwc{mfrow}\hlstd{=}\hlkwd{c}\hlstd{(}\hlnum{1}\hlstd{,}\hlnum{2}\hlstd{))}
\hlstd{> }\hlstd{x} \hlkwb{<-} \hlkwd{predict}\hlstd{(logmod1,} \hlkwc{type} \hlstd{=} \hlstr{"response"}\hlstd{)}
\hlstd{> }\hlstd{y} \hlkwb{<-} \hlkwd{resid}\hlstd{(logmod1)}
\hlstd{> }\hlkwd{binnedplot}\hlstd{(x, y,} \hlkwc{nclass}\hlstd{=}\hlkwa{NULL}\hlstd{,}
\hlstd{+ }           \hlkwc{xlab}\hlstd{=}\hlstr{"Expected Values"}\hlstd{,} \hlkwc{ylab}\hlstd{=}\hlstr{"Average residual"}\hlstd{,}
\hlstd{+ }           \hlkwc{main}\hlstd{=}\hlstr{"Binned residual plot: Model 1"}\hlstd{,}
\hlstd{+ }           \hlkwc{cex.pts}\hlstd{=}\hlnum{0.8}\hlstd{,} \hlkwc{col.pts}\hlstd{=}\hlnum{1}\hlstd{,} \hlkwc{col.int}\hlstd{=}\hlstr{"gray"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlcom{# Plot 2:}
\hlstd{> }\hlstd{x} \hlkwb{<-} \hlkwd{predict}\hlstd{(logmod2,} \hlkwc{type} \hlstd{=} \hlstr{"response"}\hlstd{)}
\hlstd{> }\hlstd{y} \hlkwb{<-} \hlkwd{resid}\hlstd{(logmod2)}
\hlstd{> }\hlkwd{binnedplot}\hlstd{(x, y,} \hlkwc{nclass}\hlstd{=}\hlkwa{NULL}\hlstd{,}
\hlstd{+ }           \hlkwc{xlab}\hlstd{=}\hlstr{"Expected Values"}\hlstd{,} \hlkwc{ylab}\hlstd{=}\hlstr{"Average residual"}\hlstd{,}
\hlstd{+ }           \hlkwc{main}\hlstd{=}\hlstr{"Binned residual plot: Model 2"}\hlstd{,}
\hlstd{+ }           \hlkwc{cex.pts}\hlstd{=}\hlnum{0.8}\hlstd{,} \hlkwc{col.pts}\hlstd{=}\hlnum{1}\hlstd{,} \hlkwc{col.int}\hlstd{=}\hlstr{"gray"}\hlstd{)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in,height=4.5in]{figure/binned-1} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlkwd{par}\hlstd{(}\hlkwc{mfrow}\hlstd{=}\hlkwd{c}\hlstd{(}\hlnum{1}\hlstd{,}\hlnum{1}\hlstd{))} \hlcom{# Reset graphing}
\end{alltt}
\end{kframe}
\end{knitrout}
\end{center}

%\begin{center}
%\includegraphics[scale=.7]{Rope}
%\end{center}

The below graphic compares the initial model with our full model in another great way, oftentimes readers prefer a visualization rather than tables. Our rope ladder plot shows just how little our two models differ, except in the wide-spread intercept, and few variables falling outside of the zero mark. Availability of the beer has a notable effect and is perhaps the main take away, along with price, of the logit models. High priced, widely available beer is very good in ranking (with some modeling concerns and error).
\index{Rope Ladder Ploting}

\begin{center}
\noindent\rule{8cm}{0.4pt}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(ggplot2)}
\hlstd{> }
\hlstd{> }\hlcom{# Rope Ladder Plot (ggplot2)}
\hlstd{> }\hlstd{f1}\hlkwb{<-}\hlkwd{data.frame}\hlstd{(}\hlkwc{Variable}\hlstd{=}\hlkwd{rownames}\hlstd{(}\hlkwd{summary}\hlstd{(logmod1)}\hlopt{$}\hlstd{coef),}
\hlstd{+ }               \hlkwc{Coefficient}\hlstd{=}\hlkwd{summary}\hlstd{(logmod1)}\hlopt{$}\hlstd{coef[,}\hlnum{1}\hlstd{],}
\hlstd{+ }               \hlkwc{SE}\hlstd{=}\hlkwd{summary}\hlstd{(logmod1)}\hlopt{$}\hlstd{coef[,}\hlnum{2}\hlstd{],}
\hlstd{+ }               \hlkwc{modelName}\hlstd{=} \hlstr{"Model 1"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{f2}\hlkwb{<-}\hlkwd{data.frame}\hlstd{(}\hlkwc{Variable}\hlstd{=}\hlkwd{rownames}\hlstd{(}\hlkwd{summary}\hlstd{(logmod2)}\hlopt{$}\hlstd{coef),}
\hlstd{+ }               \hlkwc{Coefficient}\hlstd{=}\hlkwd{summary}\hlstd{(logmod2)}\hlopt{$}\hlstd{coef[,}\hlnum{1}\hlstd{],}
\hlstd{+ }               \hlkwc{SE}\hlstd{=}\hlkwd{summary}\hlstd{(logmod2)}\hlopt{$}\hlstd{coef[,}\hlnum{2}\hlstd{],}
\hlstd{+ }               \hlkwc{modelName}\hlstd{=} \hlstr{"Model 2"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{combinedframe} \hlkwb{<-} \hlkwd{data.frame}\hlstd{(}\hlkwd{rbind}\hlstd{(f1, f2))}
\hlstd{> }\hlstd{interval1} \hlkwb{<-} \hlkwd{qnorm}\hlstd{((}\hlnum{1}\hlopt{-}\hlnum{0.9}\hlstd{)}\hlopt{/}\hlnum{2}\hlstd{)}
\hlstd{> }\hlstd{interval2} \hlkwb{<-} \hlkwd{qnorm}\hlstd{((}\hlnum{1}\hlopt{-}\hlnum{0.95}\hlstd{)}\hlopt{/}\hlnum{2}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{rl1} \hlkwb{<-} \hlkwd{ggplot}\hlstd{(combinedframe)}
\hlstd{> }\hlstd{rl1} \hlkwb{<-} \hlstd{rl1} \hlopt{+} \hlkwd{geom_hline}\hlstd{(}\hlkwc{yintercept} \hlstd{=} \hlnum{0}\hlstd{,} \hlkwc{color} \hlstd{=} \hlkwd{grey}\hlstd{(}\hlnum{1}\hlopt{/}\hlnum{2}\hlstd{),} \hlkwc{lty} \hlstd{=} \hlnum{5}\hlstd{)}
\hlstd{> }\hlstd{rl1} \hlkwb{<-} \hlstd{rl1} \hlopt{+} \hlkwd{geom_linerange}\hlstd{(}\hlkwd{aes}\hlstd{(}\hlkwc{x} \hlstd{= Variable,} \hlkwc{ymin} \hlstd{= Coefficient} \hlopt{-}
\hlstd{+ }\hlstd{SE}\hlopt{*}\hlstd{interval1,}
\hlstd{+ }               \hlkwc{ymax} \hlstd{= Coefficient} \hlopt{+} \hlstd{SE}\hlopt{*}\hlstd{interval1),}
\hlstd{+ }               \hlkwc{lwd} \hlstd{=} \hlnum{1}\hlstd{,} \hlkwc{position} \hlstd{=} \hlkwd{position_dodge}\hlstd{(}\hlkwc{width} \hlstd{=}\hlnum{1}\hlopt{/}\hlnum{2}\hlstd{))}
\hlstd{> }\hlstd{rl1} \hlkwb{<-} \hlstd{rl1} \hlopt{+} \hlkwd{geom_pointrange}\hlstd{(}\hlkwd{aes}\hlstd{(}\hlkwc{x} \hlstd{= Variable,} \hlkwc{y} \hlstd{= Coefficient,}
\hlstd{+ }\hlkwc{ymin} \hlstd{= Coefficient} \hlopt{-} \hlstd{SE}\hlopt{*}\hlstd{interval2,}
\hlstd{+ }               \hlkwc{ymax} \hlstd{= Coefficient} \hlopt{+} \hlstd{SE}\hlopt{*}\hlstd{interval2),}
\hlstd{+ }               \hlkwc{lwd} \hlstd{=} \hlnum{1}\hlopt{/}\hlnum{2}\hlstd{,} \hlkwc{position} \hlstd{=} \hlkwd{position_dodge}\hlstd{(}\hlkwc{width} \hlstd{=} \hlnum{1}\hlopt{/}\hlnum{2}\hlstd{),}
\hlstd{+ }               \hlkwc{color}\hlstd{=(}\hlstr{"Black"}\hlstd{),}
\hlstd{+ }               \hlkwc{shape} \hlstd{=} \hlnum{21}\hlstd{,} \hlkwc{fill} \hlstd{=} \hlstr{"BLACK"}\hlstd{)}
\hlstd{> }\hlstd{rl1} \hlkwb{<-} \hlstd{rl1} \hlopt{+} \hlkwd{coord_flip}\hlstd{()} \hlopt{+} \hlkwd{theme_bw}\hlstd{()}
\hlstd{> }\hlstd{rl1} \hlkwb{<-} \hlstd{rl1} \hlopt{+} \hlkwd{ggtitle}\hlstd{(}\hlstr{"Comparing Two Models:"}\hlstd{)}
\hlstd{> }\hlkwd{print}\hlstd{(rl1)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in,height=5in]{figure/rope-1} 
\end{knitrout}
\end{center}



%----------



\clearpage
\subsection{Poisson Modeling:}
Poisson data uses a new link function which allows us to model count-level data, the probability mass function (pmf) now being:

\begin{equation}
\mathlarger{ \frac{\lambda^k e^{-\lambda}}{k!}     }
\end{equation}

Where the available numbers the model will take are all real numbers greater than zero $(0; 1; 2; 3; 4; 5; ...)$. This normal Poisson model assumes the variance is equal to it's mean, but often we see the variance to be greater (over-dispersed) or lower (under-dispersed) than the mean. This assumption is oftentimes broken in social sciences, for this reason a \textit{quasi-Poisson} or \textit{negative binomial} is able to let the variance change.
\begin{equation}
\text{Quasi-Poisson:} \hspace{.3cm} var(Y)=\theta \mu \hspace{.3cm}\text{Where theta is the overdispersion parameter}
\end{equation}
\begin{equation}
 \text{Negative Binomial:} \hspace{.3cm} var(Y)= \mu (1+ K\mu) \hspace{.3cm} \text{Where K is the shape parameter}
\end{equation}
How we handle the differences between the variance and mean relations in each of these three forms of count-data modeling may effect our regression coefficients fit differences between negative binomial (also known as gamma-Poisson), quasi-Poisson, and regular Poisson modeling. This is because fitting these models uses weighted least squares, and these weights are inversely proportional to the variance. Thus, negative binomial and quasi-Poisson will weight observations differently. Ultimately, the decision to choose the quasi-Poisson or another variation the negative binomial regression should depend on the theory rather than the data-driven method.\footnote{Ver Hoef, Jay M. and Boveng, Peter L., "QUASI-POISSON VS. NEGATIVE BINOMIAL REGRESSION: HOW SHOULD WE
MODEL OVERDISPERSED COUNT DATA?" (2007). Publications, Agencies and Staff of the U.S. Department of Commerce. Paper
142.}

Let's build a regular Poisson model, adding one variable at a time, to predict the likelihood of a successful military coup (R's faraway package). Let's assume that we theorize that the percent of a country voting, the years of oligarchy, number of elections, and political liberalization all make sense towards predicting the number (count) of successful military coups. Results are shown in Table 5 below, however here is how these models are ran in R:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(faraway)}
\end{alltt}


{\ttfamily\noindent\color{warningcolor}{\#\# Warning: package 'faraway' was built under R version 4.1.3}}\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(MASS)}
\hlstd{> }\hlkwd{data}\hlstd{(africa)}
\hlstd{> }
\hlstd{> }\hlcom{## Examine Dataset ##}
\hlstd{> }\hlkwd{str}\hlstd{(africa)}  \hlcom{# There are some NAs in the data to consider}
\end{alltt}
\begin{verbatim}
## 'data.frame':	47 obs. of  9 variables:
##  $ miltcoup : int  0 5 0 6 2 0 1 3 1 2 ...
##  $ oligarchy: int  0 7 0 13 13 0 0 14 15 0 ...
##  $ pollib   : int  2 1 NA 2 2 2 2 2 2 2 ...
##  $ parties  : int  38 34 7 62 10 34 5 14 27 4 ...
##  $ pctvote  : num  NA 45.7 20.3 17.5 34.4 ...
##  $ popn     : num  9.7 4.6 1.2 8.8 5.3 11.6 0.361 3 5.5 0.458 ...
##  $ size     : num  1247 113 582 274 28 ...
##  $ numelec  : int  0 8 5 5 3 14 2 6 4 6 ...
##  $ numregim : int  1 3 1 3 3 3 1 4 3 2 ...
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# Poisson}
\hlstd{> }\hlstd{mod4} \hlkwb{<-} \hlkwd{glm}\hlstd{(africa}\hlopt{$}\hlstd{miltcoup} \hlopt{~} \hlstd{africa}\hlopt{$}\hlstd{pctvote} \hlopt{+} \hlstd{africa}\hlopt{$}\hlstd{oligarchy} \hlopt{+}
\hlstd{+ } \hlstd{africa}\hlopt{$}\hlstd{numelec} \hlopt{+} \hlstd{africa}\hlopt{$}\hlstd{pollib,} \hlkwc{family} \hlstd{= poisson)}
\hlstd{> }
\hlstd{> }\hlcom{# Quasi Poisson}
\hlstd{> }\hlstd{qmod4} \hlkwb{<-} \hlkwd{glm}\hlstd{(africa}\hlopt{$}\hlstd{miltcoup} \hlopt{~} \hlstd{africa}\hlopt{$}\hlstd{pctvote} \hlopt{+} \hlstd{africa}\hlopt{$}\hlstd{oligarchy} \hlopt{+}
\hlstd{+ } \hlstd{africa}\hlopt{$}\hlstd{numelec} \hlopt{+} \hlstd{africa}\hlopt{$}\hlstd{pollib,} \hlkwc{family} \hlstd{= quasipoisson)}
\end{alltt}
\end{kframe}
\end{knitrout}



\hfill \\
\noindent \textbf{More on Dispersion Problems:}\\
In the Poisson distribution we make a rather strong assumption that our mean is equal to the variance due to the Poisson link function only having one parameter. We rarely ever fulfill this assumption in social sciences, but are able to report and correct for our dispersion problems pretty well. If our model is \textit{over-dispersed} this means that our mean is a certain distribution with a peak and the variance is larger than that actual mean distribution (not being equal as our assumption posits). The inverse is defined as under-dispersion although this is less common. A few ways to control for dispersion would be to check the F-statistic to report model-fit more accurately per variable as we're building our model. Also, we can check the typical robustness checks from the linear model including the QQ plot, Cook's Distance, and residual plotting. It may be the case that a logarithmic transformation (or similar transformation) of a variable will better-fit our model without actually changing and values given that they are all scaled together. Note how the regular Poisson assumption is a special case of the Quasi-Poisson regression (where $\theta$ equals one we arrive at the Poisson assumption $var(Y)=1\mu$. Often using Quasi-Poisson regression isn't a bad idea considering we rarely fulfill the Poisson dispersion assumption.\\

\begin{table}[h!]
\caption{Statistical models}
\begin{center}
\begin{tabular}{l c c c c }
\hline
 & Model 1 & Model 2 & Model 3 & Model 4 \\
\hline
Intercept                & $0.29$   & $-0.52$  & $-1.34$  & $-0.17$  \\
                         & $(0.28)$ & $(0.37)$ & $(0.61)$ & $(0.73)$ \\
Percent Voting           & $0.00$   & $0.00$   & $0.00$   & $0.00$   \\
                         & $(0.01)$ & $(0.01)$ & $(0.01)$ & $(0.01)$ \\
Years of Oligarchy       &          & $0.11$   & $0.13$   & $0.11$   \\
                         &          & $(0.02)$ & $(0.02)$ & $(0.02)$ \\
Number of Elections      &          &          & $0.10$   & $0.05$   \\
                         &          &          & $(0.05)$ & $(0.06)$ \\
Political Liberalization &          &          &          & $-0.40$  \\
                         &          &          &          & $(0.24)$ \\
\hline
AIC                      & 149.55   & 120.73   & 118.61   & 111.67   \\
BIC                      & 152.98   & 125.87   & 125.47   & 119.59   \\
Log Likelihood           & -72.77   & -57.36   & -55.31   & -50.83   \\
Deviance                 & 80.74    & 49.92    & 45.80    & 36.86    \\
Num. obs.                & 41       & 41       & 41       & 36       \\
\hline
\multicolumn{5}{l}{\scriptsize{Dependent variable: Successful Military Coups}}
\end{tabular}
\end{center}
\end{table}

We can include and check the chi-squared of our model since it is compatible to our Poisson distribution:\\
\begin{equation}
\mathlarger{ \hat{\phi} = \frac{\chi^2}{n-p} = \frac{\Sigma_i(y_i - \hat{\lambda_i})^2 /\hat{ \lambda_i}}{n-p} }
\end{equation}
More easily computed in R:\\

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# ChiSquared of Model 4}
\hlstd{> }\hlstd{dp} \hlkwb{<-} \hlkwd{sum}\hlstd{(}\hlkwd{residuals}\hlstd{(mod4,} \hlkwc{type}\hlstd{=}\hlstr{"pearson"}\hlstd{)}\hlopt{^}\hlnum{2}\hlstd{)}\hlopt{/}\hlstd{mod4}\hlopt{$}\hlstd{df.residual}
\hlstd{> }\hlstd{dp}
\end{alltt}
\begin{verbatim}
## [1] 1.155917
\end{verbatim}
\end{kframe}
\end{knitrout}

We can just run a quasi-Poisson family regression to get similar results initially. The follow is the two models comparatively:

\clearpage


\begin{table}[h!]
\caption{Statistical models}
\begin{center}
\begin{tabular}{l c c }
\hline
 & Q-Model 4 & Model 4 \\
\hline
Intercept                & $-0.17$  & $-0.17$  \\
                         & $(0.78)$ & $(0.73)$ \\
Percent Voting           & $0.00$   & $0.00$   \\
                         & $(0.01)$ & $(0.01)$ \\
Years of Oligarchy       & $0.11$   & $0.11$   \\
                         & $(0.03)$ & $(0.02)$ \\
Number of Elections      & $0.05$   & $0.05$   \\
                         & $(0.06)$ & $(0.06)$ \\
Political Liberalization & $-0.40$  & $-0.40$  \\
                         & $(0.25)$ & $(0.24)$ \\
\hline
AIC                      &          & 111.67   \\
BIC                      &          & 119.59   \\
Log Likelihood           &          & -50.83   \\
Deviance                 & 36.86    & 36.86    \\
Num. obs.                & 36       & 36       \\
\hline
\multicolumn{3}{l}{\scriptsize{Dependent variable: Successful Military Coups}}
\end{tabular}
\end{center}
\end{table}

Notice that the coefficients don't change much at all, but reconsidering our measure of the variance has changed some significance levels slightly. Note we cannot see our AIC, BIC, or Log Likelihood for the quasi-Poisson; this is because of how the variance is manipulated, a Quasi-AIC measure would be needed to report that finding. Also, we could include a negative binomial model next to the others:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Poisson}
\hlstd{> }\hlstd{mod4} \hlkwb{<-} \hlkwd{glm}\hlstd{(africa}\hlopt{$}\hlstd{miltcoup} \hlopt{~} \hlstd{africa}\hlopt{$}\hlstd{pctvote} \hlopt{+} \hlstd{africa}\hlopt{$}\hlstd{oligarchy} \hlopt{+}
\hlstd{+ } \hlstd{africa}\hlopt{$}\hlstd{numelec} \hlopt{+} \hlstd{africa}\hlopt{$}\hlstd{pollib,} \hlkwc{family} \hlstd{= poisson)}
\hlstd{> }
\hlstd{> }\hlcom{# Quasi Poisson}
\hlstd{> }\hlstd{qmod4} \hlkwb{<-} \hlkwd{glm}\hlstd{(africa}\hlopt{$}\hlstd{miltcoup} \hlopt{~} \hlstd{africa}\hlopt{$}\hlstd{pctvote} \hlopt{+} \hlstd{africa}\hlopt{$}\hlstd{oligarchy} \hlopt{+}
\hlstd{+ } \hlstd{africa}\hlopt{$}\hlstd{numelec} \hlopt{+} \hlstd{africa}\hlopt{$}\hlstd{pollib,} \hlkwc{family} \hlstd{= quasipoisson)}
\hlstd{> }
\hlstd{> }\hlcom{# Negative Binomial}
\hlstd{> }\hlstd{nbmod4} \hlkwb{<-} \hlkwd{glm.nb}\hlstd{(africa}\hlopt{$}\hlstd{miltcoup} \hlopt{~} \hlstd{africa}\hlopt{$}\hlstd{pctvote} \hlopt{+} \hlstd{africa}\hlopt{$}\hlstd{oligarchy} \hlopt{+}
\hlstd{+ } \hlstd{africa}\hlopt{$}\hlstd{numelec} \hlopt{+} \hlstd{africa}\hlopt{$}\hlstd{pollib)}
\end{alltt}
\end{kframe}
\end{knitrout}

\clearpage

\begin{table}[h!]
\caption{Statistical models}
\begin{center}
\begin{tabular}{l c c c }
\hline
 & Model 4 & Q-Model 4 & Negative-Binomial Model 4 \\
\hline
Intercept                & $-0.17$  & $-0.17$  & $-0.17$  \\
                         & $(0.73)$ & $(0.78)$ & $(0.73)$ \\
Percent Voting           & $0.00$   & $0.00$   & $0.00$   \\
                         & $(0.01)$ & $(0.01)$ & $(0.01)$ \\
Years of Oligarchy       & $0.11$   & $0.11$   & $0.11$   \\
                         & $(0.02)$ & $(0.03)$ & $(0.02)$ \\
Number of Elections      & $0.05$   & $0.05$   & $0.05$   \\
                         & $(0.06)$ & $(0.06)$ & $(0.06)$ \\
Political Liberalization & $-0.40$  & $-0.40$  & $-0.40$  \\
                         & $(0.24)$ & $(0.25)$ & $(0.24)$ \\
\hline
AIC                      & 111.67   &          & 113.67   \\
BIC                      & 119.59   &          & 123.17   \\
Log Likelihood           & -50.83   &          & -50.83   \\
Deviance                 & 36.86    & 36.86    & 36.85    \\
Num. obs.                & 36       & 36       & 36       \\
\hline
\multicolumn{4}{l}{\scriptsize{Dependent variable: Successful Military Coups}}
\end{tabular}
\end{center}
\end{table}


Ultimately, for publication I would include all of these in an appendix or supplemental appendix. Our results themselves are largely insignificant and our coefficients, using $\mathlarger{ e^{\beta} }$ we can find the multiplicative change of each variable's coefficient. The most significant finding (consistently) is the years of oligarchy a country experiences predicts the multiplicative likelihood of a military coup. For interpretation, our $\beta = .11$ so $e^{.11} = 1.116278$ or an 12\% increase in the likelihood of a military coup as years of oligarchy increases. In Table 8 I do what is most intuitive for readers, report a model (in this case the negative binomial) and it's associated percentage likelihood estimate.
\clearpage


\begin{table}[h!]
\caption{Statistical models}
\begin{center}
\begin{tabular}{l c c }
\hline
 & Negative-Binomial Model & $1- e^\beta$  \\
\hline
Intercept                 & $-0.17$    & \\
                          & $(0.73)$   & \\
Percent Voting            & $0.00$     & $0\%$ \\
                          & $(0.01)$   &\\
Years of Oligarchy        & $0.11$     & $12\%$ \\
                          & $(0.02)$   &\\
Number of Elections       & $0.05$     & $5\% $ \\
                          & $(0.06)$   &\\
Political Liberalization  & $-0.40$    & $-33\%$\\
                          & $(0.24)$   &\\
\hline
AIC                       & 113.67     &\\
BIC                       & 123.17     &\\
Log Likelihood            & -50.83     &\\
Deviance                  & 36.85      &\\
Num. obs.                 & 36         & 36\\
\hline
\multicolumn{3}{l}{\scriptsize{Dependent variable: Successful Military Coups}}
\end{tabular}
\end{center}
\end{table}


%--------------------------------------------------------------------------------------------
\addcontentsline{toc}{subsubsection}{Likelihood Ratio Test, Deviance, AIC, and BIC}
\noindent \textbf{Likelihood Ratio Test, Deviance, AIC, and BIC:}\\
In the likelihood ratio test we have two models where one is a subset (or nested) within another (following is using hypothetical data). Here we have the likelihoods of both of the restricted model ($\hat{L_R}$) divided by the unrestricted model ($\hat{L_U}$) thus taking their ratio. Using hypothetical data our restricted model logged-likelihood is -469.174 and our unrestricted model is a logged-likelihood of -406.0718. So assume here we have a restricted model with a higher logged-likelihood than the unrestricted model which isn't ideal of a likelihood ratio test. Further, our logged-likelihoods are negative which is also not ideal in creating an interpret-able likelihood ratio test. Exponentiating each of these:\\
\begin{equation}
\mathlarger{ \lambda = \frac{ \hat{L_R}}{ \hat{L_U}} = \frac{ e^{-469.174}}{e^{-406.0718}} = 3.9360695\text{e}-28 }
\end{equation}

Given that this doesn't really work, and our results would be helpful but we would have to just interpret arbitrary an arbitrary ``cut-off" point between zero and one to determine if we can reject the null or not, we can actually just use a \textbf{logged-likelihood ratio test} which is similar but not exactly a likelihood ratio (although this is more common):\\
\begin{equation}
\mathlarger{  \lambda = -2 \ln \left( \frac{ \hat{L_R}}{ \hat{L_U}}  \right) = -2 \left[(-469.174) - (-406.0718) \right] = 126.2044  }
\end{equation}


We could run this number in R: \\

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{dchisq}\hlstd{(}\hlnum{126.2044}\hlstd{,} \hlkwc{df}\hlstd{=}\hlnum{1}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1] 1.39777e-29
\end{verbatim}
\end{kframe}
\end{knitrout}


Similarly we can calculate the deviance, or the difference between a perfect fitting model and our models. Given that a perfect fitting model (for general linear models at least) are by definition perfect, the math becomes easier because perfect models can be understood as zero: \\
\begin{equation}
D = 2(0- \ln L(\hat{\theta} \vert y)
\end{equation}
\begin{equation}
 D = -2( \ln L(\hat{\theta} \vert y)
\end{equation}
Although the calculation doesn't involve pitting the models against each other we can compare model's distance away from the ideal models. We can also look at the AIC and BIC, defined similarly:\\
\begin{equation}
AIC = -2 \ln L(\hat{\theta} \vert y) + 2p = D(\hat{\theta} ) +2p
\end{equation}
\begin{equation}
BIC = -2 \ln L(\hat{\theta} \vert x) +plog(n) = D(\hat{\theta}) + p \ln (n)
\end{equation}


These are important to apply because if we arbitrarily add more and more variables into a model, our deviance will continue to decrease although this may not be honest to our actual understand of a ``better'' model (kitchen-sink models). AIC adds $2p$ where p is the number of parameters; thus, this adds a linear check against our deviance. BIC adds $p\cdot log(n)$ or a non-linear check on our deviance. Together than can help us check our model fit (and is often automatically calculated for you in tables in R) \\

Overall, the AIC, BIC, Log Likelihood, and Deviance are all great indicators for model fit from the ideal model and checking for many parameters (both linearly and non-linearly).




\clearpage
\subsection{Ordered Logistic Modeling:}

Ordered models take data that has a scale in responses, where a ``1'' response is less than or greater than a ``2'' response which is in similar direction to a ``3'' response. These ordered responses, in order to work in a GLM framework, must be formulated to be measurable at each disjointed segment between each ordered response. It may be helpful to think of this as a series of logitstic regressions between the segments, in the end bonded together. Therefore, we get the link function for the ordered logistic:\\ \index{link function}
\begin{equation}
\mathlarger{ \frac{1}{1+ e^{-(\theta_i- w\cdot x)}   }  }
\end{equation}
\noindent and (optionally) the ordered probit could be used, or a sometimes attractive third option which is the exponential function to create a proportional hazards model, although survival models will be covered at the end of this document these two models are relatives of one another:\\
\begin{equation}
exp(-exp(\theta_i - w \cdot x))
\end{equation}
Intuitively, with a series of logistic regressions we could subtract these categories to find the effects of each category; or add these categories up to equal 1. If these categories do not add up to one the remaining number is the coefficient for a left out category. Subtracting these categories requires subtracting the inverse logit of each: $logit^{-1}(\theta_{k+1}) - logit^{-1} (\theta_k)$. AIC and BIC, note, will be including all disjointed segments. Also, by doing a regression we are not finding the areas between these ``cut points" but rather the label (or response) at each cut point itself. We can take the derivative of the line estimate between cut points to find the nuanced area in between cut points, but subtracting the inverse logits (above) is essentially the same result.

Revising the data on beer, we should realize that our ranking variable is directly suited for ordered logistic regression (not OLS). Let's see if our findings differ in any way from the OLS or logit models we ran. Consider an ordinal logit of the beer ranking:



\begin{table}[h!]
\caption{Statistical models}
\begin{center}
\begin{tabular}{l c c }
\hline
 & Model 1 & Model 2 \\
\hline
Price           & $0.74$   & $0.63$   \\
                & $(0.36)$ & $(0.36)$ \\
Alcohol Content &          & $1.75$   \\
                &          & $(0.82)$ \\
\hline
AIC             & 76.76    & 72.04    \\
BIC             & 81.42    & 78.27    \\
Log Likelihood  & -35.38   & -32.02   \\
Deviance        & 70.76    & 64.04    \\
Num. obs.       & 35       & 35       \\
\hline
\multicolumn{3}{l}{\scriptsize{Dependent variable: Quality of Beer Ranking}}
\end{tabular}
\end{center}
\end{table}



Interpretation of the results are similar to logit regression in that they are the logged odds change from one cut point to another cut point. That is, from a ``2'' quality to a ``3'' we see a 1.75 logged percentage increase per unit increase in alcohol content. This effect is statistically significant.

\addcontentsline{toc}{subsubsection}{Bootstrapping}
\hfill \\
\noindent \textbf{Bootstrapping:}

One issue to consider is the low observation number (N) but high demand of the model (varying categorical demands of our dependent variable). One robustness check of this is to \textit{bootstrap} the model to use simulation to build up the number of observations to fulfill our assumption of normal distribution which may be a hard assumption without doing this:
\begin{center}
\includegraphics[scale=.65]{best}
\end{center}
Above, we see our beta estimate is not a very good normal distribution even though our model assumptions assume that we should treat it like one. In order to make the assumption of normal distribution we can bootstrap the model by replicating it's draws. Figure 2 maps a normal distribution and marks the same model's beta coefficients information to show an ideal model:

\clearpage

\begin{center}
\includegraphics[scale=.6]{Nbest}
\end{center}

Using these new-found thresholds, including a red mean line ideally where it should between the blue lower and upper bounds, we can re-run our model based upon the new information - creating new high and low confidence intervals, we find that significance still remains in Table 10: \\

\begin{table}[h!]
\caption{Statistical models}
\begin{center}
\begin{tabular}{l c }
\hline
 & Model 1 \\
\hline
Price           & $0.63$           \\
                & $[-0.08;\ 1.95]$ \\
Alcohol Content & $1.75^{*}$       \\
                & $[0.62;\ 4.96]$  \\
\hline
AIC             & 72.04            \\
BIC             & 78.27            \\
Log Likelihood  & -32.02           \\
Deviance        & 64.04            \\
Num. obs.       & 35               \\
\hline
\multicolumn{2}{l}{\scriptsize{Dependent variable: Quality of Beer Ranking}}
\end{tabular}
\end{center}
\end{table}


This will typically yield more conservative estimations and evaluations of our standard errors, commonly in cases with low N. Code for this process is here but not ran, an example follows:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{set.seed}\hlstd{(}\hlnum{10}\hlstd{)}
\hlstd{> }\hlcom{# This seed is used, it assures replication and convergence for this model}
\hlstd{> }
\hlstd{> }\hlcom{# For Bootstrapping:}
\hlstd{> }\hlstd{bs.sample} \hlkwb{<-} \hlkwa{function}\hlstd{(}\hlkwc{dat}\hlstd{)}
\hlstd{+ }\hlstd{\{}
\hlstd{+ }  \hlstd{idx} \hlkwb{<-} \hlkwd{sample}\hlstd{(}\hlnum{1}\hlopt{:}\hlkwd{nrow}\hlstd{(dat),} \hlkwd{nrow}\hlstd{(dat),} \hlkwc{replace} \hlstd{=} \hlnum{TRUE}\hlstd{)}
\hlstd{+ }  \hlstd{dat[idx,]}
\hlstd{+ }\hlstd{\}}
\hlstd{> }
\hlstd{> }\hlstd{bs.routine} \hlkwb{<-} \hlkwa{function}\hlstd{(}\hlkwc{dat}\hlstd{)}
\hlstd{+ }\hlstd{\{}
\hlstd{+ }  \hlstd{sample.dta} \hlkwb{<-} \hlkwd{bs.sample}\hlstd{(dat)}
\hlstd{+ }  \hlkwd{coef}\hlstd{(MASS}\hlopt{::}\hlkwd{polr}\hlstd{(}\hlkwd{as.factor}\hlstd{(quality)} \hlopt{~} \hlstd{price} \hlopt{+} \hlstd{alcohol,}
\hlstd{+ }                  \hlkwc{data} \hlstd{= sample.dta))}
\hlstd{+ }\hlstd{\}}
\hlstd{> }\hlstd{bs_est} \hlkwb{<-} \hlkwd{replicate}\hlstd{(}\hlnum{1000}\hlstd{,} \hlkwd{bs.routine}\hlstd{(}\hlkwc{dat} \hlstd{= beer_data))}
\hlstd{> }\hlcom{# replicate is actually doing the bootstrap^}
\hlstd{> }
\hlstd{> }\hlstd{bs_mean} \hlkwb{<-} \hlkwd{rowMeans}\hlstd{(bs_est)}
\hlstd{> }\hlstd{bs_ci} \hlkwb{<-} \hlkwd{t}\hlstd{(}\hlkwd{apply}\hlstd{(bs_est,} \hlnum{1}\hlstd{, quantile,} \hlkwc{probs} \hlstd{=} \hlkwd{c}\hlstd{(}\hlnum{0.025}\hlstd{,} \hlnum{0.975}\hlstd{)))}
\hlstd{> }\hlstd{bs_results} \hlkwb{<-} \hlkwd{cbind}\hlstd{(bs_mean, bs_ci)}
\hlstd{> }\hlkwd{colnames}\hlstd{(bs_results)} \hlkwb{<-} \hlkwd{c}\hlstd{(}\hlstr{"Est"}\hlstd{,} \hlstr{"Low"}\hlstd{,} \hlstr{"High"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlcom{# Model build}
\hlstd{> }\hlstd{mod1} \hlkwb{<-} \hlstd{MASS}\hlopt{::}\hlkwd{polr}\hlstd{(}\hlkwd{as.factor}\hlstd{(quality)} \hlopt{~} \hlstd{price} \hlopt{+} \hlstd{alcohol,} \hlkwc{data}\hlstd{=beer_data)}
\hlstd{> }\hlcom{# Quick Results}
\hlstd{> }\hlstd{texreg}\hlopt{::}\hlkwd{screenreg}\hlstd{(mod1,}
\hlstd{+ }                  \hlkwc{override.ci.low} \hlstd{=} \hlkwd{c}\hlstd{(bs_results[,} \hlnum{2}\hlstd{]),}
\hlstd{+ }                  \hlkwc{override.ci.up} \hlstd{=} \hlkwd{c}\hlstd{(bs_results[,} \hlnum{3}\hlstd{]))}
\hlstd{> }
\hlstd{> }\hlcom{# Table, to show overriding the confidence intervals with the bootstrap}
\hlstd{> }\hlcom{# library(texreg) # For this:}
\hlstd{> }\hlcom{# texreg(l= list(mod11), stars = numeric(0),}
\hlstd{> }\hlcom{#        custom.coef.names = c("Price", "Alcohol Content"),}
\hlstd{> }\hlcom{#        override.ci.low = c(bs_results[, 2]),}
\hlstd{> }\hlcom{#        override.ci.up = c(bs_results[, 3]),}
\hlstd{> }\hlcom{#        caption.above = T, float.pos = "h!",}
\hlstd{> }\hlcom{#        custom.note = "Dependent variable: Quality of Beer Ranking" )}
\end{alltt}
\end{kframe}
\end{knitrout}


\noindent \textbf{Model Interpretation} \\
Using a different dataset, assume R gives us the following raw output involving giving aid to Katrina relief:
\begin{verbatim}
Model:
               Coefficient    Std. Error    0.95 CI Lower     0.95 CI Upper
alt              1.2024         0.6335         -0.0393            2.4441
age01            3.4481*        1.1723          1.1504            5.7458
female           0.9407*        0.4333          0.0915            1.7899
inc8cat         -0.0188         0.7181         -1.4262            1.3886
advdeg          -0.9940*        0.4894         -1.9531           -0.0348
nonwhite        -0.5211         0.4990         -1.4991            0.4569
pid7cat          0.7343         0.9204         -1.0697            2.5384
0   | 0.5        0.9497         0.7954         -0.6092            2.5086
0.5 | 1          1.5801         0.8065         -0.0007            3.1608
Log Likelihood:      -89.63342 (df=9)
\end{verbatim}

Three variables are within two standard errors, age, if the respondent is female, and their average degree held. Interpreting ordered coefficients, since our dependent variable is ordered and many of our independent variables are ordered we will often care about the inverse logged difference between variables to find the rate of change between one ordered ``cut-point'' to the next. The difference between these two cut points recall:\\
\begin{equation}
logit^{-1} (\theta_{k+1}) - logit^{-1}(\theta_k)
\end{equation}
Where ``$k$" is the comparable category across the variable of interest. For example, we can compare our $\beta$ from our zero to $.5$ cut point to our $.5$ to 1 cut point in our dependent variable: donating to Katrina relief.
\begin{equation}
logit^{-1} (.9497) - logit^{-1}(1.5801) \approx (8.9) - (38) \approx   -29.1
\end{equation}
The rate of change between our .5 cut point (considering donating) and our cut point of 1 (has already donated) is -29.1. This predictive estimation is \textbf{all in reference to the omitted category}: zero or those who do not plan to donate given that all other variables are set at one. We find that having a low altruism score, being a minority race, and having a low average degree but highly liberal are all characteristics of someone that is far less likely to donate - or for us to observe a shift from a .5 to a 1 in the donation categories.

However, predicting a category like altruism (which ranges from 1-10) can be far different. Given the range of categories the variable could just be treated just as a variable would in a standard linear model, but the interpretation again is the \textbf{relative change from the removed category 0} (not considering a donation). In this instance we see a 1.2 percentage increase in the logged likelihood of donating for every unit increase in altruism. \\

\noindent \textbf{Latent Spaces}\\
This question has come up in the previous model's interpretation. What we obtain from a categorical variable is various ``cut points'' or snapshots of some longer distribution drawn out between these cuts in our distribution. These thresholds only tell us the associative values at each of these points, it is on the researcher to either integrate or use the difference in inverse logs to find the rate of change between points - or the latent spaces between the thresholds. \\
The more categories we add in initial data collection the easier it becomes to measure these latent spaces, for example age (a continuous variable) could be categorized as Teen, Young Adult, Adult, Elderly. Or, we could collect more data and have it by year - or by day! Measuring the difference between groups, say form Adult to Elderly, would take the probability at the stage of being an adult and everything greater than it ($k+1$) minus being Elderly and everything less than it ($k$) and then we find the effect from one threshold to the next. As this crude sketch shows, this is important because our distribution \textit{between} cut points could be interesting to understand.\\

\begin{center}
\includegraphics[scale=.65]{rate of change between points}
\end{center}



%------



\clearpage
\subsection{Multinomial Nominal Modeling:}

In multinomial modeling we have categories that have no particular order among them (religious identification for example, or other nominal variables). This is another extension of the binomial regression, except in 0-1 we have 0 all the way up to the $j$th group. The probability of all of these categories have to sum to 1. To use the GLM framework we use the following link function:\\
\begin{equation}
\eta_{ij} = x^{T}_i \beta_j = log \frac{p_{ij}}{p_{i1}} \hspace{.5cm} \forall  \hspace{.5cm}  j = 2, ... , J
\end{equation}
Since these categories have to equal to 1, we can manipulate and set the baseline category (usually whatever is coded 1 in R) to come up with a link that looks very similar to the logistic link, only with a summation operator for the categories starting beyond the omitted category, at $j=2$ to the final category $J$:\\
\begin{equation}
 p_{ij} = \frac{exp(\eta_{ij})}{1+ \Sigma^{J}_{j=2} exp (\eta_{ij})   }
\end{equation}
The only difference between this and the logistic regression is the summation operator for multiple categories rather than just the two in logistic regression. To run multinomial data in \texttt{R} we use the \texttt{nnet} package, which includes a lot on neural networks but also has a great multinomial function:\\


\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(nnet)}
\hlstd{> }\hlstd{object} \hlkwb{<-} \hlkwd{multinom}\hlstd{(formula)}
\end{alltt}
\end{kframe}
\end{knitrout}


The following table is what a multinomial output looks like, created using the \texttt{R faraway} package, utilizing the NES 1996 data. Assume, for some reason, all we needed to add in our model was age and the amount of TV someone watched to predict their partisan leanings. \\



\begin{table}[h!]
\caption{Statistical models}
\begin{center}
\begin{tabular}{l c c }
\hline
 & Independent & Republican \\
\hline
Intercept       & $\mathbf{-2.71}^{*}$ & $-0.36$          \\
                & $[-3.73;\ -1.69]$    & $[-0.76;\ 0.04]$ \\
Age             & $0.01$               & $0.01$           \\
                & $[-0.02;\ 0.03]$     & $[-0.00;\ 0.02]$ \\
TV News         & $-0.06$              & $-0.05$          \\
                & $[-0.19;\ 0.08]$     & $[-0.10;\ 0.01]$ \\
\hline
AIC             & 1571.79              & 1571.79          \\
BIC             & 1600.89              & 1600.89          \\
Log\ Likelihood & -779.90              & -779.90          \\
Deviance        & 1559.79              & 1559.79          \\
Num.\ obs.      & 944                  & 944              \\
\hline
\multicolumn{3}{l}{\scriptsize{$^*$ 0 outside the confidence interval}}
\end{tabular}
\end{center}
\end{table}

The raw coefficient we get is the logged odds from moving from the deleted category (Democrat here) to either Independent or Republican. Logged odds are pretty unituitive however, so making predictive probabilities from multinomial coefficients (and indeed much of regression output) is helpful to readers:

\begin{center}
\includegraphics[scale=.7]{IncPlot}
\end{center}

The above plot is modeling income along the x axis and the probability of being Democrat, Republican, or Independent (purple) for the NES 1996 data. This is using the ``predict'' command in R, which generates predictive probabilities out of our coefficients.

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{predict}\hlstd{(mmodi,}\hlkwd{data.frame}\hlstd{(}\hlkwc{nincome}\hlstd{=il),}\hlkwc{type}\hlstd{=}\hlstr{"probs"}\hlstd{)} \hlcom{# include type="probs"}
\hlstd{> }\hlkwd{predict}\hlstd{(mmodi,}\hlkwd{data.frame}\hlstd{(}\hlkwc{nincome}\hlstd{=il))}
\hlstd{> }
\hlstd{> }\hlcom{# Create Object with this probability matrix}
\hlstd{> }\hlstd{prmat} \hlkwb{<-} \hlkwd{predict}\hlstd{(mmodi,}\hlkwd{data.frame}\hlstd{(}\hlkwc{nincome}\hlstd{=}\hlkwd{sort}\hlstd{(}\hlkwd{unique}\hlstd{(nincome))),}
\hlstd{+ }         \hlkwc{type}\hlstd{=}\hlstr{"probs"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlcom{# Plotting:}
\hlstd{> }\hlkwd{plot}\hlstd{(}\hlkwd{unique}\hlstd{(nincome), prmat[,}\hlnum{1}\hlstd{],} \hlkwc{type}\hlstd{=}\hlstr{"l"}\hlstd{,} \hlkwc{col}\hlstd{=}\hlstr{"blue"}\hlstd{,} \hlkwc{lwd}\hlstd{=}\hlnum{3}\hlstd{,}
\hlstd{+ }       \hlkwc{xlab}\hlstd{=}\hlstr{"Income"}\hlstd{,} \hlkwc{ylab}\hlstd{=}\hlstr{"Probability"}\hlstd{)} \hlcom{# Labels}
\hlstd{> }\hlkwd{lines}\hlstd{(}\hlkwd{unique}\hlstd{(nincome), prmat[,}\hlnum{3}\hlstd{],} \hlkwc{type}\hlstd{=}\hlstr{"l"}\hlstd{,} \hlkwc{col}\hlstd{=}\hlstr{"red"}\hlstd{,} \hlkwc{lwd}\hlstd{=}\hlnum{3}\hlstd{)}
\hlstd{> }\hlkwd{lines}\hlstd{(}\hlkwd{unique}\hlstd{(nincome), prmat[,}\hlnum{2}\hlstd{],} \hlkwc{type}\hlstd{=}\hlstr{"l"}\hlstd{,} \hlkwc{col}\hlstd{=}\hlstr{"purple"}\hlstd{,} \hlkwc{lwd}\hlstd{=}\hlnum{3}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlkwd{summary}\hlstd{(mmodi)}
\end{alltt}
\end{kframe}
\end{knitrout}








%-----------







\clearpage
\subsection{Survival Modeling:}

Survival models (event history models) take data that occurs over a duration of time and maps the likelihood of surviving until the next ``step''. This could be, for example, the effect of a treatment, the lifeline of a patent in therapy, the tenure of a officeholder, or the length that a bill or law stays active over time. Consider the table:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(survminer)}
\hlstd{> }\hlkwd{library}\hlstd{(survival)}
\hlstd{> }
\hlstd{> }\hlcom{# Exponential:}
\hlstd{> }\hlstd{expmod} \hlkwb{<-} \hlkwd{survreg}\hlstd{(}\hlkwd{Surv}\hlstd{(te, censor)} \hlopt{~} \hlstd{wc} \hlopt{+} \hlstd{dem} \hlopt{+} \hlstd{pvote} \hlopt{+} \hlstd{south,}
\hlstd{+ }                  \hlkwc{data} \hlstd{= dat,} \hlkwc{dist} \hlstd{=} \hlstr{"exponential"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlcom{# Weibull:}
\hlstd{> }\hlstd{weibullmod} \hlkwb{<-} \hlkwd{survreg}\hlstd{(}\hlkwd{Surv}\hlstd{(te, censor)} \hlopt{~} \hlstd{wc} \hlopt{+} \hlstd{dem} \hlopt{+} \hlstd{pvote} \hlopt{+} \hlstd{south,}
\hlstd{+ }                  \hlkwc{data} \hlstd{= dat,} \hlkwc{dist} \hlstd{=} \hlstr{"weibull"}\hlstd{)}
\end{alltt}
\end{kframe}
\end{knitrout}



\begin{table}[h!]
\caption{Survival Models}
\begin{center}
\begin{tabular}{l c c c }
\hline
 & Exponential & Weibull & exp(Cox) \\
\hline
Intercept          & $3.60$    & $3.59$    &           \\
                   & $(0.10)$  & $(0.10)$  &           \\
Investiture        & $-0.36$   & $-0.34$   &           \\
                   & $(0.13)$  & $(0.12)$  &           \\
Polarization       & $-0.039$  & $-0.04$   & $1.04$    \\
                   & $(0.01)$  & $(0.005)$ & $(0.01)$  \\
Crisis Duration    & $0.01$    & $0.01$    & $0.99$    \\
                   & $(0.002)$ & $(0.002)$ & $(0.002)$ \\
Log(Scale)         &           & $-0.12$   &           \\
                   &           & $(0.05)$  &           \\

\hline
Scale              & Fixed 1   & 0.884     &         \\
Log\ Likelihood    & -1056.7   & -1053.8   & 56.6    \\
$\chi^2$           & 88.08     & 93.6      &         \\
df                 &  3        &   3       & 2       \\
Num.\ obs.         & 314       & 314       & 314     \\
\hline
\multicolumn{4}{l}{\scriptsize{Dependent variable: Duration}}
\end{tabular}
\end{center}
\end{table}

The above table is the coefficients and standard errors for two models (and an expoentiated Cox model), the exponential and Weibull of a survival modeling of duration given legislative investiture, polarization measures, and crisis duration (measured in days). Our variable of interest here is the presence of legislative investiture and Gary King's claim that they prevent against failure in international national cabinets (their duration).\footnote{King, Gary, James E. Alt, Nancy Elizabeth Burns and Michael Laver (1990). ``A United Model of Cabinet Dissolution in Parliamentary Democracies," American Journal of Political Science, vol. 34, no. 3, pp. 846-870.}

In interpretation, The exponential model assumes the scale parameter to be uniform for our hazard model (uniform at 1). This, in a basic sign-and-significance interpretation yields negative relationships for investiture policy and polarization which are both significant but weakly influential. The Weibull model gives us the actual scale parameter (.884) and similar results although slightly weaker when accounting for distributional changes additionally the interpretation changes via in absolute value terms from the exponential to the Weibull model. The Cox model assumes that the two strata within the survival curves will be proportional to each other, which could be an easy assumption to fulfill in some theory. Finally, the exponentiation of the Cox model can be read similarly to the Poisson model and is just a measure \textit{of the effect of the hazard rate}, which again is the risk of failure given that the participant has survived up to a specific time. The Cox model output here does not include our strata (investiture).\footnote{\texttt{coxph(Surv(duration, ciep12) $\sim$ strata(invest) + polar + crisis, data = dat,\\
 method = "efron")}}

\begin{center}
\textbf{Figure 1: Exponential Survival Model of Legislative Investiture}
\includegraphics[scale=.65]{Surv}
\end{center}

\clearpage
\begin{center}
\textbf{Figure 2: Cox Survival Model of Legislative Investiture}
\includegraphics[scale=.65]{Cox}
\end{center}

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Survival GGplot Example (not used to replicate above, code as template)}
\hlstd{> }\hlkwd{ggsurvplot}\hlstd{(fit,} \hlkwc{data} \hlstd{= dataset,}
\hlstd{+ }                \hlkwc{surv.median.line} \hlstd{=} \hlstr{"hv"}\hlstd{,}  \hlcom{# Add medians survival}
\hlstd{+ }                        \hlcom{# Change legends: title & labels}
\hlstd{+ }                \hlkwc{legend.title} \hlstd{=} \hlstr{"Title"}\hlstd{,}
\hlstd{+ }                \hlkwc{legend.labs} \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"One Category"}\hlstd{,} \hlstr{"Another"}\hlstd{),}
\hlstd{+ }                        \hlcom{# Add p-value and confidence intervals}
\hlstd{+ }                \hlkwc{pval} \hlstd{=} \hlnum{TRUE}\hlstd{,}
\hlstd{+ }                \hlkwc{conf.int} \hlstd{=} \hlnum{TRUE}\hlstd{,}
\hlstd{+ }                        \hlcom{# Add risk table}
\hlstd{+ }                \hlkwc{risk.table} \hlstd{=} \hlnum{TRUE}\hlstd{,}
\hlstd{+ }                \hlkwc{tables.height} \hlstd{=} \hlnum{0.2}\hlstd{,}
\hlstd{+ }                \hlkwc{tables.theme} \hlstd{=} \hlkwd{theme_cleantable}\hlstd{(),}
\hlstd{+ }                \hlcom{# Load "GrandBudapest" color scheme}
\hlstd{+ }                \hlkwc{palette} \hlstd{=} \hlkwd{c}\hlstd{(}\hlkwd{wes_palette}\hlstd{(}\hlstr{"GrandBudapest"}\hlstd{,} \hlnum{2}\hlstd{,}
\hlstd{+ }                \hlkwc{type} \hlstd{=} \hlstr{"discrete"}\hlstd{)[}\hlnum{1}\hlstd{],}
\hlstd{+ }                \hlkwd{wes_palette}\hlstd{(}\hlstr{"GrandBudapest"}\hlstd{,} \hlnum{2}\hlstd{,}
\hlstd{+ }                \hlkwc{type} \hlstd{=} \hlstr{"discrete"}\hlstd{)[}\hlnum{2}\hlstd{]),}
\hlstd{+ }                \hlkwc{ggtheme} \hlstd{=} \hlkwd{theme_bw}\hlstd{()}  \hlcom{# Change ggplot2 theme}
\hlstd{+ }              \hlstd{)}
\end{alltt}
\end{kframe}
\end{knitrout}

\newpage

Survival modeling is a variation of the generalized linear model which accounts for predicted probabilities as a phenomenon or actual actor dies in the course of study. Each depression in the figures is the instance of death in the dependent variable. Exponential modeling holds the hazard as uniform (1) giving us an interpretation of the predicted chance of dying. Weibell, in contrary, is the predicted probability of living and does not make an assumption on the scale parameter and reports this hazard parameter to the researcher (resulting in a loss of one degree of freedom).\footnote{Recall that this is very similar to the scale/variance problem we occurred in Poisson regression. Similarities are very similar here as well, and the math is similar in this respect too.} Confidence intervals for both Figure 1 and 2 are set at 95\% and the number at risk are the remaining participants in the study at each time location. The dotted lines report the median of the data for each strata (Investiture). Finally, given the Kaplan-Meier modeling here each depression is robust in that it controls for a multiple-drop off scenario to where $1/n$ can be calculated. For example, if three people were to die off at the same time point a $1/10, 1/9, 1/8$ would be calculated instead of all three at the same functional moment. The number remaining at risk is shown descriptively below each figure. \\

Interpretation of the actual coefficients is very similar to Poisson modeling given that our general linear model is following similar distribution as the Poisson (non-negative). Yet, the Poisson uses count-integer level data whereas survival modeling can use continuous data. Because of the similarities, the beta coefficient reported is similar, it is the multiplicative effect holding all else constant of a one unit increase in $X$ onto $Y$. \\

I have been able to plot both of these together in base-R; but I don't like how it looks compared to \texttt{ggplot}. \\

\begin{center}
\textbf{Figure 3: Survival Models of Legislative Investiture in Base R}
\includegraphics[scale=.6]{SurvR}
\end{center}

\clearpage
\noindent \textbf{Further Notes: Comments}\\
\noindent \textit{Censoring Problem in Survival Models:} \\
Perhaps as an additional note, a unique problem to survival modelings is the issue of censoring. Censoring is where participants (or the observed phenomenon)lives beyond the end point of the study. This is an example of rightward-censoring, but leftward-censoring would just be the inverse (beginning a study beyond the start of the phenomenon). This is a unique and difficult threat to survival models, thus we have had to use much of the tools listed in this section to account for these kinds of data. \footnote{Princeton article here includes mathematically how this and much of survival analysis works:\\
 http://data.princeton.edu/wws509/notes/c7.pdf}

\hfill \\

\noindent \textit{iid:} \\
The GLM nature of the survival model does not give it a free pass on the independent and individually distributed (iid) assumption. In fact, much of the time in dealing with survival-type theories (bill-survival, authoritarian regimes, cancer patients) we deal with responses that are not independent of one-another. A doctor seeing cancer patients, for example, may see twenty patients and as they become fully treated or pass away he may have more time to distribute to other patients. These patients may even meet and have group-therapy among themselves (just as bills may co-vary and authoritarians interlock in strategy)! Further methodology (networks for instance) can help circumvent these concerns.



\clearpage
\subsection{Conclusion, Quick Reference}

\textbf{The GLM}\\

The general linear model framework consists of a stochastic and systematic component, in order to use other distributions in the exponential family we need a \textit{link function} and to change our distriubtion. These build connections (links) between the mean of the DGP to our linear predictors.\\

\hfill \\
\noindent \textbf{Linear Model}\\
It's origins in geometry, the standard linear model is initially pretty flexible to most social science data. In geometry, $y=mx+b$ can be rewritten for data: $y=\alpha + \beta X$ or $y= \beta_0 + \beta X$. where $\alpha$ or $\beta_0$ is the y-intercept, $\beta_i$ is the $i$th coefficient for each variable onto our dependent variable $y$ and $X$ is our observed independent variable data. \\
In R this is executed simply:\\
\begin{verbatim}
object <- lm(formula)
#formula: (DV ~ IV + IV + IV)
\end{verbatim}

Coefficients received in a standard linear model table are interpreted as a one unit increase in X as an effect on our DV (pg. 4 for more, and probability plotting). \\

\hfill \\
\noindent \textbf{Logit Regression:}

Logit (and the alternative probit) regression(s) examine dependent variables that are coded dichotomous (0;1). This is accomplished by the link function $p\left(\frac{p}{1-p}\right)$.

 If coded correctly, logit regression can give you the logged odds from moving from a zero (event not happening) to one (event happening). Yet, we often don't think in terms of logged odds, so we can calculate predictive probabilities by dividing the coefficient by four - this will yield a maximum predictive probability when the coefficient rests in the middle of the logistic curve. \\

 More helpful for readers, perhaps, is to generate a probability plot, including data points along the x axis and the probability(y) along the logistic curve on the y axis. \\

\clearpage
\noindent \textbf{Poisson Regression:}\\
Poisson, Quasi-Poisson, and Negative Binomial regression all take count level data. Poisson assumes the variance to be held equal to the mean (a ``1'' in Quasi-Poisson); whereas Quasi-Poisson and Negative Binomial allow the variance to differentiate between models. In R:\\

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Poisson}
\hlstd{> }\hlstd{object} \hlkwb{<-} \hlkwd{glm}\hlstd{(formula,} \hlkwc{family} \hlstd{= poisson)}
\hlstd{> }
\hlstd{> }\hlcom{# Quasi-Poisson}
\hlstd{> }\hlstd{object} \hlkwb{<-} \hlkwd{glm}\hlstd{(formula,} \hlkwc{family} \hlstd{= quasipoisson)}
\hlstd{> }
\hlstd{> }\hlcom{# Negative Binomial/ Gamma-Poisson}
\hlstd{> }\hlstd{object} \hlkwb{<-} \hlkwd{glm.nb}\hlstd{(formula)}
\end{alltt}
\end{kframe}
\end{knitrout}

For interpretation, it is best to exponentiate the coefficients ($e^\beta$) to receive the multiplicative change exerted from each variable (keeping in mind significance). Tables can be created that show readers these effects (pg. 18-19).

\hfill \\
\noindent \textbf{Ordinal Regression:}\\
Ordinal data requires the interpretation of cut points ($k$) within our regression and is interpreted similarly to logistic regression. Ordinal data between cut points can be thought of as a series of logistic regressions between cut points.

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Ordinal Regression}
\hlstd{> }\hlstd{object} \hlkwb{<-} \hlkwd{polr}\hlstd{(formula)}
\end{alltt}
\end{kframe}
\end{knitrout}

It is important to make note of the ordinal categories, one category is omitted as a reference category within regression and the information received is in refference to the omitted category. Inverse logit subtraction can yield predictive probabilities: $logit^{-1}(\theta_{k+1}) - logit^{-1}(\theta_k) $ these latent space estimates are important to note as, when controlling for all else, the relative change between ordinal responses (feeling ``okay'' to feeling ``great'' for example).

\hfill \\


\noindent \textbf{Multinomial Nominal Modeling:}

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(nnet)}
\hlstd{> }\hlstd{object} \hlkwb{<-} \hlkwd{multinom}\hlstd{(formula)}
\end{alltt}
\end{kframe}
\end{knitrout}

Multinomial modeling includes data that is non-ordered, for example religious identity. Mathematically the link function (considering all probabilities for each category need add up to one) is very similar to the logistic link.

With the raw coefficients we get from multinomial data we receive the logged odds (like logistic regression) from moving from the omitted category (usually the first category in R) to the following categories. Again, we don't typically think in logged odds (another similarity to logistic regression) so making predictive probability plots are helpful (again, similar to logistic regression). \\


\hfill \\
\noindent \textbf{Survival Modeling: }

Survival models (as the name suggests) measures and indeed explicitly addresses the length of time a unit dies or survives across a length of time. The hazard parameter is held constant in the exponential model (at 1) whereas in the Weibull model it is allowed to vary (losing one degree of freedom, but this choice would depend on theory). To model survival data:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(survminer)}
\hlstd{> }\hlkwd{library}\hlstd{(survival)}
\hlstd{> }
\hlstd{> }\hlstd{expmod} \hlkwb{<-} \hlkwd{survreg}\hlstd{(}\hlkwd{Surv}\hlstd{(te, censor)} \hlopt{~} \hlstd{wc} \hlopt{+} \hlstd{dem} \hlopt{+} \hlstd{pvote} \hlopt{+} \hlstd{south,}
\hlstd{+ }                  \hlkwc{data} \hlstd{= dat,} \hlkwc{dist} \hlstd{=} \hlstr{"exponential"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{weibullmod} \hlkwb{<-} \hlkwd{survreg}\hlstd{(}\hlkwd{Surv}\hlstd{(te, censor)} \hlopt{~} \hlstd{wc} \hlopt{+} \hlstd{dem} \hlopt{+} \hlstd{pvote} \hlopt{+} \hlstd{south,}
\hlstd{+ }                  \hlkwc{data} \hlstd{= dat,} \hlkwc{dist} \hlstd{=} \hlstr{"weibull"}\hlstd{)}
\end{alltt}
\end{kframe}
\end{knitrout}

In interpretation of these models' output, we should consider it similar to the Poisson modeling: the multiplicative effect, holding all else constant, of a one unit increase in X onto Y. Although predictive probability plots are (again) superior to present these results.

Mapping graphs as shown in full in Section 7, are a intuitive and attractive way to communicate results to the reader. In these we separate two interesting strata and map the survival data accordingly, controlling for what we deem important with our theory. Kaplan-Meier \index{Kaplan-Meier} checks are also important because multiple ``deaths'' could occur at once and this will scale each of these instead of all at once - which is better.





\clearpage
\section{Machine Learning}

Machine learning has come to be popular among data scientists, chiefly for its ability to remove the researcher and have more streamlined ways to empirically examine categorization and estimands. By definition there are two types of machine learning, supervised and unsupervised. The prior includes researcher influence, classifications and penalizing regressions. The latter includes algorithmic detection of classifications and estimands through a (dare I say) machine-like process.


\textit{Types of Machine Learning}
\begin{equation}\nonumber
\begin{cases}
\text{Supervised learning} \begin{cases} \text{Classification} \\ \text{Regression} \end{cases}\\
\text{Unsupervised learning} \begin{cases} \text{Discovering clusters} \\ \text{Discovering latent factors} \\ \text{Discovering graph structure} \\ \text{Matrix completion} \end{cases}\\
\end{cases}
\end{equation}

A large benefit of this section will come in making synthetic data to test some fundamental assumptions of the GLM, all before introducing machine learning as a way to help us reach similar or better conclusions without the threat of researcher bias and ensured reproducability. For this reason, even an novice to graduate methods may find helpful the code and testing that exists in this section, as I have.

\subsection{Simulation and Replication}

Let's begin by setting up a simulated regression, which will have similar architecture throughout this chapter. This particular regression will have two random variables ($x_1$ and $x_2$) for $N$ observations. Then, we create our own coefficent values ($\beta$) and errors ($e$). A vector of ones is our intercept ($alpha$) and this is all neatly placed into a matrix. From this random data we can test some intial regressions.

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{set.seed}\hlstd{(}\hlnum{12345}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{N} \hlkwb{<-} \hlnum{1000}
\hlstd{> }\hlcom{# Two random x variables, with same mean and same error. Distributed Normally}
\hlstd{> }\hlstd{x_1} \hlkwb{<-} \hlkwd{rnorm}\hlstd{(N,} \hlkwc{mean}\hlstd{=}\hlnum{5}\hlstd{,} \hlkwc{sd}\hlstd{=}\hlkwd{sqrt}\hlstd{(}\hlnum{16}\hlstd{))}
\hlstd{> }\hlstd{x_2} \hlkwb{<-} \hlkwd{rnorm}\hlstd{(N,} \hlkwc{mean}\hlstd{=}\hlnum{5}\hlstd{,} \hlkwc{sd}\hlstd{=}\hlkwd{sqrt}\hlstd{(}\hlnum{16}\hlstd{))}
\hlstd{> }\hlcom{# beta values to multiply with the Intercept, X_1, and X_2 matrix.}
\hlstd{> }\hlstd{b} \hlkwb{<-} \hlkwd{c}\hlstd{(}\hlnum{2}\hlstd{,} \hlopt{-}\hlnum{1}\hlstd{,} \hlnum{3}\hlstd{)}
\hlstd{> }\hlcom{# Perfect-world errors: e~Normal(0, sig^2). set pretty low, Number=1000}
\hlstd{> }\hlstd{e} \hlkwb{<-} \hlkwd{rnorm}\hlstd{(N,} \hlnum{0}\hlstd{,} \hlkwc{sd}\hlstd{=}\hlkwd{sqrt}\hlstd{(}\hlnum{4}\hlstd{))}
\hlstd{> }\hlcom{# This vector of ones is to generate our intercept along with the "2" in beta}
\hlstd{> }\hlstd{ones} \hlkwb{<-} \hlkwd{matrix}\hlstd{(}\hlnum{1}\hlstd{,} \hlkwc{nrow}\hlstd{=}\hlnum{1000}\hlstd{,} \hlkwc{ncol}\hlstd{=}\hlnum{1}\hlstd{)}
\hlstd{> }\hlstd{X} \hlkwb{<-} \hlkwd{matrix}\hlstd{(}\hlkwd{c}\hlstd{(ones, x_1, x_2),} \hlkwc{nrow}\hlstd{=N)}
\hlstd{> }\hlcom{# head(X)  # Checked that the Matrix comes out right, and is intuitive}
\hlstd{> }\hlcom{# y = intercept + b1*X_1 + b2*X_2 + some error}
\hlstd{> }\hlstd{y} \hlkwb{<-} \hlstd{b[}\hlnum{1}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{1}\hlstd{]}\hlopt{+} \hlstd{b[}\hlnum{2}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{2}\hlstd{]}\hlopt{+} \hlstd{b[}\hlnum{3}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{3}\hlstd{]} \hlopt{+} \hlstd{e}
\hlstd{> }\hlstd{my_data} \hlkwb{<-} \hlkwd{data.frame}\hlstd{(x_1, x_2, y)}
\hlstd{> }\hlcom{# After having y, we can run our formula, OLS using lm()}
\hlstd{> }\hlstd{m1} \hlkwb{<-} \hlkwd{lm}\hlstd{(y} \hlopt{~} \hlstd{x_1} \hlopt{+} \hlstd{x_2,} \hlkwc{data}\hlstd{=my_data)}
\hlstd{> }\hlkwd{summary}\hlstd{(m1)}\hlopt{$}\hlstd{coef}
\end{alltt}
\begin{verbatim}
##              Estimate Std. Error   t value     Pr(>|t|)
## (Intercept)  1.992134 0.12163219  16.37834 1.420043e-53
## x_1         -1.005716 0.01517949 -66.25491 0.000000e+00
## x_2          2.997224 0.01503489 199.35128 0.000000e+00
\end{verbatim}
\end{kframe}
\end{knitrout}

We find that our estimates in our model come very close to our defined beta estimates, this makes sense since our betas were pre-defined this way. Each variable is statistically significant given we entered a pretty low error value into the model. Let's take the above regression and simulate it 1,000 times through a loop:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Let's set up an Empty matrix}
\hlstd{> }\hlstd{simulation1} \hlkwb{<-} \hlkwd{matrix}\hlstd{(}\hlkwc{nrow} \hlstd{=} \hlnum{1000}\hlstd{,} \hlkwc{ncol} \hlstd{=} \hlnum{6}\hlstd{)}
\hlstd{> }\hlcom{# head(simulation1)  # Matrix of NA's to fill in simulated values later.}
\hlstd{> }
\hlstd{> }\hlkwa{for} \hlstd{(i} \hlkwa{in} \hlnum{1}\hlopt{:}\hlnum{1000}\hlstd{) \{}
\hlstd{+ }  \hlstd{N} \hlkwb{<-} \hlnum{1000}
\hlstd{+ }  \hlstd{x_1} \hlkwb{<-} \hlkwd{rnorm}\hlstd{(N,} \hlkwc{mean}\hlstd{=}\hlnum{5}\hlstd{,} \hlkwc{sd}\hlstd{=}\hlkwd{sqrt}\hlstd{(}\hlnum{16}\hlstd{))}
\hlstd{+ }  \hlstd{x_2} \hlkwb{<-} \hlkwd{rnorm}\hlstd{(N,} \hlkwc{mean}\hlstd{=}\hlnum{5}\hlstd{,} \hlkwc{sd}\hlstd{=}\hlkwd{sqrt}\hlstd{(}\hlnum{16}\hlstd{))}
\hlstd{+ }  \hlstd{b} \hlkwb{<-} \hlkwd{c}\hlstd{(}\hlnum{2}\hlstd{,} \hlopt{-}\hlnum{1}\hlstd{,} \hlnum{3}\hlstd{)}
\hlstd{+ }  \hlstd{e} \hlkwb{<-} \hlkwd{rnorm}\hlstd{(N,} \hlnum{0}\hlstd{,} \hlkwc{sd}\hlstd{=}\hlkwd{sqrt}\hlstd{(}\hlnum{4}\hlstd{))}
\hlstd{+ }  \hlstd{ones} \hlkwb{<-} \hlkwd{matrix}\hlstd{(}\hlnum{1}\hlstd{,} \hlkwc{nrow}\hlstd{=}\hlnum{1000}\hlstd{,} \hlkwc{ncol}\hlstd{=}\hlnum{1}\hlstd{)}
\hlstd{+ }  \hlstd{X} \hlkwb{<-} \hlkwd{matrix}\hlstd{(}\hlkwd{c}\hlstd{(ones, x_1, x_2),} \hlkwc{nrow}\hlstd{=N)}
\hlstd{+ }  \hlstd{y} \hlkwb{<-} \hlstd{b[}\hlnum{1}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{1}\hlstd{]}\hlopt{+} \hlstd{b[}\hlnum{2}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{2}\hlstd{]}\hlopt{+} \hlstd{b[}\hlnum{3}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{3}\hlstd{]} \hlopt{+} \hlstd{e}
\hlstd{+ }  \hlstd{my_data} \hlkwb{<-} \hlkwd{data.frame}\hlstd{(x_1, x_2, y)}
\hlstd{+ }  \hlstd{m1} \hlkwb{<-} \hlkwd{lm}\hlstd{(y} \hlopt{~} \hlstd{x_1} \hlopt{+} \hlstd{x_2)}

\hlstd{+ }  \hlstd{sm1} \hlkwb{<-} \hlkwd{summary}\hlstd{(m1)}  \hlcom{# summary table is used to easily locate standard errors}

\hlstd{+ }  \hlstd{simulation1[i,}\hlnum{1}\hlstd{]} \hlkwb{<-} \hlstd{m1}\hlopt{$}\hlstd{coef[}\hlnum{1}\hlstd{]}    \hlcom{# storing models first coef: Intercept}
\hlstd{+ }  \hlstd{simulation1[i,}\hlnum{2}\hlstd{]} \hlkwb{<-} \hlstd{m1}\hlopt{$}\hlstd{coef[}\hlnum{2}\hlstd{]}    \hlcom{# x_1 coef estimate}
\hlstd{+ }  \hlstd{simulation1[i,}\hlnum{3}\hlstd{]} \hlkwb{<-} \hlstd{m1}\hlopt{$}\hlstd{coef[}\hlnum{3}\hlstd{]}    \hlcom{# x_2 coef estimate}
\hlstd{+ }  \hlstd{simulation1[i,}\hlnum{4}\hlstd{]} \hlkwb{<-} \hlstd{sm1}\hlopt{$}\hlstd{coefficients[}\hlnum{1}\hlstd{,}\hlnum{2}\hlstd{]}   \hlcom{# standard error for Intercept}
\hlstd{+ }  \hlstd{simulation1[i,}\hlnum{5}\hlstd{]} \hlkwb{<-} \hlstd{sm1}\hlopt{$}\hlstd{coefficients[}\hlnum{2}\hlstd{,}\hlnum{2}\hlstd{]}   \hlcom{# se x_1}
\hlstd{+ }  \hlstd{simulation1[i,}\hlnum{6}\hlstd{]} \hlkwb{<-} \hlstd{sm1}\hlopt{$}\hlstd{coefficients[}\hlnum{3}\hlstd{,}\hlnum{2}\hlstd{]}   \hlcom{# se x_2}
\hlstd{+ }\hlstd{\}}
\hlstd{> }
\hlstd{> }\hlcom{# head(simulation1)  # To check our now-full matrix to see if values make sense}
\end{alltt}
\end{kframe}
\end{knitrout}

Next, we will do the same simulation but removing $x_2$ in our model. Then we will plot each of the variables from the two simulations. The code for plotting has been witheld to save space on page, but it is done using ggplot and a function to make the plots appear next to one another.

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Removing x_2 now}
\hlstd{> }\hlcom{#  New empty matrix}
\hlstd{> }\hlstd{simulation2} \hlkwb{<-} \hlkwd{matrix}\hlstd{(}\hlkwc{nrow} \hlstd{=} \hlnum{1000}\hlstd{,} \hlkwc{ncol} \hlstd{=} \hlnum{4}\hlstd{)}
\hlstd{> }\hlcom{# head(simulation2)}
\hlstd{> }
\hlstd{> }\hlkwa{for} \hlstd{(i} \hlkwa{in} \hlnum{1}\hlopt{:}\hlnum{1000}\hlstd{) \{}
\hlstd{+ }  \hlstd{N} \hlkwb{<-} \hlnum{1000}
\hlstd{+ }  \hlstd{x_1} \hlkwb{<-} \hlkwd{rnorm}\hlstd{(N,} \hlkwc{mean}\hlstd{=}\hlnum{5}\hlstd{,} \hlkwc{sd}\hlstd{=}\hlkwd{sqrt}\hlstd{(}\hlnum{16}\hlstd{))}
\hlstd{+ }  \hlstd{x_2} \hlkwb{<-} \hlkwd{rnorm}\hlstd{(N,} \hlkwc{mean}\hlstd{=}\hlnum{5}\hlstd{,} \hlkwc{sd}\hlstd{=}\hlkwd{sqrt}\hlstd{(}\hlnum{16}\hlstd{))}
\hlstd{+ }  \hlstd{b} \hlkwb{<-} \hlkwd{c}\hlstd{(}\hlnum{2}\hlstd{,} \hlopt{-}\hlnum{1}\hlstd{,} \hlnum{3}\hlstd{)}
\hlstd{+ }  \hlstd{e} \hlkwb{<-} \hlkwd{rnorm}\hlstd{(N,} \hlnum{0}\hlstd{,} \hlkwc{sd}\hlstd{=}\hlkwd{sqrt}\hlstd{(}\hlnum{4}\hlstd{))}
\hlstd{+ }  \hlstd{ones} \hlkwb{<-} \hlkwd{matrix}\hlstd{(}\hlnum{1}\hlstd{,} \hlkwc{nrow}\hlstd{=}\hlnum{1000}\hlstd{,} \hlkwc{ncol}\hlstd{=}\hlnum{1}\hlstd{)}
\hlstd{+ }  \hlstd{X} \hlkwb{<-} \hlkwd{matrix}\hlstd{(}\hlkwd{c}\hlstd{(ones, x_1, x_2),} \hlkwc{nrow}\hlstd{=N)}
\hlstd{+ }  \hlstd{y} \hlkwb{<-} \hlstd{b[}\hlnum{1}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{1}\hlstd{]}\hlopt{+} \hlstd{b[}\hlnum{2}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{2}\hlstd{]}\hlopt{+} \hlstd{b[}\hlnum{3}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{3}\hlstd{]} \hlopt{+} \hlstd{e}
\hlstd{+ }  \hlstd{m1} \hlkwb{<-} \hlkwd{lm}\hlstd{(y} \hlopt{~} \hlstd{x_1)}                \hlcom{#! no X_2 regressed, but included in DGP}

\hlstd{+ }  \hlstd{sm1} \hlkwb{<-} \hlkwd{summary}\hlstd{(m1)}

\hlstd{+ }  \hlstd{simulation2[i,}\hlnum{1}\hlstd{]} \hlkwb{<-} \hlstd{sm1}\hlopt{$}\hlstd{coef[}\hlnum{1}\hlstd{,}\hlnum{1}\hlstd{]}     \hlcom{#Storing models first coef, Intercept}
\hlstd{+ }  \hlstd{simulation2[i,}\hlnum{2}\hlstd{]} \hlkwb{<-} \hlstd{sm1}\hlopt{$}\hlstd{coef[}\hlnum{2}\hlstd{,}\hlnum{1}\hlstd{]}     \hlcom{#x_1 coef estimate}
\hlstd{+ }  \hlstd{simulation2[i,}\hlnum{3}\hlstd{]} \hlkwb{<-} \hlstd{sm1}\hlopt{$}\hlstd{coef[}\hlnum{1}\hlstd{,}\hlnum{2}\hlstd{]}      \hlcom{#standard error for Intercept}
\hlstd{+ }  \hlstd{simulation2[i,}\hlnum{4}\hlstd{]} \hlkwb{<-} \hlstd{sm1}\hlopt{$}\hlstd{coef[}\hlnum{2}\hlstd{,}\hlnum{2}\hlstd{]}      \hlcom{#se for x_1}
\hlstd{+ }\hlstd{\}}
\hlstd{> }
\hlstd{> }\hlcom{# Full Model Means}
\hlstd{> }\hlcom{#   mean(simulation1[,1]) # mean estimate for b_0 (= 2)}
\hlstd{> }\hlcom{#   mean(simulation1[,2]) # mean estimate for b_1 X_1 estimate (= -1)}
\hlstd{> }\hlcom{#   mean(simulation1[,3]) # mean estimate for b_2 x_2 estimate (= 3)}
\hlstd{> }
\hlstd{> }\hlcom{# Limited Model Means}
\hlstd{> }\hlcom{#   mean(simulation2[,1]) #mean b_0 (=2)}
\hlstd{> }\hlcom{#   mean(simulation2[,2]) #mean b_1 of x_1 (=-1)}
\hlstd{> }\hlcom{# This makes sense given our initial model data b=c(2, -1, 3)}
\end{alltt}
\end{kframe}
\end{knitrout}

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}
\includegraphics[width=\maxwidth]{figure/PlottingSimulationML-1} 
\end{knitrout}
\end{center}

As is expected, most things remain the same between the two simulations, however in simulation two removing a variable (imagine this being race, education, or some economic variable) biases our estimate of the intercept. More importantly, this will balloon the errors (hopefully because that's what errors are supposed to tell us): \index{Simulation}

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{mean}\hlstd{(simulation1[,}\hlnum{5}\hlstd{])} \hlcom{# Simulation 1's X_1 se's (0.0158)}
\end{alltt}
\begin{verbatim}
## [1] 0.01581834
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{mean}\hlstd{(simulation2[,}\hlnum{4}\hlstd{])} \hlcom{# Simulation 2's X_1 se's (0.0962)}
\end{alltt}
\begin{verbatim}
## [1] 0.09632281
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{mean}\hlstd{(simulation1[,}\hlnum{4}\hlstd{])}  \hlcom{# Simulation 1's Intercept se (.128)}
\end{alltt}
\begin{verbatim}
## [1] 0.1285995
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{mean}\hlstd{(simulation2[,}\hlnum{3}\hlstd{])}  \hlcom{# Simulation 2's Intercept se (.615)}
\end{alltt}
\begin{verbatim}
## [1] 0.6168927
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# Errors are larger when we take x_2 out of our analysis}
\hlstd{> }\hlcom{#   (less variation captured from DGP)}
\end{alltt}
\end{kframe}
\end{knitrout}

One advantage of using simulated data is the complete controll and education available from messing around with things without any consequences (most of the time). Now that we have tested some of the fundementals of the linear model and reporting estimates, let's use simulation to try to fit a linear model to binary data.

Let us start with just making a fun function that creates inverse logit estimands.

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlstd{inv.logit} \hlkwb{=} \hlkwa{function}\hlstd{(}\hlkwc{x}\hlstd{) \{}
\hlstd{+ }  \hlkwa{if}\hlstd{(}\hlopt{!}\hlkwd{is.numeric}\hlstd{(x))\{}\hlkwd{return}\hlstd{(}\hlstr{"Error 404: Numbers Not Found"}\hlstd{)\}}
\hlstd{+ }  \hlkwd{exp}\hlstd{(x)}\hlopt{/}\hlstd{(}\hlnum{1}\hlopt{+}\hlkwd{exp}\hlstd{(x))}
\hlstd{+ }\hlstd{\}}
\hlstd{> }
\hlstd{> }\hlkwd{inv.logit}\hlstd{(}\hlnum{.95}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1] 0.7211152
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{inv.logit}\hlstd{(}\hlstr{"Normative"}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1] "Error 404: Numbers Not Found"
\end{verbatim}
\end{kframe}
\end{knitrout}

Now, like before, we will construct a DGP via simulation:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(Rlab)} \hlcom{# for rbern() function}
\end{alltt}


{\ttfamily\noindent\color{warningcolor}{\#\# Warning: package 'Rlab' was built under R version 4.1.3}}\begin{alltt}
\hlstd{> }\hlstd{simulation5} \hlkwb{<-} \hlkwd{matrix}\hlstd{(}\hlkwc{nrow} \hlstd{=} \hlnum{1000}\hlstd{,} \hlkwc{ncol} \hlstd{=} \hlnum{6}\hlstd{)}
\hlstd{> }\hlcom{# head(simulation5)}
\hlstd{> }
\hlstd{> }\hlkwa{for} \hlstd{(i} \hlkwa{in} \hlnum{1}\hlopt{:}\hlnum{1000}\hlstd{) \{}
\hlstd{+ }  \hlstd{N} \hlkwb{<-} \hlnum{1000}
\hlstd{+ }  \hlstd{mu} \hlkwb{<-} \hlkwd{c}\hlstd{(}\hlnum{5}\hlstd{,}\hlnum{5}\hlstd{)}
\hlstd{+ }  \hlstd{Sigma} \hlkwb{<-} \hlkwd{matrix}\hlstd{(} \hlkwd{c}\hlstd{(}\hlnum{2}\hlstd{,} \hlnum{.5}\hlstd{,} \hlnum{.5}\hlstd{,} \hlnum{3} \hlstd{),} \hlkwc{nrow} \hlstd{=} \hlnum{2}\hlstd{,} \hlkwc{ncol}\hlstd{=} \hlnum{2}\hlstd{)}
\hlstd{+ }  \hlstd{mvr} \hlkwb{<-} \hlkwd{mvrnorm}\hlstd{(N, mu, Sigma)} \hlcom{# using MASS package}
\hlstd{+ }  \hlstd{b} \hlkwb{<-} \hlkwd{c}\hlstd{(}\hlnum{.2}\hlstd{,} \hlopt{-}\hlnum{1}\hlstd{,} \hlnum{1.2}\hlstd{)}
\hlstd{+ }  \hlstd{e} \hlkwb{<-} \hlkwd{rnorm}\hlstd{(N,} \hlnum{0}\hlstd{,} \hlkwc{sd}\hlstd{=}\hlkwd{sqrt}\hlstd{(}\hlnum{4}\hlstd{))}
\hlstd{+ }  \hlstd{ones} \hlkwb{<-} \hlkwd{matrix}\hlstd{(}\hlnum{1}\hlstd{,} \hlkwc{nrow}\hlstd{=}\hlnum{1000}\hlstd{,} \hlkwc{ncol}\hlstd{=}\hlnum{1}\hlstd{)}
\hlstd{+ }  \hlstd{X} \hlkwb{<-} \hlkwd{matrix}\hlstd{(}\hlkwd{c}\hlstd{(ones, mvr[,}\hlnum{1}\hlstd{], mvr[,}\hlnum{2}\hlstd{]),} \hlkwc{nrow}\hlstd{=N)}
\hlstd{+ }  \hlstd{y} \hlkwb{<-} \hlstd{b[}\hlnum{1}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{1}\hlstd{]}\hlopt{+} \hlstd{b[}\hlnum{2}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{2}\hlstd{]}\hlopt{+} \hlstd{b[}\hlnum{3}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{3}\hlstd{]} \hlopt{+} \hlstd{e}
\hlstd{+ }  \hlstd{y} \hlkwb{<-} \hlkwd{as.numeric}\hlstd{(y} \hlopt{>=} \hlkwd{median}\hlstd{(y))} \hlcom{# Setting y 0-1 based around median.}

\hlstd{+ }  \hlcom{# Inverse Logits}
\hlstd{+ }  \hlcom{# Intercept}
\hlstd{+ }  \hlstd{inv.logit.a} \hlkwb{<-} \hlkwd{inv.logit}\hlstd{(b[}\hlnum{1}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{1}\hlstd{])}
\hlstd{+ }  \hlstd{b0} \hlkwb{<-} \hlkwd{matrix}\hlstd{(inv.logit.a,} \hlkwc{nrow}\hlstd{=N,} \hlkwc{ncol}\hlstd{=} \hlnum{1}\hlstd{)}

\hlstd{+ }  \hlcom{#X_1}
\hlstd{+ }  \hlstd{inv.logit.x2} \hlkwb{<-} \hlkwd{inv.logit}\hlstd{(b[}\hlnum{2}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{2}\hlstd{])}
\hlstd{+ }  \hlstd{b1} \hlkwb{<-} \hlkwd{matrix}\hlstd{(inv.logit.x2,} \hlkwc{nrow}\hlstd{=N,} \hlkwc{ncol}\hlstd{=} \hlnum{1}\hlstd{)}

\hlstd{+ }  \hlcom{#X_2}
\hlstd{+ }  \hlstd{inv.logit.x3} \hlkwb{<-} \hlkwd{inv.logit}\hlstd{(b[}\hlnum{3}\hlstd{]}\hlopt{*}\hlstd{X[,}\hlnum{3}\hlstd{])}
\hlstd{+ }  \hlstd{b2} \hlkwb{<-} \hlkwd{matrix}\hlstd{(inv.logit.x3,} \hlkwc{nrow}\hlstd{=N,} \hlkwc{ncol}\hlstd{=} \hlnum{1}\hlstd{)}

\hlstd{+ }  \hlstd{pi} \hlkwb{<-} \hlkwd{matrix}\hlstd{(}\hlkwd{c}\hlstd{(b0, b1, b2),} \hlkwc{nrow}\hlstd{=N,} \hlkwc{ncol}\hlstd{=}\hlnum{3}\hlstd{)}
\hlstd{+ }  \hlstd{y} \hlkwb{<-} \hlkwd{rbern}\hlstd{(N, pi)}

\hlstd{+ }  \hlstd{m5} \hlkwb{<-} \hlkwd{lm}\hlstd{(y} \hlopt{~} \hlstd{X[,}\hlnum{2}\hlstd{]}\hlopt{+} \hlstd{X[,}\hlnum{3}\hlstd{])} \hlcom{# linear model to binary data...}
\hlstd{+ }  \hlstd{sm5} \hlkwb{<-} \hlkwd{summary}\hlstd{(m5)}

\hlstd{+ }  \hlstd{simulation5[i,}\hlnum{1}\hlstd{]} \hlkwb{<-} \hlstd{sm5}\hlopt{$}\hlstd{coef[}\hlnum{1}\hlstd{,}\hlnum{1}\hlstd{]} \hlcom{#Intercept estimate}
\hlstd{+ }  \hlstd{simulation5[i,}\hlnum{2}\hlstd{]} \hlkwb{<-} \hlstd{sm5}\hlopt{$}\hlstd{coef[}\hlnum{2}\hlstd{,}\hlnum{1}\hlstd{]} \hlcom{#x_1 coef estimate}
\hlstd{+ }  \hlstd{simulation5[i,}\hlnum{3}\hlstd{]} \hlkwb{<-} \hlstd{sm5}\hlopt{$}\hlstd{coef[}\hlnum{3}\hlstd{,}\hlnum{1}\hlstd{]} \hlcom{#x_2 coef estimate}

\hlstd{+ }  \hlstd{simulation5[i,}\hlnum{4}\hlstd{]} \hlkwb{<-} \hlstd{sm5}\hlopt{$}\hlstd{coef[}\hlnum{1}\hlstd{,}\hlnum{2}\hlstd{]} \hlcom{#standard error for Intercept}
\hlstd{+ }  \hlstd{simulation5[i,}\hlnum{5}\hlstd{]} \hlkwb{<-} \hlstd{sm5}\hlopt{$}\hlstd{coef[}\hlnum{2}\hlstd{,}\hlnum{2}\hlstd{]} \hlcom{#se x_1}
\hlstd{+ }  \hlstd{simulation5[i,}\hlnum{6}\hlstd{]} \hlkwb{<-} \hlstd{sm5}\hlopt{$}\hlstd{coef[}\hlnum{3}\hlstd{,}\hlnum{2}\hlstd{]} \hlcom{#se x_2}
\hlstd{+ }\hlstd{\}}
\end{alltt}
\end{kframe}
\end{knitrout}

That perhaps seemed too complicated, but I wanted to show the MASS and RLab packages for what they offer in creating simulated data. Similar to before I will plot the results:

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}
\includegraphics[width=5in]{figure/hiddenplotlineartologit-1} 
\begin{kframe}\begin{verbatim}
## [1] 2
\end{verbatim}
\end{kframe}
\end{knitrout}
\end{center}

Here we see the three estimates from our simulation and our model's prediction based upon the R \texttt{predict()} command. Our estimates are definately off and our predictions seem to be off because of this. Perhaps running a proper logit or probit model will help. We could run the same DGP but with the proper modeling using the \texttt{glm()} function, and the proper link function if we so desired.


\subsection{Penalized Regression: LASSO, Ridge, Elastic Net}

Let's use simulation to test out a few penalized regression models in R, starting with making a new DGP:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{set.seed}\hlstd{(}\hlnum{12345}\hlstd{)}
\hlstd{> }\hlkwd{library}\hlstd{(caret)} \hlcom{#! for train() and Penalized Regression Functions}
\end{alltt}


{\ttfamily\noindent\color{warningcolor}{\#\# Warning: package 'caret' was built under R version 4.1.3}}\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(MASS)} \hlcom{# mvrnorm()}
\hlstd{> }\hlkwd{library}\hlstd{(Rlab)} \hlcom{# for rbern()}
\hlstd{> }\hlkwd{library}\hlstd{(glmnet)}
\end{alltt}


{\ttfamily\noindent\color{warningcolor}{\#\# Warning: package 'glmnet' was built under R version 4.1.3}}\begin{alltt}
\hlstd{> }\hlstd{N} \hlkwb{<-} \hlnum{1000}
\hlstd{> }\hlstd{P} \hlkwb{<-} \hlnum{100}
\hlstd{> }\hlcom{# Wishart distribution for positive definite matricies}
\hlstd{> }\hlstd{Sigma} \hlkwb{<-} \hlkwd{rWishart}\hlstd{(}\hlkwc{n}\hlstd{=}\hlnum{1}\hlstd{,} \hlkwc{df}\hlstd{=P,} \hlkwc{Sigma}\hlstd{=}\hlkwd{diag}\hlstd{(P))[,,}\hlnum{1}\hlstd{]}
\hlstd{> }\hlstd{X} \hlkwb{<-} \hlkwd{mvrnorm}\hlstd{(N,} \hlkwd{runif}\hlstd{(P,} \hlopt{-}\hlnum{10}\hlstd{,} \hlnum{10}\hlstd{), Sigma)}
\hlstd{> }\hlstd{p} \hlkwb{<-} \hlkwd{rbern}\hlstd{(P,} \hlnum{0.1}\hlstd{)}
\hlstd{> }\hlstd{b} \hlkwb{<-} \hlstd{p} \hlopt{*} \hlkwd{rnorm}\hlstd{(P,} \hlnum{5}\hlstd{,} \hlnum{5}\hlstd{)} \hlopt{+} \hlstd{(}\hlnum{1}\hlopt{-}\hlstd{p)} \hlopt{*} \hlkwd{rnorm}\hlstd{(P,} \hlnum{0}\hlstd{,} \hlnum{0.1}\hlstd{)}
\hlstd{> }\hlstd{e} \hlkwb{<-} \hlkwd{rnorm}\hlstd{(N,} \hlnum{0}\hlstd{,} \hlkwc{sd}\hlstd{=}\hlkwd{sqrt}\hlstd{(}\hlnum{10}\hlstd{))}
\hlstd{> }\hlstd{y} \hlkwb{=} \hlstd{X}\hlopt{%*%}\hlstd{b} \hlopt{+} \hlstd{e}
\hlstd{> }\hlstd{m1} \hlkwb{<-} \hlkwd{lm}\hlstd{(y}\hlopt{~}\hlstd{X)}
\hlstd{> }\hlcom{# Set data frame}
\hlstd{> }\hlstd{my_data} \hlkwb{=} \hlkwd{data.frame}\hlstd{(X,y)}
\end{alltt}
\end{kframe}
\end{knitrout}

Then we can use a few other functions to make a test set training set: \index{Test Set Training Set}

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{## Test Set (20%); Training Set (80%)}
\hlstd{> }\hlcom{# Get 800 random index from y}
\hlstd{> }\hlstd{trainidx} \hlkwb{<-} \hlkwd{createDataPartition}\hlstd{(y,} \hlkwc{times} \hlstd{=} \hlnum{1}\hlstd{,} \hlkwc{p}\hlstd{=}\hlnum{.80}\hlstd{,} \hlkwc{list}\hlstd{=}\hlnum{FALSE}\hlstd{)}
\hlstd{> }\hlstd{trainy} \hlkwb{<-} \hlstd{y[trainidx]}  \hlcom{# Get traniing set index numbers; sample y's values}
\hlstd{> }\hlstd{testy} \hlkwb{<-} \hlstd{y[}\hlopt{-}\hlstd{trainidx]}  \hlcom{# Other 20% for test set (y)}
\hlstd{> }\hlstd{trainx} \hlkwb{<-} \hlstd{X[trainidx,]} \hlcom{# same for setting up X variable:}
\hlstd{> }\hlstd{testx} \hlkwb{<-} \hlstd{X[}\hlopt{-}\hlstd{trainidx,]}
\hlstd{> }
\hlstd{> }\hlcom{# Create Data Frames for these:}
\hlstd{> }\hlstd{train_data} \hlkwb{=} \hlkwd{data.frame}\hlstd{(trainx, trainy)}
\hlstd{> }\hlstd{test_data} \hlkwb{=} \hlkwd{data.frame}\hlstd{(testx, testy)}
\end{alltt}
\end{kframe}
\end{knitrout}

The idea here is to do data manipulation and all testing for significance just on a training set, using the test set to come in later to ``prove'' that everything is good-to-go independent of your training manipulations. It's a great practice, with many ways to do it in R; which will be showcased throughout this chapter. I prefer the \texttt{createDataPartition()} function myself.

Let us first plot the correlation between the true $\beta$ and our model's predicted $\beta$:

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(ggplot2)} \hlcom{# Graphing}
\hlstd{> }
\hlstd{> }\hlkwd{qplot}\hlstd{(b,} \hlkwd{coef}\hlstd{(m1)[}\hlopt{-}\hlnum{1}\hlstd{])} \hlopt{+}
\hlstd{+ }     \hlkwd{xlab}\hlstd{(}\hlkwd{expression}\hlstd{(}\hlkwd{paste}\hlstd{(}\hlstr{"True "} \hlstd{, beta)))} \hlopt{+}
\hlstd{+ }     \hlkwd{ylab}\hlstd{(}\hlkwd{expression}\hlstd{(}\hlkwd{paste}\hlstd{(}\hlstr{"Model "} \hlstd{,} \hlkwd{hat}\hlstd{(beta),} \hlstr{" Values"}\hlstd{)))} \hlopt{+}
\hlstd{+ }     \hlkwd{theme_bw}\hlstd{()} \hlopt{+}
\hlstd{+ }     \hlkwd{theme}\hlstd{(}\hlkwc{axis.text} \hlstd{=} \hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{12}\hlstd{),}
\hlstd{+ }           \hlkwc{axis.title} \hlstd{=} \hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{14}\hlstd{,} \hlkwc{face}\hlstd{=}\hlstr{"bold"}\hlstd{))}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/betabetatestPenRegress1-1} 
\end{knitrout}
\end{center}

These results make sense, most of our beta’s cluster with a mean around zero and some of our beta’s are outward with a mean around five and a larger standard deviation. Now, using our training data and leaving the test data aside, let’s run the same model within the training data, and examine the errors in a few different ways:

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{## Training Model:}
\hlstd{> }\hlstd{trainmod} \hlkwb{<-} \hlkwd{lm}\hlstd{(train_data}\hlopt{$}\hlstd{trainy} \hlopt{~} \hlstd{trainx,} \hlkwc{data} \hlstd{= train_data)}
\hlstd{> }\hlcom{# summary(trainmod) # Check that this makes sense}
\hlstd{> }
\hlstd{> }\hlstd{error} \hlkwb{<-} \hlstd{train_data}\hlopt{$}\hlstd{trainy} \hlopt{-} \hlkwd{predict}\hlstd{(trainmod)}
\hlstd{> }\hlcom{# head(error) # Check this makes sense}
\hlstd{> }
\hlstd{> }\hlcom{# Ideally we want normality here, mean zero}
\hlstd{> }\hlkwd{qplot}\hlstd{(error,} \hlkwc{bins}\hlstd{=}\hlnum{50}\hlstd{,} \hlkwc{fill}\hlstd{=}\hlkwd{I}\hlstd{(}\hlstr{"grey10"}\hlstd{))} \hlopt{+}
\hlstd{+ }     \hlkwd{xlab}\hlstd{(}\hlstr{"Model Errors"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlkwd{ylab}\hlstd{(}\hlstr{"Count"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlkwd{theme_bw}\hlstd{()} \hlopt{+}
\hlstd{+ }     \hlkwd{theme}\hlstd{(}\hlkwc{axis.text}\hlstd{=}\hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{12}\hlstd{),}
\hlstd{+ }           \hlkwc{axis.title}\hlstd{=}\hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{14}\hlstd{))}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/examineerrorsML-1} 
\end{knitrout}
\end{center}

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{## Root Mean Squred Error}
\hlstd{> }\hlkwd{sqrt}\hlstd{(}\hlkwd{mean}\hlstd{(error}\hlopt{^}\hlnum{2}\hlstd{))}
\end{alltt}
\begin{verbatim}
## [1] 2.957983
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## [1] 3.039912}
\hlstd{> }
\hlstd{> }\hlcom{## Mean Aboslute Error}
\hlstd{> }\hlkwd{mean}\hlstd{(}\hlkwd{abs}\hlstd{(error))}
\end{alltt}
\begin{verbatim}
## [1] 2.353741
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## [1] 2.415841}
\end{alltt}
\end{kframe}
\end{knitrout}

Using just our training data with the linear model we see our root mean squared error and mean absolute error are about around 3, pretty low. More intuitively, our errors when plotted are normally distributed with a mean of zero. We can revisit this with a LASSO and Ridge regression to penalize us for having so many parameters for so few observations. Using penalized regression is especially helpful with models that have a large number of predictors relative to our sample size. The ``elastic net'' is particularly useful because it ``switches'' between two other penalties (using $\alpha$), the ``LASSO'' (Least Absolute Shrinkage and Selection Operator uses a squared transformation) and “Ridge” (using the absolute value of our coefficients), applying both of these in an ever-checking gradient descent down our distribution to the point of least error. Ideally we would like a smooth distribution in this process instead of quick-changing erratic distribution and the elastic net provides the previously mentioned functions to accomplish this via the transformation of our coefficients as they travel farther away from zero.\index{LASSO} \index{Ridge} \index{Elastic Net}

Let's begin with the LASSO:

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Remember our training data frame:}
\hlstd{> }\hlstd{train_data} \hlkwb{=} \hlkwd{data.frame}\hlstd{(trainx, trainy)}
\hlstd{> }
\hlstd{> }\hlstd{mod_lasso} \hlkwb{=} \hlkwd{train}\hlstd{(trainy}\hlopt{~}\hlstd{.,} \hlkwc{method}\hlstd{=}\hlstr{"glmnet"}\hlstd{,}\hlcom{# formula and method}
\hlstd{+ }     \hlkwc{tuneGrid} \hlstd{=} \hlkwd{expand.grid}\hlstd{(}\hlkwc{alpha} \hlstd{=} \hlnum{0}\hlstd{,} \hlcom{# alpha=0 is the LASSO}
\hlstd{+ }               \hlkwc{lambda} \hlstd{=} \hlkwd{seq}\hlstd{(}\hlnum{0}\hlstd{,}\hlnum{100}\hlstd{,}\hlnum{1}\hlstd{)),} \hlcom{#gradient descent to zero}
\hlstd{+ }     \hlkwc{data} \hlstd{= train_data,}
\hlstd{+ }     \hlkwc{preProcess} \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"center"}\hlstd{),}\hlcom{# centering standardization of points}
\hlstd{+ }     \hlkwc{trControl} \hlstd{=} \hlkwd{trainControl}\hlstd{(}\hlkwc{method}\hlstd{=}\hlstr{"cv"}\hlstd{,}\hlkwc{number}\hlstd{=}\hlnum{2}\hlstd{,} \hlkwc{search}\hlstd{=}\hlstr{"grid"}\hlstd{))}
\hlstd{> }\hlcom{# "trainControl" sets a resampling method per a "search" parameter grid}
\hlstd{> }\hlcom{# mod_lasso ## final values were around lambda = 14 using RMSE}
\hlstd{> }
\hlstd{> }\hlcom{## Narrowing lambda sequence closer to what the lambda reported earlier:}
\hlstd{> }\hlstd{mod_lasso} \hlkwb{=} \hlkwd{train}\hlstd{(trainy}\hlopt{~}\hlstd{.,} \hlkwc{method} \hlstd{=} \hlstr{"glmnet"}\hlstd{,}
\hlstd{+ }     \hlkwc{tuneGrid} \hlstd{=} \hlkwd{expand.grid}\hlstd{(}\hlkwc{alpha} \hlstd{=} \hlnum{0}\hlstd{,}
\hlstd{+ }     \hlcom{# *setting bounds closer around 14; smaller "steps" (0.01)}
\hlstd{+ }                         \hlkwc{lambda} \hlstd{=} \hlkwd{seq}\hlstd{(}\hlnum{0}\hlstd{,}\hlnum{40}\hlstd{,}\hlnum{0.01}\hlstd{)),}
\hlstd{+ }     \hlkwc{data} \hlstd{= train_data,}
\hlstd{+ }     \hlkwc{preProcess} \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"center"}\hlstd{),}
\hlstd{+ }     \hlkwc{trControl} \hlstd{=} \hlkwd{trainControl}\hlstd{(}\hlkwc{method}\hlstd{=}\hlstr{"cv"}\hlstd{,}\hlkwc{number}\hlstd{=}\hlnum{2}\hlstd{,} \hlkwc{search}\hlstd{=}\hlstr{"grid"}\hlstd{))}
\hlstd{> }     \hlcom{# mod_lasso ## Narrowing in, we found a new best lambda of around 14.5!}
\hlstd{> }
\hlstd{> }\hlcom{## Predictions:}
\hlstd{> }\hlstd{yhat} \hlkwb{=} \hlkwd{predict}\hlstd{(mod_lasso)}
\hlstd{> }\hlcom{# alpha allows transparent points to see density}
\hlstd{> }\hlkwd{qplot}\hlstd{(trainy, yhat,} \hlkwc{alpha}\hlstd{=}\hlkwd{I}\hlstd{(}\hlnum{0.25}\hlstd{))} \hlopt{+}
\hlstd{+ }     \hlkwd{xlab}\hlstd{(}\hlkwd{expression}\hlstd{(}\hlkwd{paste}\hlstd{(}\hlstr{"Training "}\hlstd{, y)))} \hlopt{+}
\hlstd{+ }     \hlkwd{ylab}\hlstd{(}\hlkwd{expression}\hlstd{(}\hlkwd{paste}\hlstd{(}\hlstr{"Ridge "}\hlstd{,} \hlkwd{hat}\hlstd{(y))))} \hlopt{+}
\hlstd{+ }     \hlkwd{theme_bw}\hlstd{()} \hlopt{+}
\hlstd{+ }     \hlkwd{theme}\hlstd{(}\hlkwc{axis.text} \hlstd{=} \hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{12}\hlstd{),}
\hlstd{+ }          \hlkwc{axis.title} \hlstd{=} \hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{14}\hlstd{))}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/LASSO1ML-1} 
\end{knitrout}
\end{center}
\index{GGplot}

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# best values using best lambda:}
\hlstd{> }\hlstd{lasso_beta} \hlkwb{=} \hlkwd{coef}\hlstd{(mod_lasso}\hlopt{$}\hlstd{finalModel, mod_lasso}\hlopt{$}\hlstd{bestTune}\hlopt{$}\hlstd{lambda)}
\hlstd{> }
\hlstd{> }\hlkwd{qplot}\hlstd{(b, lasso_beta[}\hlopt{-}\hlnum{1}\hlstd{])} \hlopt{+} \hlcom{# removing intercept}
\hlstd{+ }     \hlkwd{xlab}\hlstd{(}\hlkwd{expression}\hlstd{(}\hlkwd{paste}\hlstd{(}\hlstr{"True "}\hlstd{, beta)))} \hlopt{+}
\hlstd{+ }     \hlkwd{ylab}\hlstd{(}\hlkwd{expression}\hlstd{(}\hlkwd{paste}\hlstd{(}\hlstr{"LASSO "}\hlstd{, beta)))} \hlopt{+}
\hlstd{+ }     \hlkwd{theme_bw}\hlstd{()} \hlopt{+}
\hlstd{+ }     \hlkwd{theme}\hlstd{(}\hlkwc{axis.text} \hlstd{=} \hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{12}\hlstd{),}
\hlstd{+ }          \hlkwc{axis.title} \hlstd{=} \hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{14}\hlstd{))}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/LASSOvaluesML1-1} 
\end{knitrout}
\end{center}

What this tells us is that our predicted values from the LASSO model does well with our training $y$ data. Specifcally, in the first figure we see that our training dependent variable and our penalized LASSO predictions match with each other positively. In the second figure, we see our actual beta’s more accurately plotted in conjunction with the LASSO’s best fit betas.
Similarly, let’s see how the Ridge and elastic net’s hold up:

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{## Running Ridge:}
\hlstd{> }\hlstd{mod_ridge} \hlkwb{=} \hlkwd{train}\hlstd{(trainy}\hlopt{~}\hlstd{.,} \hlkwc{method}\hlstd{=}\hlstr{"glmnet"}\hlstd{,}
\hlstd{+ }          \hlkwc{tuneGrid} \hlstd{=} \hlkwd{expand.grid}\hlstd{(}\hlkwc{alpha}\hlstd{=}\hlnum{1}\hlstd{,}
\hlstd{+ }               \hlkwc{lambda} \hlstd{=} \hlkwd{seq}\hlstd{(}\hlnum{0}\hlstd{,}\hlnum{10}\hlstd{,}\hlnum{0.01}\hlstd{)),}
\hlstd{+ }          \hlkwc{data} \hlstd{= train_data,}
\hlstd{+ }          \hlkwc{preProcess} \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"center"}\hlstd{),}
\hlstd{+ }          \hlkwc{trControl} \hlstd{=} \hlkwd{trainControl}\hlstd{(}\hlkwc{method} \hlstd{=} \hlstr{"cv"}\hlstd{,}
\hlstd{+ }                                   \hlkwc{number} \hlstd{=} \hlnum{2}\hlstd{,}
\hlstd{+ }                                   \hlkwc{search} \hlstd{=} \hlstr{"grid"}\hlstd{))}
\hlstd{> }\hlcom{# Best lambda (RMSE) is 1.01}
\hlstd{> }
\hlstd{> }\hlstd{mod_ridge} \hlkwb{=} \hlkwd{train}\hlstd{(trainy}\hlopt{~}\hlstd{.,} \hlkwc{method}\hlstd{=}\hlstr{"glmnet"}\hlstd{,}
\hlstd{+ }          \hlkwc{tuneGrid} \hlstd{=} \hlkwd{expand.grid}\hlstd{(}\hlkwc{alpha}\hlstd{=}\hlnum{1}\hlstd{,}
\hlstd{+ }               \hlkwc{lambda} \hlstd{=} \hlkwd{seq}\hlstd{(}\hlnum{0}\hlstd{,}\hlnum{3}\hlstd{,}\hlnum{0.01}\hlstd{)),}
\hlstd{+ }          \hlkwc{data} \hlstd{= train_data,}
\hlstd{+ }          \hlkwc{preProcess} \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"center"}\hlstd{),}
\hlstd{+ }          \hlkwc{trControl} \hlstd{=} \hlkwd{trainControl}\hlstd{(}\hlkwc{method} \hlstd{=} \hlstr{"cv"}\hlstd{,}
\hlstd{+ }                                   \hlkwc{number} \hlstd{=} \hlnum{2}\hlstd{,}
\hlstd{+ }                                   \hlkwc{search} \hlstd{=} \hlstr{"grid"}\hlstd{))}
\hlstd{> }
\hlstd{> }\hlcom{# New best lambda of .94}
\hlstd{> }\hlstd{yhat} \hlkwb{=} \hlkwd{predict}\hlstd{(mod_ridge)}
\hlstd{> }
\hlstd{> }\hlkwd{qplot}\hlstd{(trainy, yhat,} \hlkwc{alpha}\hlstd{=}\hlkwd{I}\hlstd{(}\hlnum{0.25}\hlstd{))} \hlopt{+}
\hlstd{+ }     \hlkwd{xlab}\hlstd{(}\hlkwd{expression}\hlstd{(}\hlkwd{paste}\hlstd{(}\hlstr{"Training "}\hlstd{, y)))} \hlopt{+}
\hlstd{+ }     \hlkwd{ylab}\hlstd{(}\hlkwd{expression}\hlstd{(}\hlkwd{paste}\hlstd{(}\hlstr{"Ridge "}\hlstd{,} \hlkwd{hat}\hlstd{(y))))} \hlopt{+}
\hlstd{+ }     \hlkwd{theme_bw}\hlstd{()} \hlopt{+}
\hlstd{+ }     \hlkwd{theme}\hlstd{(}\hlkwc{axis.text} \hlstd{=} \hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{12}\hlstd{),}
\hlstd{+ }          \hlkwc{axis.title} \hlstd{=} \hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{14}\hlstd{))}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/RidgeNetML1-1} 
\end{knitrout}
\end{center}

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlstd{ridge_beta} \hlkwb{=} \hlkwd{coef}\hlstd{(mod_ridge}\hlopt{$}\hlstd{finalModel, mod_ridge}\hlopt{$}\hlstd{bestTune}\hlopt{$}\hlstd{lambda)}
\hlstd{> }
\hlstd{> }\hlkwd{qplot}\hlstd{(b, ridge_beta[}\hlopt{-}\hlnum{1}\hlstd{])} \hlopt{+}
\hlstd{+ }     \hlkwd{xlab}\hlstd{(}\hlkwd{expression}\hlstd{(}\hlkwd{paste}\hlstd{(}\hlstr{"True "}\hlstd{, beta)))} \hlopt{+}
\hlstd{+ }     \hlkwd{ylab}\hlstd{(}\hlkwd{expression}\hlstd{(}\hlkwd{paste}\hlstd{(}\hlstr{"Ridge "}\hlstd{, beta)))} \hlopt{+}
\hlstd{+ }     \hlkwd{theme_bw}\hlstd{()} \hlopt{+}
\hlstd{+ }     \hlkwd{theme}\hlstd{(}\hlkwc{axis.text} \hlstd{=} \hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{12}\hlstd{),}
\hlstd{+ }          \hlkwc{axis.title} \hlstd{=} \hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{14}\hlstd{))}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/Ridgenet2MLthing-1} 
\end{knitrout}
\end{center}

Our ridge regression shows less variability, our training set $y$ values and ridge predicted values are more tightly linear, and there is less variability in our comparative $\beta$ values in the plot above. This is interesting and is perhaps explained in the difference between the mathematical formula between Ridge and LASSO themselves (letting $\lambda$ control the amount of regulation in gradient descent):


\textbf{Ridge:} ($\alpha = 0$ )

\begin{equation}
\lambda \sum_{j=1}^{p} \left[ \frac{1}{2} (1- \alpha) \beta^2 \right]
\end{equation}

\textbf{LASSO:} ($\alpha = 1$ )

\begin{equation}
\lambda \sum_{j=1}^{p} (\alpha) | \beta_j |
\end{equation}

We seek a set of sparse solutions because we believe that many of our 100 $\beta_j$ parameters should be zero; a large enough $\lambda$ will set these exactly or near zero for us! We saw our LASSO $\lambda$ values become higher than our Ridge $\lambda$ values; this is because, unlike Ridge, our $\beta_{\lambda}^{\text{lass}}$ lasso values have no closed form – allowing more variance. A third potential option is to allow our alpha parameter vary between zero and one effectively using both of these penalties and giving us the elastic net (literally just adding LASSO and Ridge).


\textbf{Elastic Net:} ($0 < \alpha < 1$)

\begin{equation}
\lambda \sum_{j=1}^{p} \left[ \frac{1}{2} (1- \alpha) \beta^2 \right] + \lambda \sum_{j=1}^{p} (\alpha) | \beta_j |
\end{equation}



\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{## Elastic Net:}
\hlstd{> }\hlstd{mod_enet} \hlkwb{=} \hlkwd{train}\hlstd{(trainy}\hlopt{~}\hlstd{.,} \hlkwc{method} \hlstd{=} \hlstr{"glmnet"}\hlstd{,}
\hlstd{+ }            \hlkwc{tuneGrid} \hlstd{=} \hlkwd{expand.grid}\hlstd{(}\hlkwc{alpha} \hlstd{=} \hlkwd{seq}\hlstd{(}\hlnum{0}\hlstd{,} \hlnum{1}\hlstd{,} \hlnum{0.1}\hlstd{),}
\hlstd{+ }                                   \hlkwc{lambda} \hlstd{=} \hlkwd{seq}\hlstd{(}\hlnum{0}\hlstd{,} \hlnum{100}\hlstd{,} \hlnum{1}\hlstd{)),}
\hlstd{+ }            \hlkwc{data} \hlstd{= train_data,}
\hlstd{+ }            \hlkwc{preProcess} \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"center"}\hlstd{),}
\hlstd{+ }            \hlkwc{trControl} \hlstd{=} \hlkwd{trainControl}\hlstd{(}\hlkwc{method} \hlstd{=} \hlstr{"cv"}\hlstd{,}
\hlstd{+ }                                     \hlkwc{number} \hlstd{=} \hlnum{2}\hlstd{,}
\hlstd{+ }                                     \hlkwc{search} \hlstd{=} \hlstr{"grid"}\hlstd{))}
\hlstd{> }\hlcom{# alpha used was .9 and lambda ended up being 1.}
\end{alltt}
\end{kframe}
\end{knitrout}

This elastic net will give us similarly better results with a varying $\alpha$ along with it. However, these models work best for when we have data with many parameters, here we have only started with 100 (``only''). Let's ramp up the number of parameters (P) and really put these models to the test. I'll report the DGP in full.

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlstd{N} \hlkwb{<-} \hlnum{1000}
\hlstd{> }\hlstd{P} \hlkwb{<-} \hlnum{1500} \hlcom{# Note this change}
\hlstd{> }\hlstd{Sigma} \hlkwb{<-} \hlkwd{rWishart}\hlstd{(}\hlkwc{n}\hlstd{=}\hlnum{1}\hlstd{,} \hlkwc{df}\hlstd{=P,} \hlkwc{Sigma}\hlstd{=}\hlkwd{diag}\hlstd{(P))[,,}\hlnum{1}\hlstd{]}
\hlstd{> }\hlstd{X} \hlkwb{<-} \hlkwd{mvrnorm}\hlstd{(N,} \hlkwd{runif}\hlstd{(P,} \hlopt{-}\hlnum{10}\hlstd{,} \hlnum{10}\hlstd{), Sigma)}
\hlstd{> }\hlstd{p} \hlkwb{<-} \hlkwd{rbern}\hlstd{(P,} \hlnum{0.1}\hlstd{)}
\hlstd{> }\hlstd{b} \hlkwb{<-} \hlstd{p} \hlopt{*} \hlkwd{rnorm}\hlstd{(P,} \hlnum{5}\hlstd{,} \hlnum{5}\hlstd{)} \hlopt{+} \hlstd{(}\hlnum{1}\hlopt{-}\hlstd{p)} \hlopt{*} \hlkwd{rnorm}\hlstd{(P,} \hlnum{0}\hlstd{,} \hlnum{0.1}\hlstd{)}
\hlstd{> }\hlstd{e} \hlkwb{<-} \hlkwd{rnorm}\hlstd{(N,} \hlnum{0}\hlstd{,} \hlkwc{sd}\hlstd{=}\hlkwd{sqrt}\hlstd{(}\hlnum{10}\hlstd{))}
\hlstd{> }\hlstd{y} \hlkwb{=} \hlstd{X}\hlopt{%*%}\hlstd{b} \hlopt{+} \hlstd{e}
\hlstd{> }\hlstd{m1} \hlkwb{<-} \hlkwd{lm}\hlstd{(y}\hlopt{~}\hlstd{X)}
\hlstd{> }\hlstd{my_data} \hlkwb{=} \hlkwd{data.frame}\hlstd{(X,y)}
\end{alltt}
\end{kframe}
\end{knitrout}

With this DGP, let's see how our regular linear model holds up graphically:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{## Problematic:}
\hlstd{> }\hlkwd{qplot}\hlstd{(b,} \hlkwd{coef}\hlstd{(m1)[}\hlopt{-}\hlnum{1}\hlstd{],} \hlkwc{alpha}\hlstd{=}\hlkwd{I}\hlstd{(}\hlnum{0.25}\hlstd{))} \hlopt{+}
\hlstd{+ }     \hlkwd{xlab}\hlstd{(}\hlkwd{expression}\hlstd{(}\hlkwd{paste}\hlstd{(}\hlstr{"True "} \hlstd{, beta)))} \hlopt{+}
\hlstd{+ }     \hlkwd{ylab}\hlstd{(}\hlkwd{expression}\hlstd{(}\hlkwd{paste}\hlstd{(}\hlstr{"Model "} \hlstd{,} \hlkwd{hat}\hlstd{(beta),} \hlstr{" Values"}\hlstd{)))} \hlopt{+}
\hlstd{+ }     \hlkwd{theme_bw}\hlstd{()} \hlopt{+}
\hlstd{+ }     \hlkwd{theme}\hlstd{(}\hlkwc{axis.text} \hlstd{=} \hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{12}\hlstd{),}
\hlstd{+ }          \hlkwc{axis.title} \hlstd{=} \hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{14}\hlstd{))}
\end{alltt}


{\ttfamily\noindent\color{warningcolor}{\#\# Warning: Removed 501 rows containing missing values (geom\_point).}}\end{kframe}
\includegraphics[width=5in]{figure/lmoutputML2-1} 
\end{knitrout}

We see quite a bit of noise, also our results will be outrageously significant because we are not penalizing ourselves for multiple parameters unless we are using the AIC and BIC. Now let's see if the elastic net does any better given the larger number of parameters. We'll start by chopping up the data into a testing set and a training set. \index{Test Set Training Set}

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Test Set; Training Set (20% and 80% again)}
\hlstd{> }\hlstd{trainidx} \hlkwb{<-} \hlkwd{createDataPartition}\hlstd{(y,} \hlkwc{times} \hlstd{=} \hlnum{1}\hlstd{,} \hlkwc{p}\hlstd{=}\hlnum{.80}\hlstd{,} \hlkwc{list}\hlstd{=}\hlnum{FALSE}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{trainy} \hlkwb{<-} \hlstd{y[trainidx]}
\hlstd{> }\hlstd{testy}  \hlkwb{<-} \hlstd{y[}\hlopt{-}\hlstd{trainidx]}
\hlstd{> }\hlstd{trainx} \hlkwb{<-} \hlstd{X[trainidx,]}
\hlstd{> }\hlstd{testx}  \hlkwb{<-} \hlstd{X[}\hlopt{-}\hlstd{trainidx,]}
\hlstd{> }
\hlstd{> }\hlstd{train_data} \hlkwb{=} \hlkwd{data.frame}\hlstd{(trainx, trainy)}
\hlstd{> }\hlstd{test_data}  \hlkwb{=} \hlkwd{data.frame}\hlstd{(testx, testy)}
\hlstd{> }
\hlstd{> }\hlcom{# Training linear Model:}
\hlstd{> }\hlstd{trainmod} \hlkwb{<-} \hlkwd{lm}\hlstd{(train_data}\hlopt{$}\hlstd{trainy} \hlopt{~} \hlstd{trainx,} \hlkwc{data} \hlstd{= train_data)}
\end{alltt}
\end{kframe}
\end{knitrout}

Running the elastic net now looking for the best lambda.

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Using Penalized Regression Helps Conceptualize This:}
\hlstd{> }\hlcom{# Elastic Net:}
\hlstd{> }\hlstd{mod_enet} \hlkwb{=} \hlkwd{train}\hlstd{(trainy}\hlopt{~}\hlstd{.,} \hlkwc{method} \hlstd{=} \hlstr{"glmnet"}\hlstd{,}
\hlstd{+ }          \hlkwc{tuneGrid} \hlstd{=} \hlkwd{expand.grid}\hlstd{(}\hlkwc{alpha} \hlstd{=} \hlkwd{seq}\hlstd{(}\hlnum{0}\hlstd{,}\hlnum{1}\hlstd{,}\hlnum{0.1}\hlstd{),}
\hlstd{+ }                                \hlkwc{lambda} \hlstd{=} \hlkwd{seq}\hlstd{(}\hlnum{0}\hlstd{,}\hlnum{100}\hlstd{,}\hlnum{1}\hlstd{)),}
\hlstd{+ }          \hlkwc{data} \hlstd{= train_data,}
\hlstd{+ }          \hlkwc{preProcess} \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"center"}\hlstd{),}
\hlstd{+ }          \hlkwc{trControl} \hlstd{=} \hlkwd{trainControl}\hlstd{(}\hlkwc{method} \hlstd{=} \hlstr{"cv"}\hlstd{,}
\hlstd{+ }                                   \hlkwc{number} \hlstd{=} \hlnum{2}\hlstd{,}
\hlstd{+ }                                   \hlkwc{search} \hlstd{=} \hlstr{"grid"}\hlstd{))}
\hlstd{> }\hlcom{# alpha used was 1 and lambda ended up being 8.}
\hlstd{> }
\hlstd{> }\hlstd{mod_enet} \hlkwb{=} \hlkwd{train}\hlstd{(trainy}\hlopt{~}\hlstd{.,} \hlkwc{method} \hlstd{=} \hlstr{"glmnet"}\hlstd{,}
\hlstd{+ }          \hlkwc{tuneGrid}\hlstd{=}\hlkwd{expand.grid}\hlstd{(}\hlkwc{alpha} \hlstd{=} \hlkwd{seq}\hlstd{(}\hlnum{0.6}\hlstd{,}\hlnum{1}\hlstd{,}\hlnum{0.5}\hlstd{),} \hlcom{#narrowing}
\hlstd{+ }                              \hlkwc{lambda} \hlstd{=} \hlkwd{seq}\hlstd{(}\hlnum{0}\hlstd{,}\hlnum{10}\hlstd{,}\hlnum{0.5}\hlstd{)),}
\hlstd{+ }          \hlkwc{data} \hlstd{= train_data,}
\hlstd{+ }          \hlkwc{preProcess} \hlstd{=} \hlkwd{c}\hlstd{(}\hlstr{"center"}\hlstd{),}
\hlstd{+ }          \hlkwc{trControl} \hlstd{=} \hlkwd{trainControl}\hlstd{(}\hlkwc{method} \hlstd{=} \hlstr{"cv"}\hlstd{,}
\hlstd{+ }                                   \hlkwc{number} \hlstd{=} \hlnum{2}\hlstd{,}
\hlstd{+ }                                   \hlkwc{search} \hlstd{=} \hlstr{"grid"}\hlstd{))}
\hlstd{> }\hlcom{# alpha ended up at .6 and lambda at 10.}
\end{alltt}
\end{kframe}
\end{knitrout}

Great!

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlstd{enet_beta} \hlkwb{=} \hlkwd{coef}\hlstd{(mod_enet}\hlopt{$}\hlstd{finalModel, mod_enet}\hlopt{$}\hlstd{bestTune}\hlopt{$}\hlstd{lambda)}
\hlstd{> }\hlkwd{qplot}\hlstd{(b, enet_beta[}\hlopt{-}\hlnum{1}\hlstd{])} \hlopt{+}
\hlstd{+ }     \hlkwd{xlab}\hlstd{(} \hlkwd{expression}\hlstd{(}\hlkwd{paste}\hlstd{(}\hlstr{"True "}\hlstd{, beta)))} \hlopt{+}
\hlstd{+ }     \hlkwd{ylab}\hlstd{(} \hlkwd{expression}\hlstd{(}\hlkwd{paste}\hlstd{(}\hlstr{"Elastic Net "}\hlstd{, beta)))} \hlopt{+}
\hlstd{+ }     \hlkwd{theme_bw}\hlstd{()} \hlopt{+}
\hlstd{+ }     \hlkwd{theme}\hlstd{(}\hlkwc{axis.text} \hlstd{=} \hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{12}\hlstd{),}
\hlstd{+ }          \hlkwc{axis.title} \hlstd{=} \hlkwd{element_text}\hlstd{(}\hlkwc{size}\hlstd{=}\hlnum{14}\hlstd{))}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/plonewbetafromenetML2-1} 
\end{knitrout}

Setting up a standard linear model with more estimators than number of observations is a fundamental assumption violation; it over-inflates our coefficients and gives us essentially no error. This can be really misleading to readers, and similar to how one might penalize their general linear models utilizing AIC and BIC we can use the elastic net to show more variance in our estimates and report our $\lambda$ values which are much larger than before ($\lambda$ = 10). Penalized regression is the intellectually honest thing to do when you have a model with a large number of parameters, the elastic net in this case has showed some uncertainty in our estimates whereas the normal model inflated our certainty (reported an $R^2$ of 1).

\subsection{Support Vector Models, Regression Trees}

Support Vector Models (SVMs) can be used to analyze data with the least error given unsupervised machine learning. Many of these models require super computing, or a careful consideration of the data and the underlying calculus going on. Consider the following DGP: balanced data, split into a test set and training set. \index{DGP} \index{Test Set Training Set} \index{library() }

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Need a lot of packages for this:}
\hlstd{> }\hlstd{packages} \hlkwb{<-} \hlkwd{c}\hlstd{(}\hlstr{"caret"}\hlstd{,} \hlstr{"MASS"}\hlstd{,} \hlstr{"Rlab"}\hlstd{,} \hlstr{"boot"}\hlstd{,} \hlstr{"ggplot2"}\hlstd{,} \hlstr{"ggridges"}\hlstd{,} \hlstr{"dplyr"}\hlstd{)}
\hlstd{> }\hlkwd{invisible}\hlstd{(} \hlkwd{lapply}\hlstd{(packages, library,} \hlkwc{character.only} \hlstd{=} \hlnum{TRUE}\hlstd{))}
\hlstd{> }
\hlstd{> }\hlkwd{set.seed}\hlstd{(}\hlnum{12345}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{N} \hlkwb{<-} \hlnum{2000}
\hlstd{> }\hlstd{P} \hlkwb{<-} \hlnum{50} \hlcom{# P is cut down for computation time, (but could be much larger!)}
\hlstd{> }
\hlstd{> }\hlcom{## Ballanced DGP creation}
\hlstd{> }\hlstd{mu} \hlkwb{<-} \hlkwd{runif}\hlstd{(P,} \hlopt{-}\hlnum{1}\hlstd{,}\hlnum{1}\hlstd{)}
\hlstd{> }\hlstd{Sigma} \hlkwb{<-} \hlkwd{rWishart}\hlstd{(}\hlkwc{n}\hlstd{=}\hlnum{1}\hlstd{,} \hlkwc{df}\hlstd{=P,} \hlkwc{Sigma}\hlstd{=}\hlkwd{diag}\hlstd{(P))[,,}\hlnum{1}\hlstd{]}
\hlstd{> }\hlstd{Sigma} \hlkwb{<-} \hlkwd{ifelse}\hlstd{(}\hlkwd{row}\hlstd{(Sigma)} \hlopt{!=} \hlkwd{col}\hlstd{(Sigma),} \hlnum{0}\hlstd{, Sigma)}
\hlstd{> }\hlstd{X} \hlkwb{<-} \hlkwd{mvrnorm}\hlstd{(N,} \hlkwc{mu}\hlstd{=mu,} \hlkwc{Sigma} \hlstd{= Sigma)}
\hlstd{> }\hlstd{p} \hlkwb{<-} \hlkwd{rbern}\hlstd{(P,} \hlnum{1}\hlstd{)}
\hlstd{> }\hlstd{beta} \hlkwb{<-} \hlstd{p}\hlopt{*}\hlkwd{rnorm}\hlstd{(P,}\hlnum{1}\hlstd{,}\hlnum{0.9}\hlstd{)} \hlopt{+} \hlstd{(}\hlnum{1}\hlopt{-}\hlstd{p)}\hlopt{*}\hlkwd{rnorm}\hlstd{(P,}\hlnum{0}\hlstd{,}\hlnum{0.3}\hlstd{)}
\hlstd{> }\hlstd{eta} \hlkwb{<-} \hlstd{X}\hlopt{%*%}\hlstd{beta}
\hlstd{> }\hlstd{pi} \hlkwb{<-} \hlkwd{inv.logit}\hlstd{(eta)}
\hlstd{> }\hlstd{Y} \hlkwb{<-} \hlkwd{rbern}\hlstd{(N, pi)}
\hlstd{> }\hlstd{Y} \hlkwb{<-} \hlkwd{as.factor}\hlstd{(Y)}
\hlstd{> }\hlstd{data.1.Bal} \hlkwb{<-} \hlkwd{data.frame}\hlstd{(X, Y)}
\hlstd{> }
\hlstd{> }\hlcom{## Test/Training Sets}
\hlstd{> }\hlstd{test.data.1.Bal} \hlkwb{<-} \hlstd{data.1.Bal[}\hlnum{1}\hlopt{:}\hlnum{500}\hlstd{,]}
\hlstd{> }\hlstd{train.data.1.Bal} \hlkwb{<-} \hlstd{data.1.Bal[}\hlnum{501}\hlopt{:}\hlnum{2000}\hlstd{,]}
\end{alltt}
\end{kframe}
\end{knitrout}

With the help of a few handy packages that help users run SVM's; consider the following:

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(kernlab)}
\hlstd{> }\hlkwd{library}\hlstd{(microbenchmark)}
\hlstd{> }\hlcom{# Linear SVM}
\hlstd{> }\hlstd{linear.svm.bal} \hlkwb{<-} \hlkwd{train}\hlstd{(Y}\hlopt{~}\hlstd{.,}
\hlstd{+ }                       \hlkwc{data} \hlstd{= train.data.1.Bal,}
\hlstd{+ }                       \hlkwc{method} \hlstd{=} \hlstr{"svmLinear"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{linear.svm.bal}\hlopt{$}\hlstd{results}\hlopt{$}\hlstd{Accuracy}
\end{alltt}
\begin{verbatim}
## [1] 0.9677524
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# A polynomial kernal: (long computation!)}
\hlstd{> }\hlcom{# poly.svm.bal <- train(Y~.,}
\hlstd{> }\hlcom{#                      data = train.data.1.Bal,}
\hlstd{> }\hlcom{#                      method = "svmPoly")}
\hlstd{> }
\hlstd{> }\hlcom{# poly.svm.bal$results[as.numeric(rownames(poly.svm.bal$bestTune)),]}
\hlstd{> }\hlcom{# .951 Accuracy; .902 Kappa; AccuracySD of .011}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlcom{# Radial kernal:}
\hlstd{> }\hlcom{# radial.svm.bal = train(Y~.,}
\hlstd{> }\hlcom{#                        data = train.data.1.Bal,}
\hlstd{> }\hlcom{#                        method = "svmRadialCost")}
\hlstd{> }
\hlstd{> }\hlcom{# radial.svm.bal$results[as.numeric(rownames(radial.svm.bal$bestTune)),]}
\hlstd{> }\hlcom{# Accuracy of .54; AccuracySD .017}
\end{alltt}
\end{kframe}
\end{knitrout}

Dangerously simple, this is how an SVM is ran, and could be ran given the need for a polynomial or radial kernel. The microbenchmark package is included above for any timing related concerns conducting research with more advanced kernels.

So what's going on exactly? Well, an SVM classifies data “better” by calculating the distances between points and a line (or plane) drawn through the data. The minimal errors between these points and the plane generates more reliable classification models. This is different from a standard regression least-squared-errors approach because this uses Euclidean distance, which is different from a vertically measured residual (commonly seen in linear models). Beyond this, we can specify various kernels to attempt to classify our data throughout various dimensions -- something the standard linear model would struggle to accomplish. Overall our data seem to classify about the same as the elastic net for balanced data.

Another option, however, is to use classification trees for visualization and confirmation of results paired with other machine learning techniques. Below is code to accomplish this if you so choose:


\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Using "rpart", may need to reload R to get things to work.}
\hlstd{> }\hlkwd{library}\hlstd{(rpart)}
\hlstd{> }\hlcom{# grow tree with same DGP as above.}
\hlstd{> }\hlstd{tree.bal} \hlkwb{<-} \hlkwd{rpart}\hlstd{(Y}\hlopt{~}\hlstd{.,}
\hlstd{+ }                  \hlkwc{method} \hlstd{=} \hlstr{"class"}\hlstd{,}
\hlstd{+ }                  \hlkwc{data} \hlstd{= train.data.1.Bal)}
\hlstd{> }\hlcom{## other options include:}
\hlstd{> }\hlcom{# printcp(tree.bal) # display the results}
\hlstd{> }\hlcom{# plotcp(tree.bal)  # visualize cross-validation results}
\hlstd{> }\hlcom{# summary(tree.bal) # detailed summary of splits}
\hlstd{> }
\hlstd{> }\hlcom{# plot tree}
\hlstd{> }\hlkwd{plot}\hlstd{(tree.bal,} \hlkwc{uniform} \hlstd{=} \hlnum{TRUE}\hlstd{,}
\hlstd{+ }     \hlkwc{main} \hlstd{=} \hlstr{"Classification Tree for Ballanced Data"}\hlstd{)}
\hlstd{> }\hlkwd{text}\hlstd{(tree.bal,} \hlkwc{use.n} \hlstd{=} \hlnum{TRUE}\hlstd{,} \hlkwc{all} \hlstd{=} \hlnum{TRUE}\hlstd{,} \hlkwc{cex} \hlstd{=} \hlnum{.8}\hlstd{)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/treesML1-1} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{# then we have a lot of options off of this, including pruning the tree back,}
\hlstd{> }\hlcom{# or making -multiple- trees into a "forest" and}
\hlstd{> }\hlcom{# selecting the best one! (intutively a form of advanced bootstrapping!)}
\hlstd{> }\hlcom{# prune the tree, by the error that was previously generated above}
\hlstd{> }
\hlstd{> }\hlcom{# prune function:}
\hlstd{> }\hlstd{ptree.bal} \hlkwb{<-} \hlkwd{prune}\hlstd{(tree.bal,}
\hlstd{+ }                   \hlkwc{cp}\hlstd{=tree.bal}\hlopt{$}\hlstd{cptable[}\hlkwd{which.min}\hlstd{(tree.bal}\hlopt{$}\hlstd{cptable[,}\hlstr{"xerror"}\hlstd{]),}
\hlstd{+ }                                       \hlstr{"CP"}\hlstd{])}
\hlstd{> }\hlcom{# plot the pruned tree}
\hlstd{> }\hlkwd{plot}\hlstd{(ptree.bal,} \hlkwc{uniform} \hlstd{=} \hlnum{TRUE}\hlstd{,}
\hlstd{+ }     \hlkwc{main} \hlstd{=}\hlstr{"Pruned Classification Tree for Ballanced Data"}\hlstd{)}
\hlstd{> }\hlkwd{text}\hlstd{(ptree.bal,} \hlkwc{use.n} \hlstd{=} \hlnum{TRUE}\hlstd{,} \hlkwc{all} \hlstd{=} \hlnum{TRUE}\hlstd{,} \hlkwc{cex} \hlstd{=} \hlnum{.8}\hlstd{)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/treesML1-2} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{# can make a postscript chart (good for publishing) using post():}
\hlstd{> }\hlcom{# post(ptree.bal,}
\hlstd{> }\hlcom{#     title = "Pruned Classification Tree for Ballanced Data")}
\end{alltt}
\end{kframe}
\end{knitrout}

Overall, regression trees (here they are classification trees) can be used to see which predictors lead our classifications, and similar to how elastic nets will bring some predictors to zero; we can then ``prune'' these observations and vizualize this process better. In poorly predictive data, this will become well pruned to only a few key observations. Reporting these over other methods may be more intuitive for readers and reviewers!

Those familiar to machine learning will note the similarity between these models to principle components analysis (PCA) -- because it is very close.


\subsection{K Nearest Neighbors, Nearest Means}


%--------------------------------------
\clearpage
\section{Time Series}

The careful analysis of data over time is classified as ``time series'' analysis. Data projections, forecasting, historical analysis, and trend analysis all describe timeseries science. Much of this section on timeseries comes from a course and associated text from the course I took.\footnote{Box-Steffensmeier, Janet M., John R. Freeman, Matthew P. Hitt, and Jon CW Pevehouse. Time series analysis for the social sciences. \textit{Cambridge University Press}, 2014.} I would highly recommend this text if a reader is serious about learning timeseries analysis, sections of the book will be referenced in this section of the document.

\subsection{Data Concerns}
\index{Data Vintaging} \index{VAR}
Time series does not rid itself of serious data concerns, and actually new data concerns arise with time series data. First, one should be aware of ``data vintaging'': or where data is not finalized and there is some recency bias in reporting. For example, government data or live polling data may not be finalized or the process of collecting data is not complete. Older data is less controversial (usually!) but recent data can be more debatable. Robertson and Tallman have a 1998 Economic Review article discussing this in more detail. The lesson to learn here is that careful data collection, and taking the proper amount of time to truly understand the underlying data generation process of that data is important before beginning time series analysis.

Another potential concern to take seriously is systematic sampling and temporal aggregation. This is where regular interval (systematic sampling) occurs but not for the entire series. Naively a researcher may aggregate across the cross-sections but further problems arise if the reason why the data is missing relates to the variables in the data (think back SUTVA in the first chapter). For example, government data missing a few years around a particular scandal or tragedy. Further, we might consider what the natural time-unit of data really is in the first place. What is the naturally occurring time of a vote, of opinions, or of healthcare? Is a vaccine or survey best distributed by the year or by the month? This largely depends on the research question and we may not always have the ability to best measure our natural time scale. This creating noise or missing shocks where they may actually exist. \index{systematic sampling} \index{SUTVA}

Finally, less of a data concern but rather a justification of the methods to follow when one might consider just adding a lagged time variable within a regression model. Doing this does not solve exogenous problems (there's a Journal of Politics article related to this) and we will just end up with an extra function that calculates the bias from aggregation. Further, if there are multiple frequencies, we could instead just measure those with a variation of the VAR (upcoming section). Adding time into a regular regression is very restrictive when we could use a VAR to pick up lag lengths or a simultaneous regression model built for such variables.

When preparing your data for analysis considering the above and take steps to make sure the data has a proper sampling methodology, includes a systemic time point in which measures were taken, the data is accurately defined the same throughout the series, and take concern for other common data concerns pre-modeling (see chapter 1).

\subsection{Differencing Equations and Operators}

Much like mothers all around the world demanding their children eat vegetables, methodologists too have stressed the importance of learning differencing equations for time series analysis.

Much like functions in R, or mathematical operators, differencing equations too could be called a usages of various operators. For simplicity I will start by calling them differencing operators or a variant of the ``backshift operators.'' These are functions in the same way that $f(x)$ is a function being applied to $x$. Instead, with the differencing operators ($\Delta$) we mean, simply, $(1-B)$ where B is just a lag operator (or the backshift operator). The ``difference'' synonym comes from the subtraction of $1-B$.

For clarity, these two are equivalent:

\begin{equation}
\Delta (.5^t) = .5^t - .5^{t-1}
\end{equation}

And the backshift operator acts simply:
\begin{equation}
B(.5^t) = .5^{t-1}
\end{equation}

And the square of this function works similarly:

\begin{equation}
\Delta^2 y(t) = (1-B)^2 y(t) = (1-2B + B^2) y(t) = y(t) - 2y(t-1) + y(t-2).
\end{equation}

Or with $.5^t$ as $y(t)$ we have:

\begin{equation}
\Delta^2(.5^t) = .5^t - 2(.5^{t-1}) +.5^{t-2} = .5^t
\end{equation}

Finally, we have a third operator to help us and that is the ``expectations'' or ``lead'' operator (E). Which brings our variable forward a time period.

\begin{equation}
Ey(t) = y(t+1)
\end{equation}

Difference equations, then, are the integrate combination of these operators to produce particular equalities. Standard regression models often do not consider these nuances, but the study of difference equations helps us understand the dynamics that are implicit in our time series related equations.

\index{White Noise}
To show this in greater detail (and far less math), let's just start with a white noise model in R. A white noise (WN) model is a basic time series model, and it's sort of the basis of most models time series analysts consider. White noise is defined as a completely random predictive trend, typically centered around a static mean line. In the example below, we'll use a base-R ARIMA (or ``autoregressive integrated moving average) simulation and plot for timeseries classed data. ARIMAs and the generation of timeseries data will be discussed further in a following section in this chapter. For now, let's just visualize a WN model which has one hundred observations and is independent and identically distributed (iid). \index{iid} \index{ARIMA}

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Stats package loaded by default base-R}
\hlstd{> }\hlstd{white_noise} \hlkwb{<-} \hlkwd{arima.sim}\hlstd{(}\hlkwc{model} \hlstd{=} \hlkwd{list}\hlstd{(}\hlkwc{order} \hlstd{=} \hlkwd{c}\hlstd{(}\hlnum{0}\hlstd{,} \hlnum{0}\hlstd{,} \hlnum{0}\hlstd{)),} \hlkwc{n} \hlstd{=} \hlnum{100}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlkwd{ts.plot}\hlstd{(white_noise)}
\end{alltt}
\end{kframe}
\includegraphics[width=\maxwidth,height=0.5\textheight]{figure/WN_Start-1} 
\end{knitrout}
\end{center}

Next, let us talk about the random walk (RW) model - another basic time series model. It is a cumulative sum (or integration) of a mean zero white noise (WN) series. In other words, if we took the first difference of RW series we would end with a WN series. To simulate this model, we need to change the ARIMA model specification to adjust the integration argument from zero to one. This happens to be the middle ordered command in the model argument (shown below). For this series I will also show that we can adjust the standard deviation for the series. Adjusting the mean of the series adds ``drift'' or a intercept to the RW model, which corresponds to the slope of the RW time trend. \index{Random Walk}

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Stats package loaded by default base-R}
\hlstd{> }\hlstd{random_walk} \hlkwb{<-} \hlkwd{arima.sim}\hlstd{(}\hlkwc{model} \hlstd{=} \hlkwd{list}\hlstd{(}\hlkwc{order} \hlstd{=} \hlkwd{c}\hlstd{(}\hlnum{0}\hlstd{,} \hlnum{1}\hlstd{,} \hlnum{0}\hlstd{)),} \hlkwc{n} \hlstd{=} \hlnum{100}\hlstd{,} \hlkwc{sd} \hlstd{=} \hlnum{10}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlkwd{ts.plot}\hlstd{(random_walk)}
\end{alltt}
\end{kframe}
\includegraphics[width=\maxwidth,height=0.5\textheight]{figure/RW_Start-1} 
\end{knitrout}
\end{center}

Now, let's take the same model and difference it in R, showing us its underlying WN model series.

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlstd{random_walk} \hlkwb{<-} \hlkwd{arima.sim}\hlstd{(}\hlkwc{model} \hlstd{=} \hlkwd{list}\hlstd{(}\hlkwc{order} \hlstd{=} \hlkwd{c}\hlstd{(}\hlnum{0}\hlstd{,} \hlnum{1}\hlstd{,} \hlnum{0}\hlstd{)),} \hlkwc{n} \hlstd{=} \hlnum{100}\hlstd{,} \hlkwc{sd} \hlstd{=} \hlnum{10}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{random_walk_diff} \hlkwb{<-} \hlkwd{diff}\hlstd{(random_walk)}
\hlstd{> }
\hlstd{> }\hlkwd{ts.plot}\hlstd{(random_walk_diff)}
\end{alltt}
\end{kframe}
\includegraphics[width=\maxwidth,height=0.5\textheight]{figure/RW_Diffed-1} 
\end{knitrout}
\end{center}

How we could use both of these models is widely varied, but let's generate a time series $y$ and suppose it is something we are interested in. We can fit a random walk model with a drift (for example) by first differencing the data, fitting the resulting WN model to the differenced data using the ARIMA function in R with the right order arguments (all zeros for WN). This ARIMA command in R will then output model information that can be interpreted for our given series $y$ (in this example a RW with a drift). Under coefficients there is the estimated drift variable (Intercept). Its approximate standared error is provided directly below it and the variance of the WN part of the model is also estimated under the label $\sigma^2$!

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# RW data with a drift (y) to fit WN model to:}
\hlstd{> }\hlstd{random_walk} \hlkwb{<-} \hlkwd{arima.sim}\hlstd{(}\hlkwc{model} \hlstd{=} \hlkwd{list}\hlstd{(}\hlkwc{order} \hlstd{=} \hlkwd{c}\hlstd{(}\hlnum{0}\hlstd{,} \hlnum{1}\hlstd{,} \hlnum{0}\hlstd{)),}
\hlstd{+ }                         \hlkwc{n} \hlstd{=} \hlnum{100}\hlstd{,} \hlkwc{sd} \hlstd{=} \hlnum{10}\hlstd{,} \hlkwc{mean} \hlstd{=} \hlnum{5}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlcom{# Create white noise from our data:}
\hlstd{> }\hlstd{rw_diff} \hlkwb{<-} \hlkwd{diff}\hlstd{(random_walk)}
\hlstd{> }
\hlstd{> }\hlcom{# ARIMA model the differenced data with the same white noise process:}
\hlstd{> }\hlstd{model_wn} \hlkwb{<-} \hlkwd{arima}\hlstd{(rw_diff,} \hlkwc{order} \hlstd{=} \hlkwd{c}\hlstd{(}\hlnum{0}\hlstd{,} \hlnum{0}\hlstd{,} \hlnum{0}\hlstd{))}
\hlstd{> }
\hlstd{> }\hlcom{# let's grab our intercept and plot:}
\hlstd{> }\hlstd{int_wn} \hlkwb{<-} \hlstd{model_wn}\hlopt{$}\hlstd{coef} \hlcom{# get intercept from model results}
\hlstd{> }\hlkwd{ts.plot}\hlstd{(random_walk)}    \hlcom{# plot original data}
\hlstd{> }\hlkwd{abline}\hlstd{(}\hlnum{0}\hlstd{, int_wn,}       \hlcom{# display model estimate onto graph}
\hlstd{+ }       \hlkwc{col} \hlstd{=} \hlstr{"darkred"}\hlstd{,} \hlkwc{lty} \hlstd{=} \hlnum{2}\hlstd{)}
\end{alltt}
\end{kframe}
\includegraphics[width=\maxwidth,height=0.5\textheight]{figure/RW_WN_ARIMA-1} 
\end{knitrout}
\end{center}

You can imaging modeling out a random walk process where the data is entirely simulated and comparing model output from a white noise process to your real data - displaying that your data does not behave randomly but has some sort of systemic process or ``something else going on'' that cannot be explained with randomness like the simulated data may be.


\subsection{Identifying AR;MA - ACF, PACF}


\subsection{Unit Roots}


\subsection{ARIMA}


\subsection{VAR}

\subsubsection{Example VAR}



\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}
\includegraphics[width=6in,height=3.7in]{figure/desc-1} 
\end{knitrout}
\end{center}

Using ANES data\footnote{American National Election Survey, due to size this could not be uploaded to GitHub. While this information is readily available online I think it required academic licensing and authorization. Feel free to reach out to me for this (now old) data if interested in replication.}, we see some survey changes over time on how we measured religious attendance. To narrow down, I will be analyzing only those respondents that reported weekly attendance. Further, I will be looking at those who reported being ``strongly liberal'' (conservative) including leaning liberal (conservative). Since the latter question was only asked from 1972 on, I will subset the weekly church attendance from 1972 to 2012. This has an unexpected benefit of removing the 1970 survey change on weekly church attendance.

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}
\includegraphics[width=6in,height=4in]{figure/descriptiveplot-1} 
\end{knitrout}
\end{center}

Using this data, I wish to formally test that the two series are not Granger-causal of one another and that the two trends are not deterministic of the other. It is my hypothesis that the two series do not rely on one another, but larger economic and sociopolitical influences are at play. Following testing this hypothesis, I will end this assignment discussing future directions.\\

\noindent \textbf{Testing for Optimal Lag Order for VAR}

Before I begin testing for optimal lag length for the model, I test for the presence of unit roots. The following chunk of R code goes through setting up the data and conducting unit root tests. It reveals that in every unit root test I conduct, there is evidence against the presence of unit roots and nonstationarity.\footnote{In setting up the time series in R, I had to set the end date back, to get the right frequency to line up with skipped year surveys. Regardless, all data is still present, the year index label for 2012 is, however, masked. This should not change any results, I checked the plots between the full ANES dat and the time series object reported here for any discrepencies, finding none.}

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlstd{libweekTS} \hlkwb{<-} \hlkwd{ts}\hlstd{(}\hlkwc{data} \hlstd{= libweek[,}\hlnum{2}\hlstd{],}
\hlstd{+ }                \hlkwc{start} \hlstd{=} \hlkwd{head}\hlstd{(year,} \hlkwc{n} \hlstd{=} \hlnum{1}\hlstd{),}
\hlstd{+ }                \hlkwc{end} \hlstd{=} \hlnum{2008}\hlstd{,} \hlcom{# 2008 end here because ANES aregular surveys}
\hlstd{+ }                \hlkwc{frequency} \hlstd{=} \hlnum{.5}\hlstd{)}
\hlstd{> }\hlcom{# plot(libweekTS) # Checking}
\hlstd{> }
\hlstd{> }\hlstd{consweekTS} \hlkwb{<-} \hlkwd{ts}\hlstd{(}\hlkwc{data} \hlstd{= consweek[,}\hlnum{2}\hlstd{],}
\hlstd{+ }                \hlkwc{start} \hlstd{=} \hlkwd{head}\hlstd{(year,} \hlkwc{n} \hlstd{=} \hlnum{1}\hlstd{),}
\hlstd{+ }                \hlkwc{end} \hlstd{=} \hlnum{2008}\hlstd{,}
\hlstd{+ }                \hlkwc{frequency} \hlstd{=} \hlnum{.5}\hlstd{)}
\hlstd{> }\hlcom{# plot(consweekTS) # Checking}
\hlstd{> }
\hlstd{> }\hlcom{## Unit root testing:}
\hlstd{> }\hlkwd{library}\hlstd{(tseries)}
\hlstd{> } \hlkwd{adf.test}\hlstd{(libweekTS)}
\hlstd{> } \hlkwd{adf.test}\hlstd{(consweekTS)}
\hlstd{> }\hlcom{# Reject the null of non - stationarity and a unit root}
\hlstd{> }
\hlstd{> } \hlkwd{kpss.test}\hlstd{(libweekTS)}
\hlstd{> } \hlkwd{kpss.test}\hlstd{(consweekTS)}
\hlstd{> }\hlcom{# Reject the null of stationarity around a deterministic trend}
\hlstd{> }
\hlstd{> } \hlkwd{PP.test}\hlstd{(libweekTS)}
\hlstd{> } \hlkwd{PP.test}\hlstd{(consweekTS)}
\hlstd{> }\hlcom{# Reject the null that the series is integrated of order 1 (unit root)}
\end{alltt}
\end{kframe}
\end{knitrout}

Following these tests I feel confident that there are no unit roots. Moving to testing the lag-order of the model is realitively easy to do in R, and give us the lag order based upon different information criteria such as the AIC, HQ, SC, and FPE. Results of these tests all indicate best lag-length of four. \index{Augmented Dicky Fuller} \index{KPSS Test}

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Ideal lag order:}
\hlstd{> }\hlstd{varData} \hlkwb{<-} \hlkwd{data.frame}\hlstd{(libweekTS, consweekTS)}
\hlstd{> }
\hlstd{> }\hlkwd{library}\hlstd{(vars)}
\hlstd{> }
\hlstd{> }\hlstd{lagselection} \hlkwb{<-} \hlkwd{VARselect}\hlstd{(varData,} \hlkwc{lag.max} \hlstd{=} \hlnum{10}\hlstd{,} \hlkwc{type} \hlstd{=} \hlstr{"none"}\hlstd{)}
\hlstd{> }\hlstd{lagselection}\hlopt{$}\hlstd{selection}
\end{alltt}
\begin{verbatim}
## AIC(n)  HQ(n)  SC(n) FPE(n) 
##      4      4      4      4
\end{verbatim}
\end{kframe}
\end{knitrout}

\textbf{Granger--Causality Test} \index{Granger Causality}

A time series is said to be Granger-causal to an outcome if it (through lagged values) can provide statistically significant information about the outcome. This relationship is based upon two requirements: the cause happens prior to its effect (lagged values), and the cause provides unique information about the future values of its effect. These assumptions are in some-way built into nearly every cause inference test. \index{Vector Auto Regression}

More specifically, a variable $X$ is Granger-causal to some $Y$ if the prediction of $Y_t$ based upon all of its past lagged values $(Y_{t-1}, Y_{t-2}, ...)$ and on lagged values of $X$ does better than just $Y$ based solely on it's past values alone. Put another way, Granger-causality compares two predictive models (``worlds''), one where $X$ exists or where $Y$ is soley predictive upon itself. If the model which includes $X$ does better than the $Y$ being predictive of itself, $X$ is said to be Granger-causal of $Y$.

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlstd{var1} \hlkwb{<-} \hlkwd{VAR}\hlstd{(varData,} \hlkwc{p}\hlstd{=}\hlnum{4}\hlstd{,} \hlkwc{type}\hlstd{=}\hlstr{"const"}\hlstd{)} \hlcom{# Indicating lag length 4 here.}
\hlstd{> } \hlcom{# summary(var1) VAR results, including a 4-lag model results.}
\hlstd{> } \hlcom{# plot(var1) # can easily check ACF and PACF here}
\hlstd{> }
\hlstd{> } \hlstd{granger1} \hlkwb{<-} \hlkwd{causality}\hlstd{(var1,} \hlkwc{cause}\hlstd{=}\hlstr{"consweekTS"}\hlstd{)}
\hlstd{> } \hlstd{granger1}\hlopt{$}\hlstd{Granger}\hlopt{$}\hlstd{method}
\end{alltt}
\begin{verbatim}
## [1] "Granger causality H0: consweekTS do not Granger-cause libweekTS"
\end{verbatim}
\begin{alltt}
\hlstd{> } \hlstd{granger1}\hlopt{$}\hlstd{Granger}\hlopt{$}\hlstd{p.value}
\end{alltt}
\begin{verbatim}
##           [,1]
## [1,] 0.3452188
\end{verbatim}
\begin{alltt}
\hlstd{> } \hlstd{granger2} \hlkwb{<-} \hlkwd{causality}\hlstd{(var1,} \hlkwc{cause}\hlstd{=}\hlstr{"libweekTS"}\hlstd{)}
\hlstd{> } \hlstd{granger2}\hlopt{$}\hlstd{Granger}\hlopt{$}\hlstd{method}
\end{alltt}
\begin{verbatim}
## [1] "Granger causality H0: libweekTS do not Granger-cause consweekTS"
\end{verbatim}
\begin{alltt}
\hlstd{> } \hlstd{granger2}\hlopt{$}\hlstd{Granger}\hlopt{$}\hlstd{p.value}
\end{alltt}
\begin{verbatim}
##           [,1]
## [1,] 0.9601701
\end{verbatim}
\end{kframe}
\end{knitrout}


This hypothesis test takes as the null that $X$ is not a Granger-cause of $Y$ , and as such, a p-value below some $\alpha$ level would lead one to reject the null hypothesis. These tests lead me to confirm that neither series is Granger-causal of the other. Placed back in theory, neither liberals nor conservatives follow each others trends in weekly church attendance -- indicating other sociological, political, or economic forces to be at play.

A sign-and-significance reading of the Granger causality results conclude that, with 12 degrees of freedom, neither variation of the Granger-causality test pass statistical significance to declare Granger-causality. The liberal timeseries onto the conservative series holds a p-value of .96, and the conservative series on the liberal holds a p-value of .34. Neither pass conventional .05 thresholds because the series better explains itself than other explains it with respect to the VAR with lag length four.\\

\noindent \textbf{Innovation Accounting} \index{Innovation Accounting}

Innovation accounting can tell us how a VAR model responds to individual and orthogonalized shocks to each of the variables. This necessitates an assumption that our variable orderings matter as these shocks transition through our structure. However, orthogonalizing the equation allows for us to see the marginal effects, if we didn't do this we would allow the variable to increase its ripples through the structure without controlling for confounds that could occur.

In this particular case I am not sure if the ordering of variables really matters much, I think respondents from  year-to-year don't really consider their parties past responses to church identification all that much. The figure below kind-of shows this, a moving around 0, insignificant on standard thresholds.

Finally we move to looking at the forecast error variance decomposition, which allows for examining the effect of a particular variable to the future forecast error variance of another variable. To examine this, see the plots below the innovation accounting. These reveal that not one particular variable is contributing to forecast uncertainty. It is notable, however, that the FEVD did detect some variance explained by liberal church attendance on liberal church attendance in the first two horizons.


\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Innovation accounting:}
\hlstd{> } \hlstd{irf1} \hlkwb{<-} \hlkwd{irf}\hlstd{(var1,} \hlkwc{impulse} \hlstd{=} \hlstr{"consweekTS"}\hlstd{,} \hlkwc{response} \hlstd{=} \hlstr{"libweekTS"}\hlstd{)}
\hlstd{> } \hlkwd{plot}\hlstd{(irf1)}
\end{alltt}
\end{kframe}
\includegraphics[width=\maxwidth,height=4.5in]{figure/inov-1} 
\begin{kframe}\begin{alltt}
\hlstd{> } \hlstd{irf2} \hlkwb{<-} \hlkwd{irf}\hlstd{(var1,} \hlkwc{impulse} \hlstd{=} \hlstr{"libweekTS"}\hlstd{,} \hlkwc{response} \hlstd{=} \hlstr{"consweekTS"}\hlstd{)}
\hlstd{> } \hlkwd{plot}\hlstd{(irf2)}
\end{alltt}
\end{kframe}
\includegraphics[width=\maxwidth,height=4.5in]{figure/inov-2} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{# Forecast Error Variance Decomposition}
\hlstd{> } \hlstd{fevd1} \hlkwb{<-} \hlkwd{fevd}\hlstd{(var1,} \hlkwc{n.ahead} \hlstd{=} \hlnum{5}\hlstd{)}
\hlstd{> } \hlkwd{plot}\hlstd{(fevd1)}
\end{alltt}
\end{kframe}
\includegraphics[width=\maxwidth,height=4.5in]{figure/inov-3} 
\end{knitrout}
\end{center}


\noindent \textbf{Summary, Concluding Thoughts}

Overall, the purpose of this assignment was to test the relationship between two series and report how they may relate or not. I chose to test a fundamental underlying assumption of the ``god gap'' literature, for if these two series did influence one-another then all past examinations would need to take in to account this. However I have found little evidence of this occurring. This makes sense, survey responses of one partisan on church attendance are likely not to consider the other partisan and their historical activites. Rather, I think larger socioeconomic, historical, and geographical variables matter more at moving partisans to church at different levels over time. VAR too can be used to study these variables in relation to the others.

While VAR allows for flexibility in helping determine the data generating process, proper treatment of the error term through lag-length detection, and easy transition to error correction models and OLS it is not without its disadvantages. If a series is nonstationary, statistical testing can become problematic. If the series is cointegrated differencing may not solve these problems. Finally, as I mentioned before, I think a lot of different variables influence the widening and contraction of the god gap, however including all of them for all of their past lags may easily overfit the model if proper precautions are not used.

%--------------------------------------
\clearpage
\section{Network Analysis}

Network analysis, broadly speaking, is just the analysis of the connection between nodes and the broader interconnections of a group of units. Nodes can be people, events, animals, anything really. Edges can be any measurable connection between nodes, be it frequency of community, survey responses, amount of eye contact - anything really.\\

This chapter on network analysis will show the fundamentals of executing network techniques in R, but will dodge a lot of the underlying math making up these methods. A lot of this code and practice has been from previous courses and tutoring I've participated in, so there may be references to this in the comments of the code in this chapter. \\

\subsection{Network Basics: Data}

In this section we'll cover just the basics of setting up network data and reading some of the general network statistics.

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Packages used:}
\hlstd{> }\hlkwd{library}\hlstd{(igraph)} \hlcom{# igraph is one of the more popular network analysis packages}
\hlstd{> }\hlkwd{library}\hlstd{(igraphdata)}
\hlstd{> }\hlcom{# use  View() (capital "V" to examine data when you get it.)}
\hlstd{> }
\hlstd{> }\hlcom{# There will be some randomness, we'll set a seed to keep things consistent:}
\hlstd{> }\hlkwd{set.seed}\hlstd{(}\hlnum{8675305}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlcom{# Manually entering Network Data/ viewing networks ----------------------------}
\hlstd{> }
\hlstd{> }\hlcom{# Entering Edge-List data manually (works fine for now).}
\hlstd{> }\hlcom{# ?graph()}
\hlstd{> }\hlstd{g1} \hlkwb{<-} \hlkwd{graph}\hlstd{(}\hlkwc{edges}\hlstd{=}\hlkwd{c}\hlstd{(}\hlnum{1}\hlstd{,}\hlnum{2}\hlstd{,}
\hlstd{+ }                    \hlnum{1}\hlstd{,}\hlnum{3}\hlstd{,}
\hlstd{+ }                    \hlnum{2}\hlstd{,}\hlnum{4}\hlstd{,}
\hlstd{+ }                    \hlnum{3}\hlstd{,}\hlnum{1}\hlstd{,}
\hlstd{+ }                    \hlnum{3}\hlstd{,}\hlnum{5}\hlstd{,}
\hlstd{+ }                    \hlnum{5}\hlstd{,}\hlnum{1}\hlstd{,}
\hlstd{+ }                    \hlnum{4}\hlstd{,}\hlnum{3}\hlstd{))}
\hlstd{> }\hlcom{# Let's view this:}
\hlstd{> }\hlstd{g1}
\end{alltt}
\begin{verbatim}
## IGRAPH 6b85ad1 D--- 5 7 -- 
## + edges from 6b85ad1:
## [1] 1->2 1->3 2->4 3->1 3->5 5->1 4->3
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# So, Directional network, 5 nodes, 7 edges.}
\hlstd{> }\hlcom{# Or more briefly:}
\hlstd{> }\hlkwd{summary}\hlstd{(g1)}
\end{alltt}
\begin{verbatim}
## IGRAPH 6b85ad1 D--- 5 7 --
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# Or using the default plot() function:}
\hlstd{> }\hlkwd{plot}\hlstd{(g1)}
\end{alltt}
\end{kframe}
\includegraphics[width=6in]{figure/Network_Basics-1} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{# Another Edge-List dataset with names instead of numbers:}
\hlstd{> }\hlstd{g2} \hlkwb{<-} \hlkwd{graph}\hlstd{(}\hlkwc{edges}\hlstd{=}\hlkwd{c}\hlstd{(}\hlstr{"Anand"}\hlstd{,}\hlstr{"Beth"}\hlstd{,}
\hlstd{+ }                    \hlstr{"Anand"}\hlstd{,}\hlstr{"Chris"}\hlstd{,}
\hlstd{+ }                    \hlstr{"Beth"}\hlstd{,}\hlstr{"Dieter"}\hlstd{,}
\hlstd{+ }                    \hlstr{"Chris"}\hlstd{,}\hlstr{"Sun"}\hlstd{,}
\hlstd{+ }                    \hlstr{"Chris"}\hlstd{,}\hlstr{"Ali"}\hlstd{,}
\hlstd{+ }                    \hlstr{"Beth"}\hlstd{,}\hlstr{"Ali"}\hlstd{,}
\hlstd{+ }                    \hlstr{"Ali"}\hlstd{,}\hlstr{"Sun"}\hlstd{,}
\hlstd{+ }                    \hlstr{"Sun"}\hlstd{,}\hlstr{"Beth"}\hlstd{,}
\hlstd{+ }                    \hlstr{"Fatima"}\hlstd{,}\hlstr{"Chris"}\hlstd{,}
\hlstd{+ }                    \hlstr{"Fatima"}\hlstd{,}\hlstr{"Sun"}\hlstd{),}
\hlstd{+ }            \hlkwc{directed}\hlstd{=}\hlnum{FALSE}\hlstd{)}
\hlstd{> }\hlcom{# Now we have no directionality on nodes.}
\hlstd{> }
\hlstd{> }\hlkwd{plot}\hlstd{(g2)}
\end{alltt}
\end{kframe}
\includegraphics[width=6in]{figure/Network_Basics-2} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlkwd{summary}\hlstd{(g2)} \hlcom{# Undirected, now named, 7 nodes, 10 edges.}
\end{alltt}
\begin{verbatim}
## IGRAPH 6b8c027 UN-- 7 10 -- 
## + attr: name (v/c)
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# We can use functions to visualize our data another way (beyond edge-list)}
\hlstd{> }\hlcom{# Adjacency-Matrix:}
\hlstd{> }
\hlstd{> }\hlstd{g1[]}
\end{alltt}
\begin{verbatim}
## 5 x 5 sparse Matrix of class "dgCMatrix"
##               
## [1,] . 1 1 . .
## [2,] . . . 1 .
## [3,] 1 . . . 1
## [4,] . . 1 . .
## [5,] 1 . . . .
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## 5 x 5 sparse Matrix of class "dgCMatrix"}
\hlstd{> }\hlcom{##}
\hlstd{> }\hlcom{## [1,] . 1 1 . .}
\hlstd{> }\hlcom{## [2,] . . . 1 .}
\hlstd{> }\hlcom{## [3,] 1 . . . 1}
\hlstd{> }\hlcom{## [4,] . . 1 . .}
\hlstd{> }\hlcom{## [5,] 1 . . . .}
\hlstd{> }
\hlstd{> }\hlkwd{get.adjacency}\hlstd{(g2)}
\end{alltt}
\begin{verbatim}
## 7 x 7 sparse Matrix of class "dgCMatrix"
##        Anand Beth Chris Dieter Sun Ali Fatima
## Anand      .    1     1      .   .   .      .
## Beth       1    .     .      1   1   1      .
## Chris      1    .     .      .   1   1      1
## Dieter     .    1     .      .   .   .      .
## Sun        .    1     1      .   .   1      1
## Ali        .    1     1      .   1   .      .
## Fatima     .    .     1      .   1   .      .
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## 7 x 7 sparse Matrix of class "dgCMatrix"}
\hlstd{> }\hlcom{##        Anand Beth Chris Dieter Sun Ali Fatima}
\hlstd{> }\hlcom{## Anand      .    1     1      .   .   .      .}
\hlstd{> }\hlcom{## Beth       1    .     .      1   1   1      .}
\hlstd{> }\hlcom{## Chris      1    .     .      .   1   1      1}
\hlstd{> }\hlcom{## Dieter     .    1     .      .   .   .      .}
\hlstd{> }\hlcom{## Sun        .    1     1      .   .   1      1}
\hlstd{> }\hlcom{## Ali        .    1     1      .   1   .      .}
\hlstd{> }\hlcom{## Fatima     .    .     1      .   1   .      .}
\hlstd{> }
\hlstd{> }\hlcom{# Similarly, we can vizualise the Edges:}
\hlstd{> }\hlkwd{E}\hlstd{(g1)}
\end{alltt}
\begin{verbatim}
## + 7/7 edges from 6b85ad1:
## [1] 1->2 1->3 2->4 3->1 3->5 5->1 4->3
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## + 7/7 edges from fd21364:}
\hlstd{> }\hlcom{## [1] 1->2 1->3 2->4 3->1 3->5 5->1 4->3}
\hlstd{> }\hlkwd{V}\hlstd{(g2)}
\end{alltt}
\begin{verbatim}
## + 7/7 vertices, named, from 6b8c027:
## [1] Anand  Beth   Chris  Dieter Sun    Ali    Fatima
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## + 7/7 vertices, named, from dd35840:}
\hlstd{> }\hlcom{## [1] Anand  Beth   Chris  Dieter Sun    Ali    Fatima}
\hlstd{> }
\hlstd{> }\hlcom{# We can also pull up variables from this object: like $name}
\hlstd{> }\hlkwd{V}\hlstd{(g2)}\hlopt{$}\hlstd{name}
\end{alltt}
\begin{verbatim}
## [1] "Anand"  "Beth"   "Chris"  "Dieter" "Sun"    "Ali"    "Fatima"
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## [1] "Anand"  "Beth"   "Chris"  "Dieter" "Sun"    "Ali"    "Fatima"}
\hlstd{> }
\hlstd{> }\hlcom{# So let's plug in more data on top of that:}
\hlstd{> }\hlkwd{V}\hlstd{(g2)}\hlopt{$}\hlstd{gender} \hlkwb{<-} \hlkwd{c}\hlstd{(}\hlstr{"M"}\hlstd{,}\hlstr{"F"}\hlstd{,}\hlstr{"M"}\hlstd{,}\hlstr{"M"}\hlstd{,}\hlstr{"F"}\hlstd{,}\hlstr{"M"}\hlstd{,}\hlstr{"F"}\hlstd{)}
\hlstd{> }\hlcom{# Here, we're assigning the gender for each vertex.}
\hlstd{> }
\hlstd{> }\hlcom{# Or we'll assign some arbitrary weights to the edges (notice the E(g2) now.)}
\hlstd{> }\hlkwd{E}\hlstd{(g2)}\hlopt{$}\hlstd{count} \hlkwb{<-} \hlkwd{rep}\hlstd{(}\hlnum{1}\hlopt{:}\hlnum{2}\hlstd{,}\hlnum{5}\hlstd{)}
\hlstd{> }\hlstd{g2} \hlkwb{<-} \hlkwd{set.vertex.attribute}\hlstd{(g2,} \hlstr{"age"}\hlstd{,} \hlkwc{value} \hlstd{=} \hlkwd{c}\hlstd{(}\hlnum{20}\hlstd{,}\hlnum{26}\hlstd{,}\hlnum{19}\hlstd{,}\hlnum{34}\hlstd{,}\hlnum{22}\hlstd{,}\hlnum{30}\hlstd{,}\hlnum{21}\hlstd{))}
\hlstd{> }\hlcom{# Because we want R to save this addition to the network, when using the}
\hlstd{> }\hlcom{# set.vertex.attribute() function, we have to assign this again}
\hlstd{> }
\hlstd{> }\hlcom{# With this new data added, let's summarize the graph:}
\hlstd{> }\hlkwd{summary}\hlstd{(g2)} \hlcom{# We see the new variables added, and how they are connected.}
\end{alltt}
\begin{verbatim}
## IGRAPH 6b8c027 UN-- 7 10 -- 
## + attr: name (v/c), gender (v/c), age (v/n), count (e/n)
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## Larger data ----------------------------------------------------------------}
\hlstd{> }
\hlstd{> }\hlcom{# A classical long-standing training dataset for Network Analysis has been}
\hlstd{> }\hlcom{#  Zachary's Karate Club, some researchers even today test methods on this data}
\hlstd{> }
\hlstd{> }\hlkwd{data}\hlstd{(}\hlstr{"karate"}\hlstd{)}
\hlstd{> }\hlkwd{summary}\hlstd{(karate)}
\end{alltt}
\begin{verbatim}
## IGRAPH 4b458a1 UNW- 34 78 -- Zachary's karate club network
## + attr: name (g/c), Citation (g/c), Author (g/c), Faction (v/n), name
## | (v/c), label (v/c), color (v/n), weight (e/n)
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# What does this summary output mean?}
\hlstd{> }\hlcom{#     - U means undirected (versus D for directed)}
\hlstd{> }\hlcom{# - N means that the graph is named}
\hlstd{> }\hlcom{# - W means weighted graph}
\hlstd{> }\hlcom{# - 34 is the number of nodes}
\hlstd{> }\hlcom{# - 78 is the number of edges}
\hlstd{> }\hlcom{# - Other information is various variable data and data types.}
\hlstd{> }
\hlstd{> }\hlkwd{plot}\hlstd{(karate)}
\end{alltt}
\end{kframe}
\includegraphics[width=6in]{figure/Network_Basics-3} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlkwd{vcount}\hlstd{(karate)} \hlcom{# Vertical (node) count}
\end{alltt}
\begin{verbatim}
## [1] 34
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# [1] 34}
\hlstd{> }\hlkwd{ecount}\hlstd{(karate)} \hlcom{# Edge count}
\end{alltt}
\begin{verbatim}
## [1] 78
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# [1] 78}
\hlstd{> }
\hlstd{> }\hlcom{# ?degree() # a summation of all edges linked to nodes.}
\hlstd{> }\hlcom{# or, (undirected) - 2E/N;  (directed) E/N}
\hlstd{> }\hlkwd{mean}\hlstd{(}\hlkwd{degree}\hlstd{(karate))} \hlcom{# Average network degree}
\end{alltt}
\begin{verbatim}
## [1] 4.588235
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# [1] 4.588235      # "on average" we have 4.5 connections in the karate club}
\hlstd{> }
\hlstd{> }\hlcom{# This is (usually) just: (Actual Connections/Potential Connections)}
\hlstd{> }\hlkwd{graph.density}\hlstd{(karate)} \hlcom{# Density}
\end{alltt}
\begin{verbatim}
## [1] 0.1390374
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# [1] 0.1390374    # This network is about 14% dense/100%}
\hlstd{> }
\hlstd{> }\hlcom{# Diameter gives you the longest distance and path:}
\hlstd{> }\hlcom{# ?diameter()}
\hlstd{> }\hlkwd{diameter}\hlstd{(karate)} \hlcom{# It's diameter}
\end{alltt}
\begin{verbatim}
## [1] 13
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# [1] 13    # The farthest nodes are 13 people apart.}
\hlstd{> }\hlkwd{get_diameter}\hlstd{(karate)} \hlcom{# Here we see the long-pathway}
\end{alltt}
\begin{verbatim}
## + 6/34 vertices, named, from 4b458a1:
## [1] Actor 16 John A   Actor 20 Mr Hi    Actor 6  Actor 17
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{farthest_vertices}\hlstd{(karate)} \hlcom{# Here we see the people that are the farthest apart.}
\end{alltt}
\begin{verbatim}
## $vertices
## + 2/34 vertices, named, from 4b458a1:
## [1] Actor 16 Actor 17
## 
## $distance
## [1] 13
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# Some graphical options:}
\hlstd{> }\hlkwd{plot}\hlstd{(karate,}
\hlstd{+ }     \hlkwc{edge.width} \hlstd{=} \hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight,}
\hlstd{+ }     \hlkwc{vertex.size} \hlstd{=} \hlkwd{degree}\hlstd{(karate)}\hlopt{*}\hlnum{1.5}\hlstd{,}
\hlstd{+ }     \hlkwc{edge.arrow.size} \hlstd{=} \hlnum{0.4}\hlstd{,}
\hlstd{+ }     \hlkwc{vertex.label.cex} \hlstd{=} \hlnum{0.7}\hlstd{)}
\end{alltt}
\end{kframe}
\includegraphics[width=6in]{figure/Network_Basics-4} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{# In this graph we have weighted edges based on our data, the nodes are bigger}
\hlstd{> }\hlcom{#   depending on their degree "importance"}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlcom{## Bipartide Networks: ---------------------------------------------------------}
\hlstd{> }\hlcom{# This is where you have the relationship between nodes be that they are}
\hlstd{> }\hlcom{#   connected to another party.}
\hlstd{> }\hlcom{#   (I published with X, and so did you, so we're connected)}
\hlstd{> }
\hlstd{> }\hlcom{# Seminar notes on this:}
\hlstd{> }\hlstd{mem} \hlkwb{<-} \hlkwd{matrix}\hlstd{(}\hlkwc{data} \hlstd{=} \hlkwd{c}\hlstd{(}\hlnum{1}\hlstd{,}\hlnum{1}\hlstd{,}\hlnum{1}\hlstd{,}\hlnum{1}\hlstd{,}\hlnum{0}\hlstd{,}
\hlstd{+ }                      \hlnum{0}\hlstd{,}\hlnum{1}\hlstd{,}\hlnum{1}\hlstd{,}\hlnum{0}\hlstd{,}\hlnum{0}\hlstd{,}
\hlstd{+ }                      \hlnum{0}\hlstd{,}\hlnum{0}\hlstd{,}\hlnum{0}\hlstd{,}\hlnum{1}\hlstd{,}\hlnum{1}\hlstd{),}
\hlstd{+ }              \hlkwc{nrow} \hlstd{=} \hlnum{3}\hlstd{,}
\hlstd{+ }              \hlkwc{byrow} \hlstd{=} \hlnum{TRUE}\hlstd{)}
\hlstd{> }\hlcom{# This is assigning the names first to the 3 rows, and then to the 5 columns}
\hlstd{> }\hlkwd{dimnames}\hlstd{(mem)} \hlkwb{<-} \hlkwd{list}\hlstd{(}\hlkwd{c}\hlstd{(}\hlstr{"Group1"}\hlstd{,}\hlstr{"Group2"}\hlstd{,}\hlstr{"Group3"}\hlstd{),}
\hlstd{+ }                      \hlkwd{c}\hlstd{(}\hlstr{"Y1"}\hlstd{,}\hlstr{"Y2"}\hlstd{,}\hlstr{"Y3"}\hlstd{,}\hlstr{"Y4"}\hlstd{,}\hlstr{"Y5"}\hlstd{))}
\hlstd{> }\hlstd{mem}
\end{alltt}
\begin{verbatim}
##        Y1 Y2 Y3 Y4 Y5
## Group1  1  1  1  1  0
## Group2  0  1  1  0  0
## Group3  0  0  0  1  1
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{##        Y1 Y2 Y3 Y4 Y5}
\hlstd{> }\hlcom{## Group1  1  1  1  1  0}
\hlstd{> }\hlcom{## Group2  0  1  1  0  0}
\hlstd{> }\hlcom{## Group3  0  0  0  1  1}
\hlstd{> }
\hlstd{> }\hlstd{bg} \hlkwb{<-} \hlkwd{graph.incidence}\hlstd{(mem)}
\hlstd{> }\hlstd{bg}  \hlcom{# We see the "B" there now, for Bipartide}
\end{alltt}
\begin{verbatim}
## IGRAPH 6b94f00 UN-B 8 8 -- 
## + attr: type (v/l), name (v/c)
## + edges from 6b94f00 (vertex names):
## [1] Group1--Y1 Group1--Y2 Group1--Y3 Group1--Y4 Group2--Y2 Group2--Y3
## [7] Group3--Y4 Group3--Y5
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## IGRAPH 6d6e710 UN-B 8 8 --}
\hlstd{> }\hlcom{## + attr: type (v/l), name (v/c)}
\hlstd{> }\hlcom{## + edges from 6d6e710 (vertex names):}
\hlstd{> }\hlcom{## [1] Group1--Y1 Group1--Y2 Group1--Y3 Group1--Y4 Group2--Y2 Group2--Y3}
\hlstd{> }\hlcom{## [7] Group3--Y4 Group3--Y5}
\hlstd{> }\hlkwd{plot}\hlstd{(bg)}
\end{alltt}
\end{kframe}
\includegraphics[width=6in]{figure/Network_Basics-5} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlstd{pr} \hlkwb{<-} \hlkwd{bipartite.projection}\hlstd{(bg)}
\hlstd{> }\hlstd{pr}
\end{alltt}
\begin{verbatim}
## $proj1
## IGRAPH 6b95da7 UNW- 3 2 -- 
## + attr: name (v/c), weight (e/n)
## + edges from 6b95da7 (vertex names):
## [1] Group1--Group2 Group1--Group3
## 
## $proj2
## IGRAPH 6b95da7 UNW- 5 7 -- 
## + attr: name (v/c), weight (e/n)
## + edges from 6b95da7 (vertex names):
## [1] Y1--Y2 Y1--Y3 Y1--Y4 Y2--Y3 Y2--Y4 Y3--Y4 Y4--Y5
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## $proj1}
\hlstd{> }\hlcom{## IGRAPH 749b7be UNW- 3 2 --}
\hlstd{> }\hlcom{## + attr: name (v/c), weight (e/n)}
\hlstd{> }\hlcom{## + edges from 749b7be (vertex names):}
\hlstd{> }\hlcom{## [1] Group1--Group2 Group1--Group3}
\hlstd{> }\hlcom{##}
\hlstd{> }\hlcom{## $proj2}
\hlstd{> }\hlcom{## IGRAPH fbde6d7 UNW- 5 7 --}
\hlstd{> }\hlcom{## + attr: name (v/c), weight (e/n)}
\hlstd{> }\hlcom{## + edges from fbde6d7 (vertex names):}
\hlstd{> }\hlcom{## [1] Y1--Y2 Y1--Y3 Y1--Y4 Y2--Y3 Y2--Y4 Y3--Y4 Y4--Y5}
\hlstd{> }\hlkwd{plot}\hlstd{(pr}\hlopt{$}\hlstd{proj1,} \hlkwc{edge.width} \hlstd{=} \hlkwd{E}\hlstd{(pr}\hlopt{$}\hlstd{proj1)}\hlopt{$}\hlstd{weight)}
\end{alltt}
\end{kframe}
\includegraphics[width=6in]{figure/Network_Basics-6} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlkwd{plot}\hlstd{(pr}\hlopt{$}\hlstd{proj2,} \hlkwc{edge.width} \hlstd{=} \hlkwd{E}\hlstd{(pr}\hlopt{$}\hlstd{proj2)}\hlopt{$}\hlstd{weight)}
\end{alltt}
\end{kframe}
\includegraphics[width=6in]{figure/Network_Basics-7} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlkwd{get.adjacency}\hlstd{(pr}\hlopt{$}\hlstd{proj1,} \hlkwc{sparse} \hlstd{=} \hlnum{FALSE}\hlstd{,} \hlkwc{attr} \hlstd{=} \hlstr{"weight"}\hlstd{)}
\end{alltt}
\begin{verbatim}
##        Group1 Group2 Group3
## Group1      0      2      1
## Group2      2      0      0
## Group3      1      0      0
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{##        Group1 Group2 Group3}
\hlstd{> }\hlcom{## Group1      0      2      1}
\hlstd{> }\hlcom{## Group2      2      0      0}
\hlstd{> }\hlcom{## Group3      1      0      0}
\hlstd{> }\hlkwd{get.adjacency}\hlstd{(pr}\hlopt{$}\hlstd{proj2,} \hlkwc{sparse} \hlstd{=} \hlnum{FALSE}\hlstd{,} \hlkwc{attr} \hlstd{=} \hlstr{"weight"}\hlstd{)}
\end{alltt}
\begin{verbatim}
##    Y1 Y2 Y3 Y4 Y5
## Y1  0  1  1  1  0
## Y2  1  0  2  1  0
## Y3  1  2  0  1  0
## Y4  1  1  1  0  1
## Y5  0  0  0  1  0
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{##    Y1 Y2 Y3 Y4 Y5}
\hlstd{> }\hlcom{## Y1  0  1  1  1  0}
\hlstd{> }\hlcom{## Y2  1  0  2  1  0}
\hlstd{> }\hlcom{## Y3  1  2  0  1  0}
\hlstd{> }\hlcom{## Y4  1  1  1  0  1}
\hlstd{> }\hlcom{## Y5  0  0  0  1  0}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlstd{aff1} \hlkwb{<-} \hlstd{mem} \hlopt{%*%} \hlkwd{t}\hlstd{(mem)}
\hlstd{> }\hlkwd{diag}\hlstd{(aff1)} \hlkwb{<-} \hlnum{0}
\hlstd{> }\hlcom{# the diagonal doesn't really have important information for these,}
\hlstd{> }\hlcom{#   as it's about self-affiliation. With this command,}
\hlstd{> }\hlcom{#   we change those values to 0.}
\hlstd{> }\hlstd{aff1}
\end{alltt}
\begin{verbatim}
##        Group1 Group2 Group3
## Group1      0      2      1
## Group2      2      0      0
## Group3      1      0      0
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{##        Group1 Group2 Group3}
\hlstd{> }\hlcom{## Group1      0      2      1}
\hlstd{> }\hlcom{## Group2      2      0      0}
\hlstd{> }\hlcom{## Group3      1      0      0}
\hlstd{> }\hlstd{aff2} \hlkwb{<-} \hlkwd{t}\hlstd{(mem)} \hlopt{%*%} \hlstd{mem}
\hlstd{> }\hlkwd{diag}\hlstd{(aff2)} \hlkwb{<-} \hlnum{0}
\hlstd{> }\hlstd{aff2}
\end{alltt}
\begin{verbatim}
##    Y1 Y2 Y3 Y4 Y5
## Y1  0  1  1  1  0
## Y2  1  0  2  1  0
## Y3  1  2  0  1  0
## Y4  1  1  1  0  1
## Y5  0  0  0  1  0
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{##    Y1 Y2 Y3 Y4 Y5}
\hlstd{> }\hlcom{## Y1  0  1  1  1  0}
\hlstd{> }\hlcom{## Y2  1  0  2  1  0}
\hlstd{> }\hlcom{## Y3  1  2  0  1  0}
\hlstd{> }\hlcom{## Y4  1  1  1  0  1}
\hlstd{> }\hlcom{## Y5  0  0  0  1  0}
\end{alltt}
\end{kframe}
\end{knitrout}
\end{center}

\subsection{Network Properties, Structural Equivalence, Roles, and Positions.}

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{set.seed}\hlstd{(}\hlnum{123}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlcom{# Let's try something fancy:}
\hlstd{> }\hlcom{# List all packages:}
\hlstd{> }\hlstd{packages} \hlkwb{<-} \hlkwd{c}\hlstd{(}\hlstr{"blockmodeling"}\hlstd{,} \hlstr{"gplots"}\hlstd{,} \hlstr{"igraph"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlcom{# Install all packages in one function:}
\hlstd{> }\hlcom{#   lapply(packages, install.packages, character.only = TRUE)}
\hlstd{> }
\hlstd{> }\hlcom{# Load all packages in one function:}
\hlstd{> }\hlkwd{invisible}\hlstd{(} \hlcom{# supressing out output which shows all packages.}
\hlstd{+ }\hlkwd{lapply}\hlstd{(packages, library,} \hlkwc{character.only} \hlstd{=} \hlnum{TRUE}\hlstd{)}
\hlstd{+ }\hlstd{)}
\end{alltt}


{\ttfamily\noindent\bfseries\color{errorcolor}{\#\# Error in FUN(X[[i]], ...): there is no package called 'blockmodeling'}}\begin{alltt}
\hlstd{> }\hlcom{#  lapply(object, function, ...)  # For "list" apply... nifty tool!}
\hlstd{> }
\hlstd{> }\hlcom{# swi <- read.csv("swn.csv", header = TRUE, row.names = 1)}
\hlstd{> }\hlcom{# header = TRUE uses the first row as the column names;}
\hlstd{> }\hlcom{#  row.names = 1 uses the first column as the row names}
\hlstd{> }\hlcom{#    (if we put row.names = 2, it would use the second column, etc.)}
\hlstd{> }
\hlstd{> }\hlcom{# https://networkdata.ics.uci.edu/netdata/html/davis.html}
\hlstd{> }
\hlstd{> }\hlstd{data} \hlkwb{<-} \hlstd{readr}\hlopt{::}\hlkwd{read_csv}\hlstd{(}\hlstr{"https://raw.githubusercontent.com/KayleeDavisGithub/Graduate_Methods_Handbook/master/data/swi.csv"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{davis} \hlkwb{<-} \hlkwd{as.data.frame}\hlstd{(data)}
\hlstd{> }
\hlstd{> }\hlstd{swi} \hlkwb{<-} \hlkwd{as.matrix}\hlstd{(davis)} \hlcom{# Make incidence matrix - and put as igraph network}
\hlstd{> }\hlstd{swn} \hlkwb{<-} \hlkwd{graph.incidence}\hlstd{(swi)} \hlcom{# This specifically makes a bipartite igraph}
\hlstd{> }\hlstd{swn} \hlcom{# UN-B ; 32 89}
\end{alltt}
\begin{verbatim}
## IGRAPH 6c01ec0 U--B 31 81 -- 
## + attr: type (v/l)
## + edges from 6c01ec0:
##  [1]  1--18  1--19  1--20  1--22  1--23  1--24  1--25  2--19  2--20  2--21
## [11]  2--22  2--23  2--24  2--25  2--26  3--18  3--20  3--21  3--22  3--23
## [21]  3--24  3--25  4--20  4--21  4--22  4--24  5--20  5--22  5--23  5--25
## [31]  6--22  6--23  6--24  6--25  7--23  7--25  7--26  8--22  8--24  8--25
## [41]  8--26  9--24  9--25  9--26  9--29 10--25 10--26 10--27 10--29 11--25
## [51] 11--26 11--27 11--29 11--30 11--31 12--24 12--25 12--26 12--27 12--29
## [61] 12--30 12--31 13--23 13--24 13--26 13--27 13--28 13--29 13--30 13--31
## [71] 14--24 14--25 14--27 14--28 14--29 15--25 15--26 16--26 16--28 17--26
## + ... omitted several edges
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{plot}\hlstd{(swn)}
\end{alltt}
\end{kframe}
\includegraphics[width=6in]{figure/Network_Properties-1} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlstd{swpr} \hlkwb{<-} \hlkwd{bipartite.projection}\hlstd{(swn)} \hlcom{# This makes the graph two one-mode networks}
\hlstd{> }\hlcom{# What is this? - instead of just 1:1 node relationships there are two}
\hlstd{> }\hlcom{# overlapping networks and the relationships we care about are between people}
\hlstd{> }\hlcom{# of the other network. so now our edges are weighted, and igraph strangely}
\hlstd{> }\hlcom{# calls this a nonbipartite graph? Why? Well now we don't really have one}
\hlstd{> }\hlcom{# anymore! Instead we transferred the bipartide relationship To a weighted}
\hlstd{> }\hlcom{# relationship using that projection function. - Weights are number of shared}
\hlstd{> }\hlcom{# Event interactions.}
\hlstd{> }
\hlstd{> }\hlcom{# Note two proj's we get from that projection, via X or Y projection weights}
\hlstd{> }\hlkwd{plot}\hlstd{(swpr}\hlopt{$}\hlstd{proj2,}
\hlstd{+ }     \hlkwc{edge.width} \hlstd{=} \hlkwd{E}\hlstd{(swpr}\hlopt{$}\hlstd{proj2)}\hlopt{$}\hlstd{weight)}
\end{alltt}
\end{kframe}
\includegraphics[width=6in]{figure/Network_Properties-2} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlkwd{cor}\hlstd{(swi)}
\end{alltt}
\begin{verbatim}
##             1...1      1...2       1...3      1...4      1...5       1...6
## 1...1   1.0000000  0.4333333  0.56568542  0.3098899  0.4364358  0.43643578
## 1...2   0.4333333  1.0000000  0.56568542  0.3098899  0.4364358  0.43643578
## 1...3   0.5656854  0.5656854  1.00000000  0.7171372  0.7715167  0.50920105
## 1...4   0.3098899  0.3098899  0.71713717  1.0000000  0.5532833  0.23975611
## 1...5   0.4364358  0.4364358  0.77151675  0.5532833  1.0000000  0.51428571
## 1...6   0.4364358  0.4364358  0.50920105  0.2397561  0.5142857  1.00000000
## 0...7   0.3055050  0.3055050  0.27774603  0.3872983  0.4571429  0.21428571
## 1...8   0.2025479  0.2025479  0.05370862 -0.1069901  0.1823232  0.18232322
## 1...9  -0.4944132 -0.1123666 -0.60385964 -0.3038949 -0.6326266 -0.38251843
## 0...10 -0.2357023 -0.2357023 -0.41666667 -0.2988072 -0.5400617 -0.27774603
## 0...11 -0.2025479 -0.2025479 -0.35805744 -0.2567763 -0.4640955 -0.18232322
## 0...12 -0.2696799 -0.2696799 -0.47673129 -0.3418817 -0.6179144 -0.36780618
## 0...13 -0.1690309 -0.1690309 -0.29880715 -0.2142857 -0.3872983 -0.07377111
## 0...14 -0.1690309 -0.1690309 -0.29880715 -0.2142857 -0.3872983 -0.07377111
##              0...7       1...8      1...9      0...10      0...11     0...12
## 1...1   0.30550505  0.20254787 -0.4944132 -0.23570226 -0.20254787 -0.2696799
## 1...2   0.30550505  0.20254787 -0.1123666 -0.23570226 -0.20254787 -0.2696799
## 1...3   0.27774603  0.05370862 -0.6038596 -0.41666667 -0.35805744 -0.4767313
## 1...4   0.38729833 -0.10699012 -0.3038949 -0.29880715 -0.25677630 -0.3418817
## 1...5   0.45714286  0.18232322 -0.6326266 -0.54006172 -0.46409548 -0.6179144
## 1...6   0.21428571  0.18232322 -0.3825184 -0.27774603 -0.18232322 -0.3678062
## 0...7   1.00000000  0.09944903 -0.3678062  0.01543033 -0.09944903  0.1176980
## 1...8   0.09944903  1.00000000 -0.1194880  0.05370862 -0.67307692  0.1194880
## 1...9  -0.36780618 -0.11948803  1.0000000  0.20658356  0.11948803  0.2878788
## 0...10  0.01543033  0.05370862  0.2065836  1.00000000  0.25064021  0.8740074
## 0...11 -0.09944903 -0.67307692  0.1194880  0.25064021  1.00000000  0.1706972
## 0...12  0.11769798  0.11948803  0.2878788  0.87400737  0.17069719  1.0000000
## 0...13  0.07377111 -0.10699012  0.3418817  0.71713717  0.10699012  0.6267832
## 0...14  0.07377111 -0.10699012  0.3418817  0.71713717  0.10699012  0.6267832
##             0...13      0...14
## 1...1  -0.16903085 -0.16903085
## 1...2  -0.16903085 -0.16903085
## 1...3  -0.29880715 -0.29880715
## 1...4  -0.21428571 -0.21428571
## 1...5  -0.38729833 -0.38729833
## 1...6  -0.07377111 -0.07377111
## 0...7   0.07377111  0.07377111
## 1...8  -0.10699012 -0.10699012
## 1...9   0.34188173  0.34188173
## 0...10  0.71713717  0.71713717
## 0...11  0.10699012  0.10699012
## 0...12  0.62678317  0.62678317
## 0...13  1.00000000  1.00000000
## 0...14  1.00000000  1.00000000
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# Correlation of our matrix object to see structural position relationship.}
\hlstd{> }\hlcom{# Note that Flora and Oliva are structurally similar here and elsewhere}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlcom{#  Going beyond Pearson correlation to see structural similarity:}
\hlstd{> }\hlcom{# dissimilarity measure (-1 to cor).}
\hlstd{> }\hlkwd{as.dist}\hlstd{(}\hlnum{1}\hlopt{-}\hlkwd{cor}\hlstd{(swi),} \hlkwc{upper}\hlstd{=}\hlnum{TRUE}\hlstd{)}
\end{alltt}
\begin{verbatim}
##               1...1        1...2        1...3        1...4        1...5
## 1...1               5.666667e-01 4.343146e-01 6.901101e-01 5.635642e-01
## 1...2  5.666667e-01              4.343146e-01 6.901101e-01 5.635642e-01
## 1...3  4.343146e-01 4.343146e-01              2.828628e-01 2.284833e-01
## 1...4  6.901101e-01 6.901101e-01 2.828628e-01              4.467167e-01
## 1...5  5.635642e-01 5.635642e-01 2.284833e-01 4.467167e-01             
## 1...6  5.635642e-01 5.635642e-01 4.907989e-01 7.602439e-01 4.857143e-01
## 0...7  6.944950e-01 6.944950e-01 7.222540e-01 6.127017e-01 5.428571e-01
## 1...8  7.974521e-01 7.974521e-01 9.462914e-01 1.106990e+00 8.176768e-01
## 1...9  1.494413e+00 1.112367e+00 1.603860e+00 1.303895e+00 1.632627e+00
## 0...10 1.235702e+00 1.235702e+00 1.416667e+00 1.298807e+00 1.540062e+00
## 0...11 1.202548e+00 1.202548e+00 1.358057e+00 1.256776e+00 1.464095e+00
## 0...12 1.269680e+00 1.269680e+00 1.476731e+00 1.341882e+00 1.617914e+00
## 0...13 1.169031e+00 1.169031e+00 1.298807e+00 1.214286e+00 1.387298e+00
## 0...14 1.169031e+00 1.169031e+00 1.298807e+00 1.214286e+00 1.387298e+00
##               1...6        0...7        1...8        1...9       0...10
## 1...1  5.635642e-01 6.944950e-01 7.974521e-01 1.494413e+00 1.235702e+00
## 1...2  5.635642e-01 6.944950e-01 7.974521e-01 1.112367e+00 1.235702e+00
## 1...3  4.907989e-01 7.222540e-01 9.462914e-01 1.603860e+00 1.416667e+00
## 1...4  7.602439e-01 6.127017e-01 1.106990e+00 1.303895e+00 1.298807e+00
## 1...5  4.857143e-01 5.428571e-01 8.176768e-01 1.632627e+00 1.540062e+00
## 1...6               7.857143e-01 8.176768e-01 1.382518e+00 1.277746e+00
## 0...7  7.857143e-01              9.005510e-01 1.367806e+00 9.845697e-01
## 1...8  8.176768e-01 9.005510e-01              1.119488e+00 9.462914e-01
## 1...9  1.382518e+00 1.367806e+00 1.119488e+00              7.934164e-01
## 0...10 1.277746e+00 9.845697e-01 9.462914e-01 7.934164e-01             
## 0...11 1.182323e+00 1.099449e+00 1.673077e+00 8.805120e-01 7.493598e-01
## 0...12 1.367806e+00 8.823020e-01 8.805120e-01 7.121212e-01 1.259926e-01
## 0...13 1.073771e+00 9.262289e-01 1.106990e+00 6.581183e-01 2.828628e-01
## 0...14 1.073771e+00 9.262289e-01 1.106990e+00 6.581183e-01 2.828628e-01
##              0...11       0...12       0...13       0...14
## 1...1  1.202548e+00 1.269680e+00 1.169031e+00 1.169031e+00
## 1...2  1.202548e+00 1.269680e+00 1.169031e+00 1.169031e+00
## 1...3  1.358057e+00 1.476731e+00 1.298807e+00 1.298807e+00
## 1...4  1.256776e+00 1.341882e+00 1.214286e+00 1.214286e+00
## 1...5  1.464095e+00 1.617914e+00 1.387298e+00 1.387298e+00
## 1...6  1.182323e+00 1.367806e+00 1.073771e+00 1.073771e+00
## 0...7  1.099449e+00 8.823020e-01 9.262289e-01 9.262289e-01
## 1...8  1.673077e+00 8.805120e-01 1.106990e+00 1.106990e+00
## 1...9  8.805120e-01 7.121212e-01 6.581183e-01 6.581183e-01
## 0...10 7.493598e-01 1.259926e-01 2.828628e-01 2.828628e-01
## 0...11              8.293028e-01 8.930099e-01 8.930099e-01
## 0...12 8.293028e-01              3.732168e-01 3.732168e-01
## 0...13 8.930099e-01 3.732168e-01              2.220446e-16
## 0...14 8.930099e-01 3.732168e-01 2.220446e-16
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# Upper = T just prints both sides of diag. Doesn't effect analysis}
\hlstd{> }\hlcom{# We want to move away from just comparing two individuals, but instead}
\hlstd{> }\hlcom{# find entire clusters of attendants that exibit similar behavior. And then be}
\hlstd{> }\hlcom{# able to analyze that more interesting result. But to do this, we have to}
\hlstd{> }\hlcom{# find how nodes are dissimilar, so this data is more valuable to find these}
\hlstd{> }\hlcom{# clusters! Note we have a wider range now because with the -1 we could have}
\hlstd{> }\hlcom{# a 1 - a negative -1, or 1+1 (1- -1).}
\hlstd{> }
\hlstd{> }\hlstd{swdend} \hlkwb{<-} \hlkwd{hclust}\hlstd{(}\hlkwd{as.dist}\hlstd{(}\hlnum{1}\hlopt{-}\hlkwd{cor}\hlstd{(swi)))} \hlcom{# Standard clustering tool}
\hlstd{> }\hlkwd{plot}\hlstd{(swdend)} \hlcom{# So how do we read this Dendrogram?}
\end{alltt}
\end{kframe}
\includegraphics[width=6in]{figure/Network_Properties-3} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{# Height is our value, and as we parse that value down,it's grouped into values}
\hlstd{> }\hlcom{# Similar values become grouped under other values.}
\hlstd{> }\hlcom{#  So, read from the top down, initial separation was around the 1.0 mark,}
\hlstd{> }\hlcom{#  developing two clusters, which have unique values apart from one another.}
\hlstd{> }\hlcom{#  as more and more nodes find similarity.}
\hlstd{> }
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlkwd{cutree}\hlstd{(swdend,} \hlkwc{k}\hlstd{=}\hlnum{2}\hlstd{)} \hlcom{# here we are telling R where we should cut our clusters at.}
\end{alltt}
\begin{verbatim}
##  1...1  1...2  1...3  1...4  1...5  1...6  0...7  1...8  1...9 0...10 0...11 
##      1      1      1      1      1      1      1      1      2      2      2 
## 0...12 0...13 0...14 
##      2      2      2
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{#  THEORY and your interpretation of the data drives this decision,}
\hlstd{> }\hlcom{#  a dendrogram will not tell you where to cut your clusters.}
\hlstd{> }
\hlstd{> }\hlcom{# We identified two groups. Let's graph each of these to show our new network:}
\hlstd{> }\hlkwd{plot}\hlstd{(swpr}\hlopt{$}\hlstd{proj2,}
\hlstd{+ }     \hlkwc{edge.width}\hlstd{=}\hlkwd{E}\hlstd{(swpr}\hlopt{$}\hlstd{proj2)}\hlopt{$}\hlstd{weight,}
\hlstd{+ }     \hlkwc{vertex.color}\hlstd{=}\hlkwd{cutree}\hlstd{(swdend,} \hlkwc{k}\hlstd{=}\hlnum{2}\hlstd{))}
\end{alltt}
\end{kframe}
\includegraphics[width=6in]{figure/Network_Properties-4} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{## Let's do the same analysis for a one-mode network.}
\hlstd{> }\hlcom{# Let's just ignore this package and data coding here for now.. Copy and Pasted}
\hlstd{> }\hlkwd{library}\hlstd{(ergm)}
\hlstd{> }\hlkwd{data}\hlstd{(}\hlstr{"florentine"}\hlstd{)}
\hlstd{> }\hlkwd{require}\hlstd{(intergraph)}
\hlstd{> }\hlkwd{require}\hlstd{(igraph)}
\hlstd{> }\hlcom{# igraph  here to override other packages-might have similarly named functions}
\hlstd{> }
\hlstd{> }\hlcom{# Igraph objects, thanks to intergraph package (as seen before)}
\hlstd{> }\hlstd{flo_m} \hlkwb{<-} \hlkwd{asIgraph}\hlstd{(flomarriage)}
\hlstd{> }\hlstd{flo_b} \hlkwb{<-} \hlkwd{asIgraph}\hlstd{(flobusiness)}
\hlstd{> }
\hlstd{> }\hlcom{# This sets a default name, and fixes an issue with unnamed nodes:}
\hlstd{> }\hlcom{#   (Professor discovered this error by first not doing this code:)}
\hlstd{> }\hlkwd{V}\hlstd{(flo_m)}\hlopt{$}\hlstd{name} \hlkwb{<-} \hlkwd{V}\hlstd{(flo_m)}\hlopt{$}\hlstd{vertex.names}
\hlstd{> }\hlkwd{V}\hlstd{(flo_b)}\hlopt{$}\hlstd{name} \hlkwb{<-} \hlkwd{V}\hlstd{(flo_b)}\hlopt{$}\hlstd{vertex.names}
\hlstd{> }
\hlstd{> }\hlcom{# Stacking our adjacency matricies on top of one another by row bind (rbind())}
\hlstd{> }\hlcom{#  Why? To consider multiple relationship types at the same time.}
\hlstd{> }\hlstd{flo_both} \hlkwb{<-} \hlkwd{rbind}\hlstd{(}\hlkwd{as.matrix}\hlstd{(}\hlkwd{get.adjacency}\hlstd{(flo_m,}\hlkwc{names}\hlstd{=}\hlnum{TRUE}\hlstd{)),}
\hlstd{+ }                  \hlkwd{as.matrix}\hlstd{(}\hlkwd{get.adjacency}\hlstd{(flo_b,}\hlkwc{names}\hlstd{=}\hlnum{TRUE}\hlstd{)))}
\hlstd{> }
\hlstd{> }\hlstd{flo_dist} \hlkwb{<-} \hlkwd{as.dist}\hlstd{(}\hlnum{1}\hlopt{-}\hlkwd{cor}\hlstd{(flo_both))}
\hlstd{> }\hlcom{## Warning in cor(flo_both): the standard deviation is zero}
\hlstd{> }\hlstd{flo_dist}
\end{alltt}
\begin{verbatim}
##              Acciaiuoli   Albizzi Barbadori  Bischeri Castellani    Ginori
## Albizzi       0.4415844                                                   
## Barbadori     0.6261217 0.8798272                                         
## Bischeri      1.0862796 0.8798272 1.0256410                               
## Castellani    1.0862796 1.1545079 1.0256410 0.4102564                     
## Ginori        1.0577671 1.1034483 0.8798272 1.1545079  0.8798272          
## Guadagni      1.0862796 1.1545079 1.2307692 1.0256410  1.0256410 0.8798272
## Lamberteschi  1.0772898 0.8431363 0.7657122 0.5452060  0.9862184 1.1384091
## Medici        1.1299888 1.2327814 1.1791062 1.3476767  1.0105357 0.7813265
## Pazzi         1.0463739 1.0830455 0.7932754 1.1240347  1.1240347 0.6401363
## Peruzzi       1.0950382 1.1701926 0.8668499 0.8668499  0.6731771 0.9108515
## Pucci                NA        NA        NA        NA         NA        NA
## Ridolfi       0.4415844 0.7356322 0.8798272 0.8798272  0.8798272 1.1034483
## Salviati      0.4415844 0.7356322 0.6051466 1.1545079  1.1545079 0.7356322
## Strozzi       1.0678844 1.1215661 0.9394772 0.9394772  0.9394772 1.1215661
## Tornabuoni    0.5248090 0.4732134 0.6973862 0.9394772  1.1815683 0.7973898
##               Guadagni Lamberteschi    Medici     Pazzi   Peruzzi     Pucci
## Albizzi                                                                    
## Barbadori                                                                  
## Bischeri                                                                   
## Castellani                                                                 
## Ginori                                                                     
## Guadagni                                                                   
## Lamberteschi 0.9862184                                                     
## Medici       1.0105357    1.3114511                                        
## Pazzi        1.1240347    1.1111111 0.9150588                              
## Peruzzi      0.6731771    0.8113260 1.2238141 1.1366260                    
## Pucci               NA           NA        NA        NA        NA          
## Ridolfi      0.8798272    1.1384091 1.0070540 1.0830455 0.9108515        NA
## Salviati     1.1545079    1.1384091 1.2327814 0.6401363 1.1701926        NA
## Strozzi      0.9394772    1.1626500 1.0746047 1.0975900 0.7428571        NA
## Tornabuoni   1.1815683    0.9024100 1.0746047 0.7072300 1.2000000        NA
##                Ridolfi  Salviati   Strozzi
## Albizzi                                   
## Barbadori                                 
## Bischeri                                  
## Castellani                                
## Ginori                                    
## Guadagni                                  
## Lamberteschi                              
## Medici                                    
## Pazzi                                     
## Peruzzi                                   
## Pucci                                     
## Ridolfi                                   
## Salviati     0.7356322                    
## Strozzi      1.1215661 1.1215661          
## Tornabuoni   0.7973898 0.4732134 0.8571429
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlstd{flo_dist[}\hlkwd{is.na}\hlstd{(flo_dist)}\hlopt{==}\hlnum{TRUE}\hlstd{]}\hlkwb{<-}\hlnum{2} \hlcom{# Fixes NA error by reassigning to number 2}
\hlstd{> }
\hlstd{> }\hlcom{## With NetCluster}
\hlstd{> }\hlstd{flo_dend} \hlkwb{<-} \hlkwd{hclust}\hlstd{(flo_dist)}
\hlstd{> }\hlkwd{plot}\hlstd{(flo_dend)}
\end{alltt}
\end{kframe}
\includegraphics[width=6in]{figure/Network_Properties-5} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{## With gplots}
\hlstd{> }\hlkwd{plot}\hlstd{(flo_m,}\hlkwc{vertex.color}\hlstd{=}\hlkwd{cutree}\hlstd{(flo_dend,} \hlkwc{k}\hlstd{=}\hlnum{4}\hlstd{))}
\end{alltt}
\end{kframe}
\includegraphics[width=6in]{figure/Network_Properties-6} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{# lots of explaination and data reading in the seminar notes from the course!}
\hlstd{> }\hlcom{#   Revisit it there if there are any questions it's very well documented.}
\end{alltt}
\end{kframe}
\end{knitrout}
\end{center}

\subsection{Diads and Triads}

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(ergm)}
\hlstd{> }\hlkwd{data}\hlstd{(}\hlstr{"faux.dixon.high"}\hlstd{)}
\hlstd{> }\hlkwd{detach}\hlstd{(package}\hlopt{:}\hlstd{ergm)}
\hlstd{> }\hlkwd{detach}\hlstd{(package}\hlopt{:}\hlstd{network)}
\hlstd{> }\hlkwd{require}\hlstd{(intergraph)}
\hlstd{> }\hlkwd{require}\hlstd{(igraph)}
\hlstd{> }\hlstd{dixon} \hlkwb{<-} \hlkwd{asIgraph}\hlstd{(faux.dixon.high)}
\hlstd{> }
\hlstd{> }\hlcom{# Network Basics:}
\hlstd{> }\hlkwd{summary}\hlstd{(dixon)}
\end{alltt}
\begin{verbatim}
## IGRAPH 6c497f8 D--- 248 1197 -- 
## + attr: title (g/c), grade (v/n), na (v/l), race (v/c), sex (v/n),
## | vertex.names (v/c), na (e/l)
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# Plotting with color by grade. [How might we clean this code?]}
\hlstd{> }\hlkwd{plot}\hlstd{(dixon,}
\hlstd{+ }     \hlkwc{vertex.label}\hlstd{=}\hlnum{NA}\hlstd{,}
\hlstd{+ }     \hlkwc{edge.arrow.size}\hlstd{=}\hlnum{0.25}\hlstd{,}
\hlstd{+ }     \hlkwc{vertex.size}\hlstd{=}\hlnum{3}\hlstd{,}
\hlstd{+ }     \hlkwc{edge.width}\hlstd{=}\hlnum{0.5}\hlstd{,}
\hlstd{+ }     \hlkwc{vertex.color}\hlstd{=}\hlkwd{V}\hlstd{(dixon)}\hlopt{$}\hlstd{grade)}
\hlstd{> }\hlkwd{legend}\hlstd{(}\hlstr{"topright"}\hlstd{,}
\hlstd{+ }       \hlkwc{legend}\hlstd{=}\hlnum{7}\hlopt{:}\hlnum{12}\hlstd{,}
\hlstd{+ }       \hlkwc{pch}\hlstd{=}\hlnum{19}\hlstd{,}
\hlstd{+ }       \hlkwc{col}\hlstd{=}\hlkwd{categorical_pal}\hlstd{(}\hlnum{8}\hlstd{)[}\hlkwd{c}\hlstd{(}\hlnum{7}\hlstd{,}\hlnum{8}\hlstd{,}\hlnum{1}\hlstd{,}\hlnum{2}\hlstd{,}\hlnum{3}\hlstd{,}\hlnum{4}\hlstd{)])}
\end{alltt}
\end{kframe}
\includegraphics[width=6in]{figure/Diad_Triad-1} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{## Dyads:}
\hlstd{> }\hlcom{#    Reciprocity:  both nodes point to one another.}
\hlstd{> }\hlcom{#    Here we can get mutual, asymmetrical, and null counts:}
\hlstd{> }
\hlstd{> }\hlkwd{dyad.census}\hlstd{(dixon)} \hlcom{# Note the $ indicator for each object.}
\end{alltt}
\begin{verbatim}
## $mut
## [1] 219
## 
## $asym
## [1] 759
## 
## $null
## [1] 29650
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# We can calculate this via dyad census (above) or through adjacency matrix.}
\hlstd{> }\hlkwd{reciprocity}\hlstd{(dixon)}
\end{alltt}
\begin{verbatim}
## [1] 0.3659148
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# Dyad Census:}
\hlstd{> }\hlnum{2}\hlopt{*}\hlkwd{dyad_census}\hlstd{(dixon)}\hlopt{$}\hlstd{mut}\hlopt{/}\hlkwd{ecount}\hlstd{(dixon)}
\end{alltt}
\begin{verbatim}
## [1] 0.3659148
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# two times the mutual count to control for the directionality of edges}
\hlstd{> }\hlcom{# (which we use as denominator)}
\hlstd{> }
\hlstd{> }\hlcom{# Using the adjacency matrix}
\hlstd{> }\hlstd{dam} \hlkwb{<-} \hlkwd{as.matrix}\hlstd{(}\hlkwd{get.adjacency}\hlstd{(dixon))}
\hlstd{> }
\hlstd{> }\hlkwd{sum}\hlstd{(dam}\hlopt{*}\hlkwd{t}\hlstd{(dam))}
\end{alltt}
\begin{verbatim}
## [1] 438
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## Element-wise multiplation of the adjacency matrix, giving us the full number}
\hlstd{> }\hlcom{#  of mutual edges (equivalent to 2*dyad_census(dixon)$mut.)}
\hlstd{> }
\hlstd{> }\hlkwd{sum}\hlstd{(dam)} \hlcom{## The count of the total number of edges in the network}
\end{alltt}
\begin{verbatim}
## [1] 1197
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{#           (equivlaent to ecount(dixon).)}
\hlstd{> }
\hlstd{> }\hlkwd{sum}\hlstd{(dam}\hlopt{*}\hlkwd{t}\hlstd{(dam))}\hlopt{/}\hlkwd{sum}\hlstd{(dam)}
\end{alltt}
\begin{verbatim}
## [1] 0.3659148
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# Note all three are the same:}
\hlstd{> }\hlkwd{reciprocity}\hlstd{(dixon)} \hlcom{# Simple function}
\end{alltt}
\begin{verbatim}
## [1] 0.3659148
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlnum{2}\hlopt{*}\hlkwd{dyad_census}\hlstd{(dixon)}\hlopt{$}\hlstd{mut}\hlopt{/}\hlkwd{ecount}\hlstd{(dixon)} \hlcom{# Dyad Census utilization}
\end{alltt}
\begin{verbatim}
## [1] 0.3659148
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{sum}\hlstd{(dam}\hlopt{*}\hlkwd{t}\hlstd{(dam))}\hlopt{/}\hlkwd{sum}\hlstd{(dam)} \hlcom{# Using adjacency matrix}
\end{alltt}
\begin{verbatim}
## [1] 0.3659148
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# 37% chance that if Student A names Student B as their friend; Student B will}
\hlstd{> }\hlcom{# have also named A. More generally, we can say that 37% of edges are}
\hlstd{> }\hlcom{# reciprocated.}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlcom{# Or we can use an alternative reciprocity calculation:}
\hlstd{> }\hlkwd{reciprocity}\hlstd{(dixon,} \hlkwc{mode}\hlstd{=}\hlstr{"ratio"}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1] 0.2239264
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{dyad.census}\hlstd{(dixon)}\hlopt{$}\hlstd{mut}\hlopt{/}\hlstd{(}\hlkwd{dyad.census}\hlstd{(dixon)}\hlopt{$}\hlstd{mut} \hlopt{+} \hlkwd{dyad.census}\hlstd{(dixon)}\hlopt{$}\hlstd{asym)}
\end{alltt}
\begin{verbatim}
## [1] 0.2239264
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# mutual connections / mutal + asym}
\hlstd{> }
\hlstd{> }\hlcom{# Homophily  - relationships among people given a variable}
\hlstd{> }\hlkwd{assortativity.nominal}\hlstd{(dixon,}\hlkwd{V}\hlstd{(dixon)}\hlopt{$}\hlstd{grade)}
\end{alltt}
\begin{verbatim}
## [1] 0.5592401
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{assortativity.nominal}\hlstd{(dixon,}\hlkwd{V}\hlstd{(dixon)}\hlopt{$}\hlstd{sex)}
\end{alltt}
\begin{verbatim}
## [1] 0.1358054
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{assortativity.nominal}\hlstd{(dixon,}\hlkwd{factor}\hlstd{(}\hlkwd{V}\hlstd{(dixon)}\hlopt{$}\hlstd{race))} \hlcom{# Had to factorize race here}
\end{alltt}
\begin{verbatim}
## [1] 0.5761453
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# .nominal is giving us group-wise assortativity, without that it would treat}
\hlstd{> }\hlcom{# as continuous. postive number means more assortment (sorting) into like}
\hlstd{> }\hlcom{# groups with the variable than non-variable.}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlcom{## Triads}
\hlstd{> }\hlkwd{transitivity}\hlstd{(dixon)}
\end{alltt}
\begin{verbatim}
## [1] 0.1812741
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# 18% chance of two neighbors of a vertex are themselves connected.}
\hlstd{> }\hlcom{#    put another way, 18% of all triads are closed triangles (triads)}
\hlstd{> }
\hlstd{> }\hlcom{# Social networks often have a high level of transitivity, compare this to a}
\hlstd{> }\hlcom{# completely random graph: of same size:}
\hlstd{> }\hlstd{rand} \hlkwb{<-} \hlkwd{sample_gnm}\hlstd{(}\hlkwd{vcount}\hlstd{(dixon),}\hlkwd{ecount}\hlstd{(dixon),}\hlkwc{directed}\hlstd{=}\hlnum{TRUE}\hlstd{)}
\hlstd{> }\hlkwd{summary}\hlstd{(rand)}
\end{alltt}
\begin{verbatim}
## IGRAPH 6c5985d D--- 248 1197 -- Erdos-Renyi (gnm) graph
## + attr: name (g/c), type (g/c), loops (g/l), m (g/n)
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{transitivity}\hlstd{(rand)}
\end{alltt}
\begin{verbatim}
## [1] 0.0427358
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# Triad Census:}
\hlstd{> }\hlcom{# ?triad.census() # This help page defines most of the below information:}
\hlstd{> }
\hlstd{> }\hlstd{census_labels} \hlkwb{<-} \hlkwd{c}\hlstd{(}\hlstr{'003'}\hlstd{,}\hlstr{'012'}\hlstd{,}\hlstr{'102'}\hlstd{,}\hlstr{'021D'}\hlstd{,}\hlstr{'021U'}\hlstd{,}\hlstr{'021C'}\hlstd{,}\hlstr{'111D'}\hlstd{,}\hlstr{'111U'}\hlstd{,}
\hlstd{+ }                  \hlstr{'030T'}\hlstd{,}\hlstr{'030C'}\hlstd{,}\hlstr{'201'}\hlstd{,}\hlstr{'120D'}\hlstd{,}\hlstr{'120U'}\hlstd{,}\hlstr{'120C'}\hlstd{,}\hlstr{'210'}\hlstd{,}\hlstr{'300'}\hlstd{)}
\hlstd{> }\hlcom{## this is the order in which the triads appear in the triad census output.}
\hlstd{> }\hlkwd{triad.census}\hlstd{(dixon)}
\end{alltt}
\begin{verbatim}
##  [1] 2280642  172313   49433    1400    1113    2576    1396    1611     163
## [10]      22     386      73      92      98     135      43
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlstd{df} \hlkwb{<-} \hlkwd{data.frame}\hlstd{(census_labels,} \hlkwd{triad.census}\hlstd{(dixon))}
\hlstd{> }\hlcom{## binding the two labels with the output will let us actually interpret this!}
\hlstd{> }\hlcom{# Most common are unconnected triads, then triads with only one asymmetric edge}
\hlstd{> }
\hlstd{> }\hlkwd{triad.census}\hlstd{(rand)}
\end{alltt}
\begin{verbatim}
##  [1] 2230389  268070    2057    2664    2646    5355      76      78     112
## [10]      46       0       1       1       1       0       0
\end{verbatim}
\end{kframe}
\end{knitrout}
\end{center}

\subsection{Network Centrality}

Measuring the centrality of a network is indicating which node(s) are most central, or critical, to the network remaining the shape it is in. A central node, for example, can be the person between groups, or just a well connected node in general. There are many ways to measure and detect network centrality, some of which I've studied are listed below. Later in this section we will compare each of these finding that they typically correlate with one another (good!). Cannon advice is to report all of the relevant measures of centrality rather than spending too much time choosing any particular one.

\textit{Borgatti (2005):}
\begin{longtable}{m{2.8cm}  m{4cm} m{5.7cm} m{4.7cm}  }
\hline\noalign{\smallskip}
\textbf{Name} & \textbf{Definition} & \textbf{Properties} & \textbf{Notes} \\
\noalign{\smallskip}\hline\noalign{\smallskip}
Betweenness (Freeman, 1979) & $\mathlarger{ \Sigma_i \Sigma_j \frac{g_{ikj}}{g_{ij}}, ~~ i \neq j \neq k }$ & Assumes traffic is indivisible, traffic takes known-shortest paths,   & Likely not a good index for information flow or ``gossip'' \\
Eigenvector centrality (Bonacich, 1972) & $\lambda v = A v$ & Traffic moves along unrestricted ``walks.'' Traffic can effect subsequent nodes simultaneously. Measures long term and indirect risk.   & Related to other measures on sequentially influencing nodes (``influence-type process'').\\
Degree centrality (Freeman, 1979) & Limiting probabilities of nodes by their degree. (Markov Process).    & Measures immediate risk. Assumes an infinitely long random walk (a dollar traveling hands). \\
\noalign{\smallskip}\hline\noalign{\smallskip}
\end{longtable}


But how do we actually do this? Let's start with reading in the data, and setting everything up. I'll save space by not commenting this inital code, just know that it is creating an edgelist matrix for us to generate network objects. This data is from Google's BigQuery - Reddit data in October and November (2017) for the r/asksocialscientists page. This contains those who post and those who comment. \index{recoding data}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Initial Packages:}
\hlstd{> }\hlkwd{library}\hlstd{(statnet)}
\hlstd{> }\hlkwd{library}\hlstd{(dplyr)}
\hlstd{> }\hlkwd{library}\hlstd{(igraph)}
\hlstd{> }
\hlstd{> }\hlcom{# Let's read in, add on top of one/ another the Reddit EdgeList data:}
\hlstd{> }\hlcom{##   October:}
\hlstd{> }\hlcom{# read in the posts data}
\hlstd{> }\hlkwd{library}\hlstd{(readr)}
\hlstd{> }
\hlstd{> }\hlstd{posts} \hlkwb{<-} \hlkwd{read_csv}\hlstd{(}\hlstr{'https://raw.githubusercontent.com/KayleeDavisGithub/Graduate_Methods_Handbook/master/data/2017_10_AskSocialScience_posts.csv'}\hlstd{)}
\hlstd{> }\hlcom{# read in the comments data}
\hlstd{> }\hlstd{comments} \hlkwb{<-} \hlkwd{read_csv}\hlstd{(}\hlstr{'https://raw.githubusercontent.com/KayleeDavisGithub/Graduate_Methods_Handbook/master/data/2017_10_AskSocialScience_comments.csv'}\hlstd{)}
\hlstd{> }\hlstd{comments}\hlopt{$}\hlstd{id2} \hlkwb{<-} \hlkwd{paste}\hlstd{(}\hlstr{"t1_"}\hlstd{, comments}\hlopt{$}\hlstd{id,} \hlkwc{sep}\hlstd{=}\hlstr{""}\hlstd{)}
\hlstd{> }\hlstd{posts}\hlopt{$}\hlstd{id2} \hlkwb{<-} \hlkwd{paste}\hlstd{(}\hlstr{"t3_"}\hlstd{, posts}\hlopt{$}\hlstd{id,} \hlkwc{sep}\hlstd{=}\hlstr{""}\hlstd{)}
\hlstd{> }\hlstd{for_el} \hlkwb{<-} \hlkwd{data.frame}\hlstd{(}
\hlstd{+ }     \hlkwc{author} \hlstd{=} \hlkwd{c}\hlstd{(}\hlkwd{as.character}\hlstd{(posts}\hlopt{$}\hlstd{author),} \hlkwd{as.character}\hlstd{(comments}\hlopt{$}\hlstd{author)),}
\hlstd{+ }     \hlkwc{id} \hlstd{=} \hlkwd{c}\hlstd{(}\hlkwd{as.character}\hlstd{(posts}\hlopt{$}\hlstd{id2),} \hlkwd{as.character}\hlstd{(comments}\hlopt{$}\hlstd{id2)),}
\hlstd{+ }     \hlkwc{parent_id} \hlstd{=} \hlkwd{c}\hlstd{(}\hlkwd{rep}\hlstd{(}\hlnum{NA}\hlstd{,} \hlkwd{dim}\hlstd{(posts)[}\hlnum{1}\hlstd{]),} \hlkwd{as.character}\hlstd{(comments}\hlopt{$}\hlstd{parent_id))}
\hlstd{+ }\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{for_el} \hlkwb{<-} \hlstd{for_el[for_el}\hlopt{$}\hlstd{author}\hlopt{!=}\hlstr{"[deleted]"}\hlstd{,]}
\hlstd{> }\hlstd{el1} \hlkwb{<-} \hlkwd{inner_join}\hlstd{(for_el, for_el,} \hlkwd{c}\hlstd{(}\hlstr{"parent_id"} \hlstd{=} \hlstr{"id"}\hlstd{))}
\hlstd{> }\hlstd{el} \hlkwb{<-} \hlkwd{data.frame}\hlstd{(}\hlkwc{auth1} \hlstd{= el1}\hlopt{$}\hlstd{author.x,} \hlkwc{auth2} \hlstd{= el1}\hlopt{$}\hlstd{author.y)}
\hlstd{> }\hlstd{el} \hlkwb{<-} \hlkwd{as.matrix}\hlstd{(el)}
\hlstd{> }
\hlstd{> }\hlcom{#---------------------------------------------------------------------------}
\hlstd{> }\hlcom{##   Nov:}
\hlstd{> }\hlstd{posts2} \hlkwb{<-} \hlkwd{read_csv}\hlstd{(}\hlstr{'https://raw.githubusercontent.com/KayleeDavisGithub/Graduate_Methods_Handbook/master/data/2017_11_AskSocialScience_posts.csv'}\hlstd{)}
\hlstd{> }\hlstd{comments2} \hlkwb{<-} \hlkwd{read_csv}\hlstd{(}\hlstr{'https://raw.githubusercontent.com/KayleeDavisGithub/Graduate_Methods_Handbook/master/data/2017_11_AskSocialScience_comments.csv'}\hlstd{)}
\hlstd{> }\hlstd{comments2}\hlopt{$}\hlstd{id2} \hlkwb{<-} \hlkwd{paste}\hlstd{(}\hlstr{"t1_"}\hlstd{, comments2}\hlopt{$}\hlstd{id,} \hlkwc{sep}\hlstd{=}\hlstr{""}\hlstd{)}
\hlstd{> }\hlstd{posts2}\hlopt{$}\hlstd{id2} \hlkwb{<-} \hlkwd{paste}\hlstd{(}\hlstr{"t3_"}\hlstd{, posts2}\hlopt{$}\hlstd{id,} \hlkwc{sep}\hlstd{=}\hlstr{""}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{for_el2} \hlkwb{<-} \hlkwd{data.frame}\hlstd{(}
\hlstd{+ }     \hlkwc{author} \hlstd{=} \hlkwd{c}\hlstd{(}\hlkwd{as.character}\hlstd{(posts2}\hlopt{$}\hlstd{author),} \hlkwd{as.character}\hlstd{(comments2}\hlopt{$}\hlstd{author)),}
\hlstd{+ }     \hlkwc{id} \hlstd{=} \hlkwd{c}\hlstd{(}\hlkwd{as.character}\hlstd{(posts2}\hlopt{$}\hlstd{id2),} \hlkwd{as.character}\hlstd{(comments2}\hlopt{$}\hlstd{id2)),}
\hlstd{+ }     \hlkwc{parent_id} \hlstd{=} \hlkwd{c}\hlstd{(}\hlkwd{rep}\hlstd{(}\hlnum{NA}\hlstd{,} \hlkwd{dim}\hlstd{(posts2)[}\hlnum{1}\hlstd{]),} \hlkwd{as.character}\hlstd{(comments2}\hlopt{$}\hlstd{parent_id))}
\hlstd{+ }\hlstd{)}
\hlstd{> }\hlstd{for_el2} \hlkwb{<-} \hlstd{for_el2[for_el2}\hlopt{$}\hlstd{author}\hlopt{!=}\hlstr{"[deleted]"}\hlstd{,]}
\hlstd{> }\hlstd{el12} \hlkwb{<-} \hlkwd{inner_join}\hlstd{(for_el2, for_el2,} \hlkwd{c}\hlstd{(}\hlstr{"parent_id"} \hlstd{=} \hlstr{"id"}\hlstd{))}
\hlstd{> }\hlstd{el2} \hlkwb{<-} \hlkwd{data.frame}\hlstd{(}\hlkwc{auth1} \hlstd{= el12}\hlopt{$}\hlstd{author.x,} \hlkwc{auth2} \hlstd{= el12}\hlopt{$}\hlstd{author.y)}
\hlstd{> }\hlstd{el2} \hlkwb{<-} \hlkwd{as.matrix}\hlstd{(el2)}
\end{alltt}
\end{kframe}
\end{knitrout}

Now that we have the data read in and cleaned (mostly tracking the id numbers), I'll combine the two months and plot the network object that we'll be using for the rest of this section.

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Stack one edge list on top of the other:}
\hlstd{> }\hlstd{edge.list} \hlkwb{<-} \hlkwd{rbind}\hlstd{(el, el2)}
\hlstd{> }
\hlstd{> }\hlstd{graph.object} \hlkwb{<-} \hlkwd{graph_from_edgelist}\hlstd{(edge.list)}
\hlstd{> }\hlkwd{summary}\hlstd{(graph.object)} \hlcom{# Basic statistics seem okay}
\hlstd{> }
\hlstd{> }\hlcom{# Grabbing the largest component:}
\hlstd{> }\hlstd{giant.component} \hlkwb{<-} \hlkwa{function}\hlstd{(}\hlkwc{graph}\hlstd{) \{}
\hlstd{+ }     \hlstd{cl} \hlkwb{<-} \hlkwd{clusters}\hlstd{(graph)}
\hlstd{+ }     \hlkwd{induced.subgraph}\hlstd{(graph,} \hlkwd{which}\hlstd{(cl}\hlopt{$}\hlstd{membership} \hlopt{==} \hlkwd{which.max}\hlstd{(cl}\hlopt{$}\hlstd{csize)))}
\hlstd{+ }\hlstd{\}}
\hlstd{> }
\hlstd{> }\hlstd{l.graph.object} \hlkwb{<-} \hlkwd{giant.component}\hlstd{(graph.object)}
\hlstd{> }
\hlstd{> }\hlcom{# Let's graph it}
\hlstd{> }\hlkwd{par}\hlstd{(}\hlkwc{mfrow}\hlstd{=}\hlkwd{c}\hlstd{(}\hlnum{1}\hlstd{,}\hlnum{2}\hlstd{))}
\hlstd{> }\hlkwd{plot.igraph}\hlstd{(graph.object,}
\hlstd{+ }            \hlkwc{vertex.color}\hlstd{=}\hlstr{"gray15"}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.size}\hlstd{=}\hlnum{2.7}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.label}\hlstd{=}\hlnum{NA}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.shape}\hlstd{=}\hlstr{"circle"}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.arrow.size}\hlstd{=}\hlnum{0.4}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.arrow.width}\hlstd{=}\hlnum{.6}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.width}\hlstd{=}\hlnum{1.5}\hlstd{)}
\hlstd{> }\hlkwd{title}\hlstd{(}\hlstr{"\textbackslash{}n October:November; 2017"}\hlstd{,}
\hlstd{+ }      \hlkwc{cex.main}\hlstd{=}\hlnum{1}\hlstd{,} \hlkwc{col.main}\hlstd{=}\hlstr{"gray10"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlkwd{plot.igraph}\hlstd{(l.graph.object,}
\hlstd{+ }            \hlkwc{vertex.color}\hlstd{=}\hlstr{"gray15"}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.size}\hlstd{=}\hlnum{2.7}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.label}\hlstd{=}\hlnum{NA}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.shape}\hlstd{=}\hlstr{"circle"}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.arrow.size}\hlstd{=}\hlnum{0.4}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.arrow.width}\hlstd{=}\hlnum{.6}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.width}\hlstd{=}\hlnum{1.5}\hlstd{)}
\hlstd{> }\hlkwd{title}\hlstd{(}\hlstr{"\textbackslash{}n Largest Component"}\hlstd{,}
\hlstd{+ }      \hlkwc{cex.main}\hlstd{=}\hlnum{1}\hlstd{,} \hlkwc{col.main}\hlstd{=}\hlstr{"gray10"}\hlstd{)}
\hlstd{> }\hlkwd{par}\hlstd{(}\hlkwc{mfrow}\hlstd{=}\hlkwd{c}\hlstd{(}\hlnum{1}\hlstd{,}\hlnum{1}\hlstd{))}
\end{alltt}
\end{kframe}
\end{knitrout}
\end{center}

We can examine some measures of centrality from this network (using the full network instead of largest component). I'll calculate the degree, the inward degree, and outward degree. Then, I find the summary statistics and plot all of these in one concise plot.

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# For this assignment, we are only interested in large component:}
\hlstd{> }\hlstd{l_graph.object} \hlkwb{<-} \hlkwd{as_edgelist}\hlstd{(l.graph.object)}
\hlstd{> }\hlcom{# --}
\hlstd{> }\hlstd{degree} \hlkwb{<-} \hlkwd{degree}\hlstd{(l.graph.object)}
\hlstd{> }\hlstd{in.degree} \hlkwb{<-} \hlkwd{degree}\hlstd{(l.graph.object,} \hlkwc{mode} \hlstd{=} \hlstr{'in'}\hlstd{)}
\hlstd{> }\hlstd{out.degree} \hlkwb{<-} \hlkwd{degree}\hlstd{(l.graph.object,} \hlkwc{mode} \hlstd{=} \hlstr{'out'}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlcom{# Summary Statistics:}
\hlstd{> }\hlkwd{summary}\hlstd{(out.degree)}
\hlstd{> }\hlkwd{summary}\hlstd{(in.degree)}
\hlstd{> }\hlkwd{summary}\hlstd{(degree)}
\hlstd{> }
\hlstd{> }\hlkwd{sd}\hlstd{(out.degree)}
\hlstd{> }\hlkwd{sd}\hlstd{(in.degree)}
\hlstd{> }\hlkwd{sd}\hlstd{(degree)}
\hlstd{> }
\hlstd{> }\hlcom{# Grammar of Graphics:}
\hlstd{> }\hlkwd{library}\hlstd{(ggplot2)}
\hlstd{> }\hlkwd{library}\hlstd{(gridExtra)}
\hlstd{> }\hlkwd{library}\hlstd{(grid)}
\hlstd{> }
\hlstd{> }\hlstd{p1} \hlkwb{<-} \hlkwd{qplot}\hlstd{(out.degree)} \hlopt{+}
\hlstd{+ }     \hlkwd{theme_bw}\hlstd{()} \hlopt{+}
\hlstd{+ }     \hlkwd{xlab}\hlstd{(}\hlstr{"Outward Degree"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlkwd{ylab}\hlstd{(}\hlstr{"N"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlkwd{geom_vline}\hlstd{(}\hlkwc{xintercept}\hlstd{=}\hlnum{1.859}\hlstd{,} \hlkwc{linetype}\hlstd{=}\hlstr{"dashed"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlkwd{annotate}\hlstd{(}\hlstr{"text"}\hlstd{,} \hlkwc{x} \hlstd{=} \hlnum{50}\hlstd{,} \hlkwc{y} \hlstd{=} \hlnum{400}\hlstd{,} \hlkwc{label} \hlstd{=} \hlstr{"sd = 3.30"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{p2} \hlkwb{<-} \hlkwd{qplot}\hlstd{(in.degree)} \hlopt{+}
\hlstd{+ }     \hlkwd{theme_bw}\hlstd{()} \hlopt{+}
\hlstd{+ }     \hlkwd{xlab}\hlstd{(}\hlstr{"Inward Degree"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlkwd{ylab}\hlstd{(}\hlstr{"N"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlkwd{geom_vline}\hlstd{(}\hlkwc{xintercept}\hlstd{=}\hlnum{1.859}\hlstd{,} \hlkwc{linetype}\hlstd{=}\hlstr{"dashed"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlkwd{annotate}\hlstd{(}\hlstr{"text"}\hlstd{,} \hlkwc{x} \hlstd{=} \hlnum{16}\hlstd{,} \hlkwc{y} \hlstd{=} \hlnum{213}\hlstd{,} \hlkwc{label} \hlstd{=} \hlstr{"sd = 2.23"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlstd{p3} \hlkwb{<-} \hlkwd{qplot}\hlstd{(degree)} \hlopt{+}
\hlstd{+ }     \hlkwd{theme_bw}\hlstd{()} \hlopt{+}
\hlstd{+ }     \hlkwd{xlab}\hlstd{(}\hlstr{"Degree"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlkwd{ylab}\hlstd{(}\hlstr{"N"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlkwd{geom_vline}\hlstd{(}\hlkwc{xintercept}\hlstd{=}\hlnum{3.718}\hlstd{,} \hlkwc{linetype}\hlstd{=}\hlstr{"dashed"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlkwd{annotate}\hlstd{(}\hlstr{"text"}\hlstd{,} \hlkwc{x} \hlstd{=} \hlnum{61}\hlstd{,} \hlkwc{y} \hlstd{=} \hlnum{214}\hlstd{,} \hlkwc{label} \hlstd{=} \hlstr{"sd = 4.76"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlkwd{grid.arrange}\hlstd{(}
\hlstd{+ }     \hlstd{p1, p2, p3,}
\hlstd{+ }     \hlcom{# Graphing Matrix:}
\hlstd{+ }     \hlkwc{widths} \hlstd{=} \hlkwd{c}\hlstd{(}\hlnum{.5}\hlstd{,} \hlnum{.9} \hlstd{,}\hlnum{2}\hlstd{,} \hlnum{2}\hlstd{,} \hlnum{.9}\hlstd{,} \hlnum{.5}\hlstd{),}
\hlstd{+ }     \hlkwc{layout_matrix} \hlstd{=} \hlkwd{rbind}\hlstd{(}\hlkwd{c}\hlstd{(}\hlnum{NA}\hlstd{,} \hlnum{1}\hlstd{,} \hlnum{1}\hlstd{,} \hlnum{2}\hlstd{,} \hlnum{2}\hlstd{,} \hlnum{NA}\hlstd{),}
\hlstd{+ }                           \hlkwd{c}\hlstd{(}\hlnum{NA}\hlstd{,} \hlnum{NA}\hlstd{,} \hlnum{3}\hlstd{,} \hlnum{3}\hlstd{,} \hlnum{NA}\hlstd{,} \hlnum{NA}\hlstd{)),}
\hlstd{+ }     \hlkwc{top} \hlstd{=} \hlstr{"Network Degree Distributions;
          \textbackslash{}n Oct : Nov'r/AskSocialScientists' Reddit Data."}\hlstd{,}
\hlstd{+ }     \hlcom{# Any citations:}
\hlstd{+ }     \hlkwc{bottom} \hlstd{=} \hlkwd{textGrob}\hlstd{(}
\hlstd{+ }          \hlstr{"Mean Reported by Dashed Line.
          \textbackslash{}n All Medians = 1 except 'Degree' which = 2 "}\hlstd{,}
\hlstd{+ }          \hlkwc{gp} \hlstd{=} \hlkwd{gpar}\hlstd{(}\hlkwc{fontface} \hlstd{=} \hlnum{3}\hlstd{,} \hlkwc{fontsize} \hlstd{=} \hlnum{8}\hlstd{),}
\hlstd{+ }          \hlkwc{hjust} \hlstd{=} \hlnum{1}\hlstd{,}
\hlstd{+ }          \hlkwc{x} \hlstd{=} \hlnum{1}
\hlstd{+ }     \hlstd{)}
\hlstd{+ }\hlstd{)}
\end{alltt}
\end{kframe}
\end{knitrout}
\end{center}


The next part was difficult, and probably could be done better. I looked at a list of the ordered centrality measures, then created an edge-graph and looked at those lists similarly. We can see from the lists that some names pop up more often then others (MoralMidgetry, apaniyam, Atriox998), but there has to be some code to get the ``max'' or to highlight those with the largest degree more clearly. How might we code that? \index{ggplot}

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{### Centrality measures:}
\hlstd{> }\hlstd{lg_graph.object} \hlkwb{<-} \hlkwd{line.graph}\hlstd{(graph.object)}
\hlstd{> }
\hlstd{> }\hlcom{## closeness centrality}
\hlstd{> }\hlstd{c.graph.object} \hlkwb{<-} \hlkwd{closeness}\hlstd{(graph.object)}
\hlstd{> }\hlkwd{summary}\hlstd{(c.graph.object)}
\hlstd{> }\hlkwd{E}\hlstd{(graph.object)[}\hlkwd{order}\hlstd{(c.graph.object,} \hlkwc{decreasing}\hlstd{=T)[}\hlnum{1}\hlopt{:}\hlnum{10}\hlstd{]]}
\hlstd{> }
\hlstd{> }\hlstd{c.lg.graph.object} \hlkwb{<-} \hlkwd{closeness}\hlstd{(lg_graph.object)}
\hlstd{> }\hlkwd{E}\hlstd{(graph.object)[}\hlkwd{order}\hlstd{(c.lg.graph.object,} \hlkwc{decreasing}\hlstd{=T)[}\hlnum{1}\hlopt{:}\hlnum{10}\hlstd{]]}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlcom{## betweenness centrality}
\hlstd{> }\hlstd{b.graph.object} \hlkwb{<-} \hlkwd{betweenness}\hlstd{(graph.object)}
\hlstd{> }\hlkwd{summary}\hlstd{(b.graph.object)}
\hlstd{> }\hlkwd{E}\hlstd{(graph.object)[}\hlkwd{order}\hlstd{(b.graph.object,} \hlkwc{decreasing}\hlstd{=T)[}\hlnum{1}\hlopt{:}\hlnum{10}\hlstd{]]}
\hlstd{> }
\hlstd{> }\hlstd{b.lg.graph.object} \hlkwb{<-} \hlkwd{betweenness}\hlstd{(lg_graph.object)}
\hlstd{> }\hlkwd{E}\hlstd{(graph.object)[}\hlkwd{order}\hlstd{(b.lg.graph.object,} \hlkwc{decreasing}\hlstd{=T)[}\hlnum{1}\hlopt{:}\hlnum{10}\hlstd{]]}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlcom{## eigenvector centrality}
\hlstd{> }\hlstd{e.graph.object} \hlkwb{<-} \hlkwd{evcent}\hlstd{(graph.object)}
\hlstd{> }\hlkwd{summary}\hlstd{(e.graph.object}\hlopt{$}\hlstd{vector)}
\hlstd{> }\hlkwd{E}\hlstd{(graph.object)[}\hlkwd{order}\hlstd{(e.graph.object}\hlopt{$}\hlstd{vector,} \hlkwc{decreasing}\hlstd{=T)[}\hlnum{1}\hlopt{:}\hlnum{10}\hlstd{]]}
\hlstd{> }
\hlstd{> }\hlstd{evc_lg_graph.object} \hlkwb{<-} \hlkwd{evcent}\hlstd{(lg_graph.object)}
\hlstd{> }\hlkwd{E}\hlstd{(graph.object)[}\hlkwd{order}\hlstd{(evc_lg_graph.object}\hlopt{$}\hlstd{vector,} \hlkwc{decreasing}\hlstd{=T)[}\hlnum{1}\hlopt{:}\hlnum{10}\hlstd{]]}
\end{alltt}
\end{kframe}
\end{knitrout}

At least from above we know where to start looking for central nodes within our data. Following this, I compare each measure of centrality by generating a matrix of correlation values, then plot it.

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Let's make a matrix of just our values, look at the correlation between them.}
\hlstd{> }\hlstd{vec.degree} \hlkwb{<-} \hlkwd{as.vector}\hlstd{(degree)}
\hlstd{> }\hlstd{vec.in.degree} \hlkwb{<-} \hlkwd{as.vector}\hlstd{(in.degree)}
\hlstd{> }\hlstd{vec.out.degree} \hlkwb{<-} \hlkwd{as.vector}\hlstd{(out.degree)}
\hlstd{> }\hlstd{vec.c.graph.object} \hlkwb{<-} \hlkwd{as.vector}\hlstd{(c.graph.object)}
\hlstd{> }\hlstd{vec.b.graph.object} \hlkwb{<-} \hlkwd{as.vector}\hlstd{(b.graph.object)}
\hlstd{> }\hlstd{vec.e.graph.object} \hlkwb{<-} \hlkwd{as.vector}\hlstd{(e.graph.object}\hlopt{$}\hlstd{vector)}
\hlstd{> }
\hlstd{> }\hlstd{Cor.Object} \hlkwb{<-} \hlkwd{matrix}\hlstd{(}\hlkwd{c}\hlstd{(vec.degree,}
\hlstd{+ }                       \hlstd{vec.in.degree,}
\hlstd{+ }                       \hlstd{vec.out.degree,}
\hlstd{+ }                       \hlstd{vec.c.graph.object,}
\hlstd{+ }                       \hlstd{vec.b.graph.object,}
\hlstd{+ }                       \hlstd{vec.e.graph.object,}
\hlstd{+ }                       \hlkwc{ncol} \hlstd{=} \hlnum{6}\hlstd{))}
\hlstd{> }
\hlstd{> }\hlkwd{colnames}\hlstd{(Cor.Object)} \hlkwb{<-} \hlkwd{c}\hlstd{(}\hlstr{"Degree"}\hlstd{,} \hlstr{"In Degree"}\hlstd{,} \hlstr{"Out Degree"}\hlstd{,}
\hlstd{+ }                         \hlstr{"Closeness"}\hlstd{,} \hlstr{"Betweeness"}\hlstd{,} \hlstr{"Eigenvector"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlkwd{cor}\hlstd{(Cor.Object)}
\hlstd{> }
\hlstd{> }\hlcom{# Trying to think of cool ways to plot this:}
\hlstd{> }\hlkwd{library}\hlstd{(corrplot)}
\hlstd{> }\hlstd{x} \hlkwb{<-} \hlkwd{cor}\hlstd{(Cor.Object)}
\hlstd{> }\hlkwd{corrplot}\hlstd{(x,} \hlkwc{type}\hlstd{=}\hlstr{"upper"}\hlstd{,} \hlkwc{order}\hlstd{=}\hlstr{"hclust"}\hlstd{)}
\end{alltt}
\end{kframe}
\end{knitrout}
\end{center}


I find it easier to think about correlation by looking at the plot (albeit a very rough plot). The two ``darkest'' or most correlated measures was the in-degree with degree, and the degree with the out-degree. This makes sense because the degree is encapsulating both of those measures. All measures are positively correlated, except the eigenvector centrality measure compared to closeness and betweeness. This is likely because of the different assumptions and properties each of these measures have. For example, eigenvector centrality Trafic moves along unrestricted walks, Trafic can effect subsequent nodes simultaneously, and eigenvector centrality measures long-term and indirect risks. Other measures may not have these properties, so it is probably best that they are not too closely correlated.


%--------------------------------------
\subsubsection{Data Viz}

Perhaps now is a good opportunity to talk about data visualization. Using the data from the previous section on centrality:
In this I will be using the Reddit data from "r/AskSocialScientists" from October and November. These will be ran separately, and I will look into their largest components. Then, I will plot the degrees in two different ways.

\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Using the data set up from the previous section:}
\hlstd{> }\hlcom{##    Oct:}
\hlstd{> }\hlkwd{library}\hlstd{(igraph)}
\hlstd{> }\hlstd{g1} \hlkwb{<-} \hlkwd{graph_from_edgelist}\hlstd{(el)}
\hlstd{> }\hlkwd{summary}\hlstd{(g1)} \hlcom{#}
\end{alltt}
\begin{verbatim}
## IGRAPH 6d4e071 DN-- 339 521 -- 
## + attr: name (v/c)
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{#---------------------------------------------------------------------------}
\hlstd{> }\hlcom{##   Nov:}
\hlstd{> }\hlstd{g12} \hlkwb{<-} \hlkwd{graph_from_edgelist}\hlstd{(el2)}
\hlstd{> }\hlkwd{summary}\hlstd{(g12)} \hlcom{#}
\end{alltt}
\begin{verbatim}
## IGRAPH 6d4e41b DN-- 327 522 -- 
## + attr: name (v/c)
\end{verbatim}
\end{kframe}
\end{knitrout}

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlkwd{set.seed}\hlstd{(}\hlnum{8675309}\hlstd{)}  \hlcom{# 1981 throwback seed}
\hlstd{> }
\hlstd{> }\hlkwd{par}\hlstd{(}\hlkwc{mfrow}\hlstd{=}\hlkwd{c}\hlstd{(}\hlnum{1}\hlstd{,}\hlnum{2}\hlstd{))}
\hlstd{> }\hlkwd{plot.igraph}\hlstd{(g1,}
\hlstd{+ }            \hlkwc{vertex.color}\hlstd{=}\hlstr{"gray15"}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.size}\hlstd{=}\hlnum{2.7}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.label}\hlstd{=}\hlnum{NA}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.shape}\hlstd{=}\hlstr{"circle"}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.arrow.size}\hlstd{=}\hlnum{0.4}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.arrow.width}\hlstd{=}\hlnum{.6}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.width}\hlstd{=}\hlnum{1.5}\hlstd{)}
\hlstd{> }\hlkwd{title}\hlstd{(}\hlstr{"\textbackslash{}n October; 2017"}\hlstd{,}
\hlstd{+ }      \hlkwc{cex.main}\hlstd{=}\hlnum{1}\hlstd{,} \hlkwc{col.main}\hlstd{=}\hlstr{"gray10"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlkwd{plot.igraph}\hlstd{(g12,}
\hlstd{+ }            \hlkwc{vertex.color}\hlstd{=}\hlstr{"gray15"}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.size}\hlstd{=}\hlnum{2.7}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.label}\hlstd{=}\hlnum{NA}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.shape}\hlstd{=}\hlstr{"circle"}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.arrow.size}\hlstd{=}\hlnum{0.4}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.arrow.width}\hlstd{=}\hlnum{.6}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.width}\hlstd{=}\hlnum{1.5}\hlstd{)}
\hlstd{> }\hlkwd{title}\hlstd{(}\hlstr{"\textbackslash{}n November; 2017"}\hlstd{,}
\hlstd{+ }      \hlkwc{cex.main}\hlstd{=}\hlnum{1}\hlstd{,} \hlkwc{col.main}\hlstd{=}\hlstr{"gray10"}\hlstd{)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/plot1-1} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlkwd{par}\hlstd{(}\hlkwc{mfrow}\hlstd{=}\hlkwd{c}\hlstd{(}\hlnum{1}\hlstd{,}\hlnum{1}\hlstd{))} \hlcom{# basic reset}
\end{alltt}
\end{kframe}
\end{knitrout}
\end{center}

Above we have both of our complete networks for both months. In these graphs we simply have users (nodes) and if they have commented on each other's posts (edges). This may include some information that is less interesting, like users that have no comments. Below we will take the two largest components of each network and plot it.

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlstd{giant.component} \hlkwb{<-} \hlkwa{function}\hlstd{(}\hlkwc{graph}\hlstd{)\{}
\hlstd{+ }     \hlstd{cl} \hlkwb{<-} \hlkwd{clusters}\hlstd{(graph)}
\hlstd{+ }     \hlkwd{induced.subgraph}\hlstd{(graph,} \hlkwd{which}\hlstd{(cl}\hlopt{$}\hlstd{membership} \hlopt{==} \hlkwd{which.max}\hlstd{(cl}\hlopt{$}\hlstd{csize)))}
\hlstd{+ }\hlstd{\}}
\hlstd{> }
\hlstd{> }\hlstd{g2} \hlkwb{<-} \hlkwd{giant.component}\hlstd{(g1)}
\hlstd{> }\hlstd{g22} \hlkwb{<-} \hlkwd{giant.component}\hlstd{(g12)}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlkwd{par}\hlstd{(}\hlkwc{mfrow}\hlstd{=}\hlkwd{c}\hlstd{(}\hlnum{1}\hlstd{,}\hlnum{2}\hlstd{))}
\hlstd{> }\hlkwd{plot.igraph}\hlstd{(g2,}
\hlstd{+ }            \hlkwc{vertex.color}\hlstd{=}\hlstr{"gray15"}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.size}\hlstd{=}\hlnum{2.7}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.label}\hlstd{=}\hlnum{NA}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.shape}\hlstd{=}\hlstr{"circle"}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.arrow.size}\hlstd{=}\hlnum{0.4}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.arrow.width}\hlstd{=}\hlnum{.6}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.width}\hlstd{=}\hlnum{1.5}\hlstd{)}
\hlstd{> }\hlkwd{title}\hlstd{(}\hlstr{"\textbackslash{}n October; 2017"}\hlstd{,}
\hlstd{+ }      \hlkwc{cex.main}\hlstd{=}\hlnum{1}\hlstd{,} \hlkwc{col.main}\hlstd{=}\hlstr{"gray10"}\hlstd{)}
\hlstd{> }
\hlstd{> }\hlkwd{plot.igraph}\hlstd{(g22,}
\hlstd{+ }            \hlkwc{vertex.color}\hlstd{=}\hlstr{"gray15"}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.size}\hlstd{=}\hlnum{2.7}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.label}\hlstd{=}\hlnum{NA}\hlstd{,}
\hlstd{+ }            \hlkwc{vertex.shape}\hlstd{=}\hlstr{"circle"}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.arrow.size}\hlstd{=}\hlnum{0.4}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.arrow.width}\hlstd{=}\hlnum{.6}\hlstd{,}
\hlstd{+ }            \hlkwc{edge.width}\hlstd{=}\hlnum{1.5}\hlstd{)}
\hlstd{> }\hlkwd{title}\hlstd{(}\hlstr{"\textbackslash{}n November; 2017"}\hlstd{,}
\hlstd{+ }      \hlkwc{cex.main}\hlstd{=}\hlnum{1}\hlstd{,} \hlkwc{col.main}\hlstd{=}\hlstr{"gray10"}\hlstd{)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/plot2-1} 
\end{knitrout}
\end{center}

For the above, I have chosen to keep plots simple and not too complex to over complicate interpretation. In a paper these graphs would likely print and be easily read. Some things that I may consider changing is making the network bigger, and to have directionality more clear.\\

This is, of course, not the only information we can gain from a network. Below is a plot of the network degrees. A network "degree" is the number of connections each node has - a useful statistic. The following graphs intended purpose is to report the mean, the nodes, and edges in addition to the distribution of degrees in a network.

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlstd{Degree} \hlkwb{<-} \hlkwd{degree}\hlstd{(g2)}
\end{alltt}


{\ttfamily\noindent\bfseries\color{errorcolor}{\#\# Error in FUN(X[[i]], ...): as.edgelist.sna input must be an adjacency matrix/array, edgelist matrix, network, or sparse matrix, or list thereof.}}\begin{alltt}
\hlstd{> }\hlkwd{mean}\hlstd{(Degree)}
\end{alltt}


{\ttfamily\noindent\bfseries\color{errorcolor}{\#\# Error in h(simpleError(msg, call)): error in evaluating the argument 'x' in selecting a method for function 'mean': object 'Degree' not found}}\begin{alltt}
\hlstd{> }\hlkwd{library}\hlstd{(ggplot2)}
\hlstd{> }\hlkwd{qplot}\hlstd{(Degree)} \hlopt{+}
\hlstd{+ }     \hlkwd{theme_bw}\hlstd{()} \hlopt{+}
\hlstd{+ }     \hlkwd{ylab}\hlstd{(}\hlstr{"N"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlkwd{xlab}\hlstd{(}\hlstr{"Degrees"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlcom{# ggtitle("Degrees in Large Component of Network 1")+}
\hlstd{+ }     \hlkwd{ggtitle}\hlstd{(}\hlkwd{substitute}\hlstd{(}
\hlstd{+ }          \hlkwd{paste}\hlstd{(} \hlstr{"Large Component Degrees, with: "}\hlstd{, N[V],} \hlstr{"="}\hlstd{,} \hlnum{231}\hlstd{,}
\hlstd{+ }                 \hlstr{" and "}\hlstd{, N[E],} \hlstr{"="}\hlstd{,} \hlnum{404}\hlstd{)))} \hlopt{+}
\hlstd{+ }     \hlkwd{annotate}\hlstd{(}\hlstr{"text"}\hlstd{,} \hlkwc{x} \hlstd{=} \hlnum{35.4}\hlstd{,} \hlkwc{y} \hlstd{=} \hlnum{3.7}\hlstd{,} \hlkwc{label} \hlstd{=} \hlstr{"35"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlkwd{geom_vline}\hlstd{(}\hlkwc{xintercept}\hlstd{=}\hlkwd{mean}\hlstd{(Degree),} \hlkwc{linetype}\hlstd{=}\hlstr{"dashed"}\hlstd{)} \hlopt{+}
\hlstd{+ }     \hlkwd{annotate}\hlstd{(}\hlstr{"text"}\hlstd{,} \hlkwc{x} \hlstd{=} \hlnum{4.3}\hlstd{,} \hlkwc{y} \hlstd{=} \hlnum{71}\hlstd{,}
\hlstd{+ }              \hlkwc{label} \hlstd{=} \hlkwd{round}\hlstd{(}\hlkwd{mean}\hlstd{(Degree),}\hlnum{3}\hlstd{),}
\hlstd{+ }              \hlkwc{angle}\hlstd{=}\hlopt{-}\hlnum{90}\hlstd{)}
\end{alltt}


{\ttfamily\noindent\bfseries\color{errorcolor}{\#\# Error in eval\_tidy(mapping\$x, data, caller\_env): object 'Degree' not found}}\end{kframe}
\end{knitrout}
\end{center}

\subsection{Assortativity and Community Structures}

\begin{center}
\begin{knitrout}
\definecolor{shadecolor}{rgb}{0.165, 0.169, 0.184}\color{fgcolor}\begin{kframe}
\begin{alltt}
\hlstd{> }\hlcom{# Let's expand on the homopholy measurements from Session_5.R}
\hlstd{> }\hlcom{# We'll use Zachary's karate club data again:}
\hlstd{> }
\hlstd{> }\hlkwd{library}\hlstd{(igraph)}
\hlstd{> }\hlkwd{library}\hlstd{(igraphdata)}
\hlstd{> }\hlkwd{library}\hlstd{(ape)}
\hlstd{> }\hlcom{# this package will help us easily plot the dendrograms for community detection}
\hlstd{> }\hlcom{# algorithms that use hierarchical clustering}
\hlstd{> }\hlkwd{library}\hlstd{(Matrix)}
\hlstd{> }\hlcom{# this package gives us the image() function for visualizing adjacency matrices}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlkwd{data}\hlstd{(}\hlstr{"karate"}\hlstd{)}
\hlstd{> }\hlkwd{summary}\hlstd{(karate)} \hlcom{#karate$Citation   is attached to this data remember}
\end{alltt}
\begin{verbatim}
## IGRAPH 4b458a1 UNW- 34 78 -- Zachary's karate club network
## + attr: name (g/c), Citation (g/c), Author (g/c), Faction (v/n), name
## | (v/c), label (v/c), color (v/n), weight (e/n)
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlstd{frlay} \hlkwb{<-} \hlkwd{layout_with_fr}\hlstd{(karate)} \hlcom{# preset coordinates generated for us...}
\hlstd{> }\hlcom{# this will ensure that each time we plot the network,}
\hlstd{> }\hlcom{# the location of the nodes stays constant}
\hlstd{> }\hlkwd{plot}\hlstd{(karate,} \hlkwc{edge.width} \hlstd{=} \hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight,} \hlkwc{layout} \hlstd{= frlay)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/Assort-1} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{## Components}
\hlstd{> }\hlcom{#  Networks are made up of components, and isolated individuals.}
\hlstd{> }\hlcom{#  You can identify the components of a graph with decompose.graph()}
\hlstd{> }\hlcom{#  This gives a potentially long list of each component.}
\hlstd{> }\hlcom{#  So, table(sapply(decompose.graph(yournetwork),vcount)) will give you}
\hlstd{> }\hlcom{#  a quick summary of the size and number of components.}
\hlstd{> }
\hlstd{> }\hlkwd{is_connected}\hlstd{(karate)}  \hlcom{# There is only one component within this network.}
\end{alltt}
\begin{verbatim}
## [1] TRUE
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## Cores (k)}
\hlstd{> }\hlcom{#   We could peel away layers of a network, by those who are weekly laching}
\hlstd{> }\hlcom{#   on (degree of 1) all the way inwards (k-cores). We could consider these}
\hlstd{> }\hlcom{#   layers individually, or all at once by seeing the greatest k-core for}
\hlstd{> }\hlcom{#   each node}
\hlstd{> }
\hlstd{> }\hlkwd{coreness}\hlstd{(karate)}
\end{alltt}
\begin{verbatim}
##    Mr Hi  Actor 2  Actor 3  Actor 4  Actor 5  Actor 6  Actor 7  Actor 8 
##        4        4        4        4        3        3        3        4 
##  Actor 9 Actor 10 Actor 11 Actor 12 Actor 13 Actor 14 Actor 15 Actor 16 
##        4        2        3        1        2        4        2        2 
## Actor 17 Actor 18 Actor 19 Actor 20 Actor 21 Actor 22 Actor 23 Actor 24 
##        2        2        2        3        2        2        2        3 
## Actor 25 Actor 26 Actor 27 Actor 28 Actor 29 Actor 30 Actor 31 Actor 32 
##        3        3        2        3        3        3        4        3 
## Actor 33   John A 
##        4        4
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlstd{colors} \hlkwb{<-} \hlkwd{rainbow}\hlstd{(}\hlkwd{max}\hlstd{(}\hlnum{4}\hlstd{))}
\hlstd{> }
\hlstd{> }\hlkwd{plot}\hlstd{(karate,}
\hlstd{+ }     \hlkwc{vertex.color} \hlstd{= colors[}\hlkwd{coreness}\hlstd{(karate)],}
\hlstd{+ }     \hlkwc{edge.width} \hlstd{=} \hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight,}
\hlstd{+ }     \hlkwc{layout} \hlstd{= frlay)}
\hlstd{> }\hlkwd{legend}\hlstd{(}\hlstr{"topright"}\hlstd{,}
\hlstd{+ }       \hlkwc{legend}\hlstd{=}\hlkwd{c}\hlstd{(}\hlnum{1}\hlopt{:}\hlnum{4}\hlstd{),}
\hlstd{+ }       \hlkwc{col} \hlstd{= colors,}
\hlstd{+ }       \hlkwc{pch} \hlstd{=} \hlnum{16}\hlstd{,}
\hlstd{+ }       \hlkwc{title} \hlstd{=} \hlstr{"Coreness"}\hlstd{)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/Assort-2} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{## Cliques}
\hlstd{> }\hlcom{#   These are the maximal connected subgraphs.}
\hlstd{> }\hlcom{#   Note: we can relax the definition of this by including non-connected nodes}
\hlstd{> }\hlcom{#   (but at short distance "n") igraph does not have this functionality (n=1).}
\hlstd{> }\hlcom{# Visual definition of Clique:}
\hlstd{> }\hlcom{#https://en.wikipedia.org/wiki/Clique_(graph_theory)#/media/File:VR_complex.svg}
\hlstd{> }
\hlstd{> }\hlkwd{head}\hlstd{(}\hlkwd{cliques}\hlstd{(karate,} \hlkwc{min}\hlstd{=}\hlnum{3}\hlstd{))} \hlcom{# here we excluded cliques below a certain size.}
\end{alltt}
\begin{verbatim}
## [[1]]
## + 3/34 vertices, named, from 4b458a1:
## [1] Mr Hi   Actor 2 Actor 3
## 
## [[2]]
## + 3/34 vertices, named, from 4b458a1:
## [1] Actor 29 Actor 32 John A  
## 
## [[3]]
## + 3/34 vertices, named, from 4b458a1:
## [1] Actor 32 Actor 33 John A  
## 
## [[4]]
## + 3/34 vertices, named, from 4b458a1:
## [1] Actor 31 Actor 33 John A  
## 
## [[5]]
## + 3/34 vertices, named, from 4b458a1:
## [1] Actor 27 Actor 30 John A  
## 
## [[6]]
## + 3/34 vertices, named, from 4b458a1:
## [1] Actor 30 Actor 33 John A
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{table}\hlstd{(}\hlkwd{sapply}\hlstd{(}\hlkwd{cliques}\hlstd{(karate),length))}
\end{alltt}
\begin{verbatim}
## 
##  1  2  3  4  5 
## 34 78 45 11  2
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# This summarizes the full enumeration of cliques, showing us the N of cliques}
\hlstd{> }\hlkwd{largest_cliques}\hlstd{(karate)}
\end{alltt}
\begin{verbatim}
## [[1]]
## + 5/34 vertices, named, from 4b458a1:
## [1] Actor 2 Mr Hi   Actor 4 Actor 3 Actor 8
## 
## [[2]]
## + 5/34 vertices, named, from 4b458a1:
## [1] Actor 2  Mr Hi    Actor 4  Actor 3  Actor 14
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{#### Community detection}
\hlstd{> }\hlcom{#    There are so many ways to chop up a network into related nodes.}
\hlstd{> }\hlcom{#    Generally speaking, we want subsets of nodes that are well connected}
\hlstd{> }\hlcom{#    among them selves, but few connections from outsiders.}
\hlstd{> }\hlcom{#     There are mountains of ways to parse this out mathematically,}
\hlstd{> }\hlcom{#     but with R things can be easier.}
\hlstd{> }
\hlstd{> }\hlcom{### Hierarchical clustering (see Session 4 for some of this).}
\hlstd{> }
\hlstd{> }\hlcom{## Edge Betweenness}
\hlstd{> }\hlcom{#   Calculate betweenness (we did this in centrality session) of each edge,}
\hlstd{> }\hlcom{#   remove the edge (so divide the network along that edge) with the highest}
\hlstd{> }\hlcom{#   betweeness, recalculate betweenness, identify the new highest edge.. repeat}
\hlstd{> }\hlcom{#   Note:  edges with weights get interpreted as additional distance}
\hlstd{> }\hlcom{#          (this is not the case in our network!) have to adjust this}
\hlstd{> }\hlcom{#          calculation to get the weights on the right emphasis.}
\hlstd{> }
\hlstd{> }\hlstd{eb} \hlkwb{<-} \hlkwd{cluster_edge_betweenness}\hlstd{(karate,} \hlkwc{weights} \hlstd{=} \hlnum{1}\hlopt{/}\hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight)}
\hlstd{> }\hlkwd{membership}\hlstd{(eb)}
\end{alltt}
\begin{verbatim}
##    Mr Hi  Actor 2  Actor 3  Actor 4  Actor 5  Actor 6  Actor 7  Actor 8 
##        1        1        1        1        1        1        1        1 
##  Actor 9 Actor 10 Actor 11 Actor 12 Actor 13 Actor 14 Actor 15 Actor 16 
##        1        2        1        1        1        1        2        2 
## Actor 17 Actor 18 Actor 19 Actor 20 Actor 21 Actor 22 Actor 23 Actor 24 
##        1        1        2        1        2        1        2        2 
## Actor 25 Actor 26 Actor 27 Actor 28 Actor 29 Actor 30 Actor 31 Actor 32 
##        2        2        2        2        2        2        2        2 
## Actor 33   John A 
##        2        2
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{sizes}\hlstd{(eb)}
\end{alltt}
\begin{verbatim}
## Community sizes
##  1  2 
## 17 17
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{# library(stats)-used for some alternative plotting options in our dendrograms}
\hlstd{> }
\hlstd{> }\hlkwd{dendPlot}\hlstd{(eb,} \hlkwc{mode} \hlstd{=} \hlstr{"phylo"}\hlstd{)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/Assort-3} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlkwd{plot}\hlstd{(eb, karate,} \hlkwc{edge.width} \hlstd{=} \hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight,} \hlkwc{layout} \hlstd{= frlay)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/Assort-4} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{# by putting the community object (here, "eb") in front of the graph object,}
\hlstd{> }\hlcom{#    igraph knows to plot both. igraph then colors the nodes by their community}
\hlstd{> }\hlcom{#    membership, draws bubbles around each community, and colors edges within}
\hlstd{> }\hlcom{#    communities black and between communities red.}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlcom{## Fast Greedy (Modularity)}
\hlstd{> }\hlcom{#    Similar to "modularity" when we measured assorativity before, this can be}
\hlstd{> }\hlcom{#    used to partition communities. chopping groups up by their assortatitivy}
\hlstd{> }\hlcom{#    scores. Done within, then between all nodes. meaning there are more edges}
\hlstd{> }\hlcom{#    within groups and fewer between them -- then we find communities.}
\hlstd{> }\hlstd{fg} \hlkwb{<-} \hlkwd{cluster_fast_greedy}\hlstd{(karate,} \hlkwc{weights} \hlstd{=} \hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight)}
\hlstd{> }\hlkwd{sizes}\hlstd{(fg)}
\end{alltt}
\begin{verbatim}
## Community sizes
##  1  2  3 
## 18 11  5
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{dendPlot}\hlstd{(fg,} \hlkwc{mode}\hlstd{=}\hlstr{"phylo"}\hlstd{)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/Assort-5} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlkwd{plot}\hlstd{(fg, karate,} \hlkwc{edge.width} \hlstd{=} \hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight,} \hlkwc{layout} \hlstd{= frlay)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/Assort-6} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{## Walktrap}
\hlstd{> }\hlcom{#   imagine doing many, many, short random walks across a network. You'll}
\hlstd{> }\hlcom{#   likely end up staying in a community on each random walk since}
\hlstd{> }\hlcom{#   between-communities ties should be rare to find. So we can use these random}
\hlstd{> }\hlcom{#   walks to find communities (on average) and use that measure as yet another}
\hlstd{> }\hlcom{#   hierarchical clustering process! [consider simulation, machine learning,}
\hlstd{> }\hlcom{#   and ways to take these random walks out of your hands]}
\hlstd{> }
\hlstd{> }\hlstd{wt} \hlkwb{<-} \hlkwd{cluster_walktrap}\hlstd{(karate,} \hlkwc{weights} \hlstd{=} \hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight)} \hlcom{# uses edge weight}
\hlstd{> }\hlkwd{dendPlot}\hlstd{(wt)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/Assort-7} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlkwd{plot}\hlstd{(wt, karate,} \hlkwc{edge.width} \hlstd{=} \hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight,} \hlkwc{layout} \hlstd{= frlay)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/Assort-8} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{### Other approaches:}
\hlstd{> }
\hlstd{> }\hlcom{## Louvain (aka Multilevel)}
\hlstd{> }\hlcom{#   this one is also trying to quickly optimize modularity. Each node here is}
\hlstd{> }\hlcom{#   assigned to a different community, then a node is moved to join one of its}
\hlstd{> }\hlcom{#   neighbors with wich it increases the modularity score. This process of}
\hlstd{> }\hlcom{#   moving nodes around keeps going until modularity cannot be improved anymore.}
\hlstd{> }\hlcom{#   [see Yang et al 2016] - this performs really well.}
\hlstd{> }\hlcom{#   This doesn't classify as a heirarchical community deteticion because it is}
\hlstd{> }\hlcom{#   not strictly agglomerative. (bottom up) compared to "divisive" top-down}
\hlstd{> }\hlcom{#   methodologies.}
\hlstd{> }\hlstd{ml} \hlkwb{<-} \hlkwd{cluster_louvain}\hlstd{(karate,} \hlkwc{weights} \hlstd{=} \hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight)}
\hlstd{> }\hlkwd{plot}\hlstd{(ml, karate,} \hlkwc{edge.width} \hlstd{=} \hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight,} \hlkwc{layout} \hlstd{= frlay)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/Assort-9} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{## InfoMap}
\hlstd{> }\hlcom{#    Improvement on walktrap - draws on information theory}
\hlstd{> }\hlstd{im} \hlkwb{<-} \hlkwd{cluster_infomap}\hlstd{(karate,} \hlkwc{e.weights}\hlstd{=}\hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight)}
\hlstd{> }\hlkwd{plot}\hlstd{(im, karate,} \hlkwc{edge.width} \hlstd{=} \hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight,} \hlkwc{layout} \hlstd{= frlay)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/Assort-10} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{## Spinglass}
\hlstd{> }\hlcom{#     Drawing from physics, and magnetism - a spin glass type of magnet.}
\hlstd{> }\hlcom{#     Each node is similar to an atom, and we want to simulate the annealing}
\hlstd{> }\hlcom{#     process where we minimize energy and this happens when nodes are grouped}
\hlstd{> }\hlcom{#     in communities with the same spin - than different spin groups.}
\hlstd{> }\hlstd{sg} \hlkwb{<-} \hlkwd{cluster_spinglass}\hlstd{(karate,} \hlkwc{weights}\hlstd{=}\hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight)}
\hlstd{> }\hlkwd{plot}\hlstd{(sg, karate,} \hlkwc{edge.width} \hlstd{=} \hlkwd{E}\hlstd{(karate)}\hlopt{$}\hlstd{weight,} \hlkwc{layout} \hlstd{= frlay)}
\end{alltt}
\end{kframe}
\includegraphics[width=5in]{figure/Assort-11} 
\begin{kframe}\begin{alltt}
\hlstd{> }\hlcom{### Which one do I use?!}
\hlstd{> }\hlcom{#     often the "big picture" is the same, but often we'll find small changes}
\hlstd{> }\hlcom{#     between methods. When publishing, it can be better to publish many}
\hlstd{> }\hlcom{#     different methods in a table or easily reportable format.}
\hlstd{> }\hlcom{#     (See Seminar notes for some more information on each of these methods)}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlcom{### Graph Partitions and "Ground Truth"}
\hlstd{> }\hlcom{#     So we can mathematically parse out groups - but how does this align with}
\hlstd{> }\hlcom{#     our theory, and other data? How does this match with our homophily?}
\hlstd{> }
\hlstd{> }\hlcom{# First step: let's calculate assortativity}
\hlstd{> }\hlcom{#      (normalized ---  -1 (disassortive) :  1(assortive) [0 = no evidence])}
\hlstd{> }
\hlstd{> }\hlkwd{modularity}\hlstd{(karate,} \hlkwd{V}\hlstd{(karate)}\hlopt{$}\hlstd{Faction)}
\end{alltt}
\begin{verbatim}
## [1] 0.3714661
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{assortativity}\hlstd{(karate,} \hlkwd{V}\hlstd{(karate)}\hlopt{$}\hlstd{Faction)}
\end{alltt}
\begin{verbatim}
## [1] 0.7434211
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{#  So this assortativity measure is very high... and matches the karate club}
\hlstd{> }\hlcom{#  theory and our knowledge of it. And we've already eye-balled all the graphs,}
\hlstd{> }\hlcom{#  and things seem to line up to these factions.}
\hlstd{> }
\hlstd{> }\hlcom{#  In igraph we can compare() different membership vectors using nmi or}
\hlstd{> }\hlcom{#  "normalized mutual information" 1 = perfect match!  0 = mutually}
\hlstd{> }\hlcom{#  uninformative of one another.}
\hlstd{> }
\hlstd{> }\hlcom{# Compare "Truth" (faction)  with method:}
\hlstd{> }\hlkwd{compare}\hlstd{(}\hlkwd{V}\hlstd{(karate)}\hlopt{$}\hlstd{Faction, eb,} \hlkwc{method} \hlstd{=} \hlstr{"nmi"}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1] 0.8371695
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## [1] 0.8371695}
\hlstd{> }\hlkwd{compare}\hlstd{(}\hlkwd{V}\hlstd{(karate)}\hlopt{$}\hlstd{Faction, fg,} \hlkwc{method} \hlstd{=} \hlstr{"nmi"}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1] 0.8255182
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## [1] 0.8255182}
\hlstd{> }\hlkwd{compare}\hlstd{(}\hlkwd{V}\hlstd{(karate)}\hlopt{$}\hlstd{Faction, wt,} \hlkwc{method} \hlstd{=} \hlstr{"nmi"}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1] 0.6956222
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## [1] 0.6956222}
\hlstd{> }\hlkwd{compare}\hlstd{(}\hlkwd{V}\hlstd{(karate)}\hlopt{$}\hlstd{Faction, ml,} \hlkwc{method} \hlstd{=} \hlstr{"nmi"}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1] 0.6872629
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## [1] 0.6872629}
\hlstd{> }\hlkwd{compare}\hlstd{(}\hlkwd{V}\hlstd{(karate)}\hlopt{$}\hlstd{Faction, im,} \hlkwc{method} \hlstd{=} \hlstr{"nmi"}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1] 0.8255182
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## [1] 0.8255182}
\hlstd{> }\hlkwd{compare}\hlstd{(}\hlkwd{V}\hlstd{(karate)}\hlopt{$}\hlstd{Faction, sg,} \hlkwc{method} \hlstd{=} \hlstr{"nmi"}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1] 0.6872629
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## [1] 0.6543404}
\hlstd{> }\hlkwd{table}\hlstd{(}\hlkwd{V}\hlstd{(karate)}\hlopt{$}\hlstd{Faction,} \hlkwd{membership}\hlstd{(eb))}
\end{alltt}
\begin{verbatim}
##    
##      1  2
##   1 16  0
##   2  1 17
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{table}\hlstd{(}\hlkwd{V}\hlstd{(karate)}\hlopt{$}\hlstd{Faction,} \hlkwd{membership}\hlstd{(fg))}
\end{alltt}
\begin{verbatim}
##    
##      1  2  3
##   1  0 11  5
##   2 18  0  0
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlkwd{table}\hlstd{(}\hlkwd{V}\hlstd{(karate)}\hlopt{$}\hlstd{Faction,} \hlkwd{membership}\hlstd{(im))}
\end{alltt}
\begin{verbatim}
##    
##      1  2  3
##   1 11  5  0
##   2  0  0 18
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{#  So if our theory is strong in that these factions matter:}
\hlstd{> }\hlcom{#     we see that edge betweenness does "best" with only one person}
\hlstd{> }\hlcom{#     assigned wrong faction. with fast_greedy and infomap coming close}
\hlstd{> }\hlcom{#     behind in faction membership detection.}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlcom{## we can also compare different partitionings based on different}
\hlstd{> }\hlcom{#  community detection algorithms.}
\hlstd{> }\hlkwd{compare}\hlstd{(eb, sg,} \hlkwc{method} \hlstd{=} \hlstr{"nmi"}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1] 0.5878497
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## [1] 0.5622443}
\hlstd{> }\hlkwd{compare}\hlstd{(wt, sg,} \hlkwc{method} \hlstd{=} \hlstr{"nmi"}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1] 0.9300002
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## [1] 0.8953659}
\hlstd{> }\hlkwd{compare}\hlstd{(fg, im,} \hlkwc{method} \hlstd{=} \hlstr{"nmi"}\hlstd{)}
\end{alltt}
\begin{verbatim}
## [1] 1
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## we can see that these two community detection algorithms produce}
\hlstd{> }\hlcom{#  exactly the same partitioning of the graph}
\hlstd{> }\hlcom{## [1] 1}
\hlstd{> }\hlkwd{table}\hlstd{(}\hlkwd{membership}\hlstd{(fg),}\hlkwd{membership}\hlstd{(im))}
\end{alltt}
\begin{verbatim}
##    
##      1  2  3
##   1  0  0 18
##   2 11  0  0
##   3  0  5  0
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## Stochastic Block Models.}
\hlstd{> }\hlcom{#   Just create a model to calculate the probability of ties within each group}
\hlstd{> }\hlcom{#   (controlling for variables).}
\hlstd{> }\hlcom{#   (Have to swap packages out of igraph and data out of igraph)}
\hlstd{> }
\hlstd{> }\hlkwd{require}\hlstd{(intergraph)}
\hlstd{> }\hlkwd{detach}\hlstd{(package}\hlopt{:}\hlstd{igraph)}
\hlstd{> }\hlkwd{require}\hlstd{(sna)}
\hlstd{> }\hlstd{knet} \hlkwb{<-} \hlkwd{asNetwork}\hlstd{(karate)}
\hlstd{> }\hlcom{## this is the function from intergraph that takes a igraph graph object and}
\hlstd{> }\hlcom{#      makes it into a statnet graph object}
\hlstd{> }\hlkwd{blockmodel}\hlstd{(knet,} \hlkwc{ec} \hlstd{= knet} \hlopt{%v%} \hlstr{"Faction"}\hlstd{)}
\end{alltt}
\begin{verbatim}
## 
## Network Blockmodel:
## 
## Block membership:
## 
##  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 
##  1  1  1  1  1  1  1  1  2  2  1  1  1  1  2  2  1  1  2  1  2  1  2  2  2  2 
## 27 28 29 30 31 32 33 34 
##  2  2  2  2  2  2  2  2 
## 
## Reduced form blockmodel:
## 
## 	 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 
##            Block 1    Block 2
## Block 1 0.27500000 0.03472222
## Block 2 0.03472222 0.22875817
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{##            Block 1    Block 2}
\hlstd{> }\hlcom{## Block 1 0.27500000 0.03472222}
\hlstd{> }\hlcom{## Block 2 0.03472222 0.22875817}
\hlstd{> }\hlcom{#  We can see that a much higher probability of a tie are within each faction}
\hlstd{> }\hlcom{#                                                           than between them.}
\hlstd{> }
\hlstd{> }\hlstd{kbm} \hlkwb{<-} \hlkwd{blockmodel}\hlstd{(knet,} \hlkwc{ec} \hlstd{= knet} \hlopt{%v%} \hlstr{"Faction"}\hlstd{)}\hlopt{$}\hlstd{block.model}
\hlstd{> }
\hlstd{> }\hlcom{# (swap packages back)}
\hlstd{> }\hlkwd{detach}\hlstd{(package}\hlopt{:}\hlstd{intergraph)}
\hlstd{> }\hlkwd{require}\hlstd{(igraph)}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlcom{#  BlockModels are mostly used for generative models of network formation.}
\hlstd{> }\hlcom{#    Now we'll use those block model results:}
\hlstd{> }
\hlstd{> }\hlstd{g_kar} \hlkwb{<-} \hlkwd{sample_sbm}\hlstd{(}\hlnum{34}\hlstd{,} \hlkwc{pref.matrix} \hlstd{= kbm,}
\hlstd{+ }                    \hlkwc{block.sizes} \hlstd{=} \hlkwd{c}\hlstd{(}\hlnum{16}\hlstd{,}\hlnum{18}\hlstd{),}
\hlstd{+ }                    \hlkwc{directed} \hlstd{=} \hlnum{FALSE}\hlstd{)}
\hlstd{> }\hlkwd{assortativity}\hlstd{(g_kar,} \hlkwd{c}\hlstd{(}\hlkwd{rep}\hlstd{(}\hlnum{1}\hlstd{,}\hlnum{16}\hlstd{),} \hlkwd{rep}\hlstd{(}\hlnum{2}\hlstd{,}\hlnum{18}\hlstd{)))}
\end{alltt}
\begin{verbatim}
## [1] 0.7797888
\end{verbatim}
\begin{alltt}
\hlstd{> }\hlcom{## This compares pretty closely to the assortativity of the real karate network}
\hlstd{> }\hlcom{#      that we calculated above.}
\hlstd{> }\hlcom{## [1] 0.7456716}
\hlstd{> }
\hlstd{> }
\hlstd{> }\hlcom{# plot(g_kar, vertex.color = c(rep(1,16), rep(2,18)), main = "Fabricated")}
\hlstd{> }\hlcom{# plot(karate, main = "Real")}
\hlstd{> }
\hlstd{> }\hlcom{# image(g_kar[]) ## quick way to visualize the adjacency matrix.}
\hlstd{> }\hlcom{#   Remember that graph[] calls the adjacency matrix}
\hlstd{> }
\hlstd{> }\hlcom{# image(karate[][order(as.vector(order(V(karate)$Faction))),])}
\end{alltt}
\end{kframe}
\end{knitrout}
\end{center}

\subsection{Network Modeling}


% ---------------------------------------------------------------------
\clearpage

\section{Meta-Analysis}

Increasingly popular in the social sciences (and beyond!) is the ``analysis of analyses'' or meta-analysis.\footnote{A term coined by Gene Glass as far back as 1976; however the practice of meta-analysis can be found as far back as 1904 with notable statisticians such as Pearson and Fisher.} The practice, broadly speaking, involves the combination of many articles on a specific topic to see where the ``jury stands'' on the topic. This involves the combination of effect sizes, weighted by sample sizes and other important components of a papers methodology, controlling for any impending biases of the article (gender of the authors, or year the article was published as examples). While modern practice encourages the combination of effect sizes, early meta-analyses involved the combination of p-values to make theoretical statements about the given topic. These latter practices are still ongoing today, and are often met with criticism this is because of the popular misconception of p-values being a statement about seeing theory in data rather than the data being observed given the sharp null hypotheses. \index{p-values}

That is,

\begin{equation}
\text{Pr}(\text{data}| H_0 \text{true}) = \text{p-values}
\end{equation}
\begin{equation}
\text{Pr}(H_0 \text{true} | \text{data}) =/= \text{p-values}
\end{equation}

Effect sizes will be calculated in the sections that follow.


\subsection{Theory}

In academia especially, articles are compared and contrasted against each other all time time. This usually occurs in an articles ``literature review'' section - often around a topic of a theoretically interesting puzzle or unanswered question that the research hopes to illuminate for the reader. However, these sorts of comparisons are often without recognition of bias, random sampling of selected readings, or without recognition of elite scholars being able to more easily market their results. In contrast to literary comparisons meta-analyses apply a more quantitative approach to article examination of a topic and often result in similar advantages.

To highlight this point, an article by Bushman and Rothstein (2012) notes that often biases occur when one group is given suggestive and attractive paper titles when others get dull scientific sounding titles. If students receive brief training in meta-analysis these biases go away. The article hits home the importance of empirical literature comparisons when something as small as the article title can bias the interpretation of an articles results.

\subsection{Examples}

%--------------------------------------
\clearpage
\section{Field Research Design: Qualitative Methods}

\hfill \\
\subsection{How to Use Qualitative Evidence}

\hfill \\
\subsection{Survey Design Psychology}

\hfill \\
\subsubsection{Survey Experiments}

\hfill \\
\subsubsection{The ``Don't Know" Option:}

\hfill \\
\subsubsection{Research on Survey Biases}

\hfill \\
\subsection{Content Analysis}

\hfill \\
\subsubsection{The Protocol}

\hfill \\
\subsubsection{The Coding Sheet}

\hfill \\
\subsubsection{Reliability Measurements}

[Krippendorf's Alpha]

\hfill \\
\subsubsection{The Use of Drones}

\hfill \\
\subsection{Advice, Tools, Resources}


%-----------------------------------------------------------------------
% \clearpage
% \addcontentsline{toc}{section}{Further Reading:}
% \bibliography{Methods_Handbook.bib}
%-----------------------------------------------------------------------

\clearpage
\addcontentsline{toc}{section}{Index}
\printindex



\end{flushleft}
\end{document}