\relax 
\providecommand\hyper@newdestlabel[2]{}
\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]{}
\citation{Traag2009}
\newlabel{FirstPage}{{}{1}{}{Doc-Start}{}}
\@writefile{toc}{\contentsline {title}{Supplementary Information\@centercr   From Louvain to Leiden: guaranteeing well-connected communities}{1}{section*.1}}
\@writefile{toc}{\appendix }
\@writefile{toc}{\contentsline {section}{\numberline {A}Pseudo-code and mathematical notation}{1}{section*.2}}
\newlabel{sec:code_notation}{{A}{1}{}{section*.2}{}}
\newlabel{eq:set_size}{{A1}{1}{}{equation.A.1}{}}
\citation{Traag2011}
\citation{Fortunato:2007p183,Traag2011}
\citation{Newman2004Finding}
\newlabel{eq:CPM}{{A4}{2}{}{equation.A.4}{}}
\newlabel{eq:modularity}{{A5}{2}{}{equation.A.5}{}}
\newlabel{algo:louvain:strict_increase_move}{{17}{3}{}{equation.A.5}{}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {A.1}{\ignorespaces \textbf  {Louvain algorithm.}}}{3}{algorithm.A.1}}
\newlabel{algo:louvain}{{A.1}{3}{\textbf {Louvain algorithm.}}{algorithm.A.1}{}}
\@writefile{toc}{\contentsline {section}{\numberline {B}Disconnected communities in the Louvain algorithm}{3}{section*.3}}
\newlabel{sec:disconnected_example}{{B}{3}{}{section*.3}{}}
\newlabel{algo:leiden:call_move_nodes}{{3}{4}{}{algorithm.A.1}{}}
\newlabel{algo:leiden:stop_criterion}{{4}{4}{}{algorithm.A.1}{}}
\newlabel{algo:leiden:strict_increase_move}{{18}{4}{}{algorithm.A.1}{}}
\newlabel{algo:leiden:add_neighs_to_queue}{{21}{4}{}{algorithm.A.1}{}}
\newlabel{algo:leiden:strict_merge1}{{34}{4}{}{algorithm.A.1}{}}
\newlabel{algo:leiden:strict_merge2}{{37}{4}{}{algorithm.A.1}{}}
\newlabel{algo:leiden:merge_prob}{{38}{4}{}{algorithm.A.1}{}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {A.2}{\ignorespaces \textbf  {Leiden algorithm.}}}{4}{algorithm.A.2}}
\newlabel{algo:leiden}{{A.2}{4}{\textbf {Leiden algorithm.}}{algorithm.A.2}{}}
\citation{Guimera2005Functional,Reichardt2006Statistical}
\@writefile{toc}{\contentsline {section}{\numberline {C}Reachability of optimal partitions}{5}{section*.4}}
\newlabel{sec:reachability}{{C}{5}{}{section*.4}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1}Non-decreasing move sequences}{5}{section*.5}}
\newlabel{sec:nondecreasing_move_sequences}{{C\tmspace  +\thinmuskip {.1667em}1}{5}{}{section*.5}{}}
\newlabel{thm:optimal_seq}{{1}{5}{}{theorem.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {C.1}{\ignorespaces \textbf  {Unreachable optimal partition.} A greedy move sequence always reaches the partition in (a), whereas the partition in (b) is optimal. This demonstrates that for some graphs there does not exist a greedy move sequence that reaches the optimal partition.}}{6}{figure.C.1}}
\newlabel{fig:unreachable_partition}{{C.1}{6}{\textbf {Unreachable optimal partition.} A greedy move sequence always reaches the partition in (a), whereas the partition in (b) is optimal. This demonstrates that for some graphs there does not exist a greedy move sequence that reaches the optimal partition}{figure.C.1}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2}Greedy move sequences}{6}{section*.6}}
\newlabel{sec:greedy_move_sequences}{{C\tmspace  +\thinmuskip {.1667em}2}{6}{}{section*.6}{}}
\@writefile{toc}{\contentsline {section}{\numberline {D}Guarantees of the Leiden algorithm}{7}{section*.7}}
\newlabel{sec:guarantees}{{D}{7}{}{section*.7}{}}
\newlabel{def:gamma_separation}{{5}{7}{$\gamma $-separation}{definition.5}{}}
\newlabel{def:gamma_connectivity}{{6}{7}{$\gamma $-connectivity}{definition.6}{}}
\newlabel{def:subpartition_gamma_density}{{7}{7}{Subpartition $\gamma $-density}{definition.7}{}}
\newlabel{def:node_optimality}{{8}{7}{Node optimality}{definition.8}{}}
\newlabel{def:uniform_gamma_density}{{9}{7}{Uniform $\gamma $-density}{definition.9}{}}
\newlabel{def:subset_optimality}{{10}{7}{Subset optimality}{definition.10}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1}Guarantees in each iteration}{7}{section*.8}}
\newlabel{sec:each_iteration}{{D\tmspace  +\thinmuskip {.1667em}1}{7}{}{section*.8}{}}
\newlabel{lem:move_nodes_fast1}{{2}{8}{}{theorem.2}{}}
\newlabel{lem:move_nodes_fast2}{{3}{8}{}{theorem.3}{}}
\newlabel{thm:gamma_separation}{{4}{8}{}{theorem.4}{}}
\newlabel{thm:gamma_connectedness}{{5}{9}{}{theorem.5}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2}Guarantees in stable iterations}{9}{section*.9}}
\newlabel{sec:stable_iteration}{{D\tmspace  +\thinmuskip {.1667em}2}{9}{}{section*.9}{}}
\newlabel{thm:subpartition_gamma_density}{{6}{9}{}{theorem.6}{}}
\newlabel{thm:node_optimality}{{7}{10}{}{theorem.7}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3}Asymptotic guarantees}{10}{section*.10}}
\newlabel{sec:asymptotic}{{D\tmspace  +\thinmuskip {.1667em}3}{10}{}{section*.10}{}}
\newlabel{lem:convergence}{{8}{10}{}{theorem.8}{}}
\newlabel{def:minimal_non_optimal_subset}{{12}{11}{}{definition.12}{}}
\newlabel{lem:minimal_non_optimal_subset}{{9}{11}{}{theorem.9}{}}
\newlabel{eq:split}{{D2}{11}{}{equation.D.2}{}}
\newlabel{eq:ineq_S}{{D3}{11}{}{equation.D.3}{}}
\newlabel{eq:ineq_S_1}{{D4}{11}{}{equation.D.4}{}}
\newlabel{eq:ineq_S_2}{{D5}{11}{}{equation.D.5}{}}
\newlabel{lem:find_optimal}{{10}{11}{}{theorem.10}{}}
\newlabel{thm:subset_optimality}{{11}{12}{}{theorem.11}{}}
\@writefile{toc}{\contentsline {section}{\numberline {E}Bounds on optimality}{12}{section*.11}}
\newlabel{sec:bound_on_optimality}{{E}{12}{}{section*.11}{}}
\newlabel{eq:diff_partition}{{E2}{12}{}{equation.E.2}{}}
\newlabel{lem:diff_partition}{{13}{12}{}{equation.E.2}{}}
\newlabel{eq:bound_external_edges}{{E3}{13}{}{equation.E.3}{}}
\newlabel{thm:bound_external_edges}{{14}{13}{}{equation.E.3}{}}
\citation{Dinh2015}
\citation{Dinh2015}
\bibdata{SINotes,bibliography}
\bibcite{Traag2009}{{1}{2009}{{Traag\ and\ Bruggeman}}{{}}}
\bibcite{Traag2011}{{2}{2011}{{Traag\ \emph  {et~al.}}}{{Traag, {Van Dooren},\ and\ Nesterov}}}
\bibcite{Fortunato:2007p183}{{3}{2007}{{Fortunato\ and\ Barth{\'{e}}lemy}}{{}}}
\bibcite{Newman2004Finding}{{4}{2004}{{Newman\ and\ Girvan}}{{}}}
\bibcite{Guimera2005Functional}{{5}{2005}{{Guimer{\`{a}}\ and\ {Nunes Amaral}}}{{}}}
\bibcite{Reichardt2006Statistical}{{6}{2006}{{Reichardt\ and\ Bornholdt}}{{}}}
\bibcite{Dinh2015}{{7}{2015}{{Dinh\ \emph  {et~al.}}}{{Dinh, Li,\ and\ Thai}}}
\bibstyle{apsrev4-1}
\citation{REVTEX41Control}
\citation{apsrev41Control}
\newlabel{eq:bound_weighted}{{E4}{14}{}{equation.E.4}{}}
\@writefile{toc}{\contentsline {section}{\numberline {}References}{14}{section*.12}}
\newlabel{LastBibItem}{{7}{14}{}{section*.12}{}}
\newlabel{LastPage}{{}{14}{}{}{}}
