\documentclass[oneside,final,12pt]{book}

\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{xunicode}

\usepackage{hyperref}
\usepackage{xstring}
\def\rooturl{https://www.math.bgu.ac.il/}
\hyperbaseurl{\rooturl}
\let\hhref\href
\providecommand{\extrahref}[2][]{\LTRfootnote{\LR{\IfBeginWith*{#2}{http}{\nolinkurl{#2}}{\nolinkurl{\rooturl#2}}}}}
\renewcommand{\href}[2]{\IfBeginWith*{#1}{http}{\hhref{#1}{#2}}{\hhref{\rooturl#1}{#2}}\extrahref{#1}}

\usepackage{polyglossia}
\usepackage{longtable}
%% even in English, we sometimes have Hebrew (as in course hours), and we
%% can't add it in :preamble, since it comes after hyperref
%%\usepackage{bidi}
\setdefaultlanguage{hebrew}
\setotherlanguage{english}
%%\setmainfont[Script=Hebrew,Ligatures=TeX]{Libertinus Serif}
\setmainfont[Script=Hebrew,Ligatures=TeX]{LibertinusSerif}[
  UprightFont = *-Regular,
  BoldFont = *-Bold,
  ItalicFont = *-Italic,
  BoldItalicFont = *-BoldItalic,
  Extension = .otf]

%%\newfontfamily{\hebrewfonttt}{Libertinus Serif}
\newfontfamily{\hebrewfonttt}{Liberation Serif}
\SepMark{‭.}
\robustify\hebrewnumeral
\robustify\Hebrewnumeral
\robustify\Hebrewnumeralfinal

% vim: ft=eruby.tex:



\begin{document}
\pagestyle{empty}
\pagenumbering{gobble}

\begin{center}
\vspace*{\baselineskip}

{\Large המחלקה למתמטיקה, בן-גוריון}

\vspace*{\baselineskip}

\rule{\textwidth}{1.6pt}\vspace*{-\baselineskip}\vspace*{2pt}
\rule{\textwidth}{0.4pt}\\[\baselineskip]

{\Huge קולוקוויום}\\[0.2\baselineskip]

\rule{\textwidth}{0.4pt}\vspace*{-\baselineskip}\vspace{3.2pt}
\rule{\textwidth}{1.6pt}\\[\baselineskip]

\textbf{ב}\emph{יום שלישי, 25 במרץ, 2025}
\bigskip

\textbf{בשעה} \emph{14:30 -- 15:30}
\bigskip

\textbf{ב}\emph{Math -101}

\vspace*{2\baselineskip}

ההרצאה

\bigskip
{\Large\bfseries Recovering tree models via spectral graph theory\par}
\bigskip

תינתן על-ידי
\bigskip

{\large\scshape Yariv Aisenbud 
  %
  (TAU)
}
\bigskip

\end{center}
\vfill

\textbf{תקציר:}
  Modeling data by latent tree models is a powerful approach in multiple applications. A canonical example of this setting is the ''tree of life``, where the evolutionary history of a set of organisms is inferred by their DNA. Generally, in latent tree models, the main task is to infer the structure of the tree, given only observations of its terminal nodes. While inferring a tree structure is a common task, in many applications, a robust algorithm for the recovery of large trees is still missing.

In this talk, we will see a new method for the recovery of latent tree models, which is based on spectral graph theory. We show that the hidden tree structure is strongly related to the spectral properties of a graph, defined over the terminal nodes of the tree. Finally, we see that while in terms of accuracy the method performs similarly to state-of-the-art methods, it is significantly more computationally efficient.
  


\vfill





% vim: ft=eruby.tex:


\end{document}

% vim: ft=eruby.tex:
