Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
Download
1288 views
\relax 
\providecommand\hyper@newdestlabel[2]{}
\providecommand{\transparent@use}[1]{}
\@ifundefined{amsrefs@bibcite}{}{\let\bibcite\amsrefs@bibcite}
\bibstyle{amsrn}
\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
\global\let\oldcontentsline\contentsline
\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
\global\let\oldnewlabel\newlabel
\gdef\newlabel#1#2{\newlabelxx{#1}#2}
\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
\AtEndDocument{\ifx\hyper@anchor\@undefined
\let\contentsline\oldcontentsline
\let\newlabel\oldnewlabel
\fi}
\fi}
\global\let\hyper@last\relax 
\gdef\HyperFirstAtBeginDocument#1{#1}
\providecommand\HyField@AuxAddToFields[1]{}
\providecommand\HyField@AuxAddToCoFields[2]{}
\@writefile{toc}{\contentsline {section}{\tocsection {}{1}{Introduction}}{1}{section.1}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Above, we see a graph, $G=(V,E)$, where $V=\{a,b,c,d,e\}$ and $E=\{\{a,c\},\{c,d\},\{c,e\},\{d,e\}\}$. There is an isolated vertex $b$ and one cycle, $\{c,d,e,c\}$.\relax }}{2}{figure.caption.1}}
\providecommand*\caption@xref[2]{\@setref\relax\@undefined{#1}}
\newlabel{fig:example}{{1}{2}{Above, we see a graph, $G=(V,E)$, where $V=\{a,b,c,d,e\}$ and $E=\{\{a,c\},\{c,d\},\{c,e\},\{d,e\}\}$. There is an isolated vertex $b$ and one cycle, $\{c,d,e,c\}$.\relax }{figure.caption.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Some examples of simple connected graphs.\relax }}{2}{figure.caption.2}}
\newlabel{fig:example}{{2}{2}{Some examples of simple connected graphs.\relax }{figure.caption.2}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces Some examples of disconnected graphs. Clearly, there are either isolated vertices or disjoint components, and thus are by definition disconnected.\relax }}{2}{figure.caption.3}}
\newlabel{fig:example}{{3}{2}{Some examples of disconnected graphs. Clearly, there are either isolated vertices or disjoint components, and thus are by definition disconnected.\relax }{figure.caption.3}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces The complete, simple graph on 5 vertices. Every possible edge exists.\relax }}{3}{figure.caption.4}}
\newlabel{fig:example}{{4}{3}{The complete, simple graph on 5 vertices. Every possible edge exists.\relax }{figure.caption.4}{}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{2}{Erd\H {o}s-R\'{e}nyi}}{3}{section.2}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces On the left, we see a graph on 5 vertices. Every possible edge is formed with a dotted line. The three right-hand images are various expected graphs produced by $G_{5;2}$, each with 5 vertices and 2 edges.\relax }}{3}{figure.caption.5}}
\newlabel{fig:example}{{5}{3}{On the left, we see a graph on 5 vertices. Every possible edge is formed with a dotted line. The three right-hand images are various expected graphs produced by $G_{5;2}$, each with 5 vertices and 2 edges.\relax }{figure.caption.5}{}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{3}{Thresholds}}{4}{section.3}}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces The $x$-axis is the number of vertices in the largest component for $G_{1000, 0.006}$. The $y$-axis is the number of trials, out of a total of 10000.\relax }}{4}{figure.caption.6}}
\newlabel{fig:example}{{6}{4}{The $x$-axis is the number of vertices in the largest component for $G_{1000, 0.006}$. The $y$-axis is the number of trials, out of a total of 10000.\relax }{figure.caption.6}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces The $x$-axis is the number of vertices in the largest component for $G_{1000, .0069}$. The $y$-axis is the number of trials, out of a total of 10000.\relax }}{5}{figure.caption.7}}
\newlabel{fig:example}{{7}{5}{The $x$-axis is the number of vertices in the largest component for $G_{1000, .0069}$. The $y$-axis is the number of trials, out of a total of 10000.\relax }{figure.caption.7}{}}
\citation{Thresholds}
\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces A graph of our calculated experimental thresholds for the Erd\H {o}s-R\'{e}nyi $G_{n,p}$ model.\relax }}{7}{figure.caption.8}}
\newlabel{fig:example}{{8}{7}{A graph of our calculated experimental thresholds for the Erd\H {o}s-R\'{e}nyi $G_{n,p}$ model.\relax }{figure.caption.8}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {9}{\ignorespaces Above are the overlaid charts of the experimental and effective thresholds. The Friedgut threshold appears in red, and the experimental threshold in blue.\relax }}{7}{figure.caption.9}}
\newlabel{fig:example}{{9}{7}{Above are the overlaid charts of the experimental and effective thresholds. The Friedgut threshold appears in red, and the experimental threshold in blue.\relax }{figure.caption.9}{}}
\citation{peoplemaps}
\citation{peoplemaps}
\@writefile{toc}{\contentsline {section}{\tocsection {}{4}{Applications of Thresholds to Real Networks}}{8}{section.4}}
\bibcite{Comparisons of networks}{{1}{}}
\bibcite{peoplemaps}{{2}{}}
\bibcite{Thresholds}{{3}{}}
\newlabel{[bibenv:1]}{10.55559pt}
\@writefile{lof}{\contentsline {figure}{\numberline {10}{\ignorespaces A map of people living in Saudi Arabia where each dot represents a node and each line represents a relationship. The graph is made without respect to geography, but nodes are organized by clusters. \cite {peoplemaps}\relax }}{9}{figure.caption.10}}
\newlabel{fig:example}{{10}{9}{A map of people living in Saudi Arabia where each dot represents a node and each line represents a relationship. The graph is made without respect to geography, but nodes are organized by clusters. \cite {peoplemaps}\relax }{figure.caption.10}{}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{5}{Conclusion}}{9}{section.5}}
\@writefile{toc}{\contentsline {section}{\tocsection {}{}{References}}{9}{section*.11}}
\newlabel{tocindent-1}{0pt}
\newlabel{tocindent0}{15.01373pt}
\newlabel{tocindent1}{20.88867pt}
\newlabel{tocindent2}{0pt}
\newlabel{tocindent3}{0pt}