Simple PhD Thesis

\documentclass[11pt,a4paper,oneside]{book}
\usepackage[T1]{fontenc}
\usepackage[utf8]{inputenc}
\usepackage[a4paper,margin=2.5cm]{geometry}
\usepackage{setspace}
\usepackage{graphicx}
\usepackage{amsmath,amssymb,amsthm}
\usepackage{booktabs}
\usepackage[hidelinks]{hyperref}

\onehalfspacing
\theoremstyle{plain}
\newtheorem{theorem}{Theorem}[chapter]
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{corollary}[theorem]{Corollary}
\theoremstyle{definition}
\newtheorem{definition}[theorem]{Definition}

\title{A Simple PhD Thesis Template}
\author{First Last}

\begin{document}

\begin{titlepage}
  \centering
  \vspace*{4cm}
  {\huge\bfseries A Simple PhD Thesis Template \par}
  \vspace{2cm}
  {\Large First Last \par}
  \vspace{2cm}
  A thesis submitted for the degree of \\ Doctor of Philosophy \\
  University of Example \\ \vspace{2cm}
  \today
\end{titlepage}

\frontmatter
\chapter*{Abstract}
This thesis contributes novel algorithms for large-scale graph analytics
and proves tight upper and lower bounds on their communication complexity.

\tableofcontents

\mainmatter
\chapter{Introduction}
\section{Motivation}
Graph problems appear throughout computer science.
\section{Contributions}
\begin{itemize}
  \item A new streaming algorithm with optimal space.
  \item Matching lower bounds via communication complexity.
  \item An implementation achieving 40\% speedup.
\end{itemize}

\chapter{Preliminaries}
\begin{definition}[Streaming model]
An algorithm processes a stream of edges in $O(\log n)$ space.
\end{definition}

\chapter{Main Results}
\begin{theorem}
There is an $O(n \log n)$ space streaming algorithm for MST.
\end{theorem}
\begin{proof}
By a sampling argument on the edge weights.
\end{proof}

\chapter{Experiments}
We evaluate on 12 real-world graphs.

\chapter{Conclusion and Future Work}
We conclude with open problems.

\backmatter
\begin{thebibliography}{9}
  \bibitem{mcgregor} A.~McGregor. Graph stream algorithms: a survey. SIGMOD Record, 2014.
\end{thebibliography}
\end{document}