\relax 
\@writefile{toc}{\contentsline {section}{\numberline {1}Variations on a theme of PageRank}{1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.1}Personalized PageRanks for $E$, $F$, $G$}{1}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {1.1.1}Eloise}{1}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {1.1.2}Felicity}{1}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {1.1.3}Glynnis}{1}}
\newlabel{eqn:glynnis_comb}{{2}{1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.2}Set of possible personalized PageRank vectors}{2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.3}Isolated spam farm}{2}}
\newlabel{eqn:spamfarm_p0}{{5}{2}}
\newlabel{eqn:spamfarm_p1}{{6}{2}}
\newlabel{eqn:p_0}{{7}{2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.4}Linked spam farm: Configuration 1}{2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.5}Linked spam farm: Configuration 2}{3}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Comparison of the exact and approximate betweenness centrality computation results.}}{4}}
\newlabel{fig:p2}{{1}{4}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Approximate betweenness centrality}{4}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Indexing scheme (decreasing binary counter) that allows $\Theta _k$ to be represented as a product of $\Theta _1$, here illustrated for $k=2$.}}{8}}
\newlabel{fig:p3_indexing}{{2}{8}}
\@writefile{toc}{\contentsline {section}{\numberline {3}Stochastic Kronecker graphs}{8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Indexing scheme}{8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Compute $P[u,v]$}{8}}
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Frequency of each bit pair combination}}{8}}
\newlabel{tab:freq}{{1}{8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.3}Expected degree of node $u$ with weight $l$ represented using $k$-bits}{9}}
\newlabel{eq:expdeg}{{24}{9}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.4}Expected number of edges in the graph}{9}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.5}Expected number of self loops}{9}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces [Left] The equilibrium network when each node requires $k=3$ neighbors in order to stay in the graph. [Right] The equilibrium network when nodes J and Q are ``brainwashed'' to stay in the network.}}{10}}
\newlabel{fig:p4_eq}{{3}{10}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Anchored $k$-cores in social networks}{10}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}The equilibrium network}{10}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}Finding the $k$-core}{10}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.3}Saving nodes}{10}}
\newlabel{alg:kcore}{{1}{10}}
\@writefile{loa}{\contentsline {algocf}{\numberline {1}{\ignorespaces Find the $k$-core of a graph $G=(V,E)$}}{10}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces An example of a network for which the naive greedy algorithm for anchored $k$-core will fail arbitrarily badly (for $k=2$, $b=2$).}}{11}}
\newlabel{fig:p4_naive_failure}{{4}{11}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.4}Failure of naive greedy}{11}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces The performance of \texttt  {TwoStepGreedy} (blue) and \texttt  {HighestDeg} algorithms on \texttt  {g1.txt} and \texttt  {g2.txt}.}}{12}}
\newlabel{fig:p4_results}{{5}{12}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.5}RemoveCore}{12}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.6}TwoStepGreedy}{12}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.7}Data exploration}{12}}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces Two network structures in which the \texttt  {HighestDeg} algorithm will perform well (left) and poorly (right). The salient difference is the average distances between the nodes of high degree (highlighted in red).}}{13}}
\newlabel{fig:p4_structures}{{6}{13}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.8}Possible structures for $G_1$ and $G_2$}{13}}