\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{english}
\setotherlanguage{hebrew}
%%\setmainfont[Ligatures=TeX]{Libertinus Serif}
\setmainfont[Script=Hebrew,Ligatures=TeX]{LibertinusSerif}[
  UprightFont = *-Regular,
  BoldFont = *-Bold,
  ItalicFont = *-Italic,
  BoldItalicFont = *-BoldItalic,
  Extension = .otf]

\SepMark{‭.}
\robustify\hebrewnumeral
\robustify\Hebrewnumeral
\robustify\Hebrewnumeralfinal

% vim: ft=eruby.tex:



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

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

{\Large Department of Mathematics, BGU}

\vspace*{\baselineskip}

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

{\Huge BGU Probability and Ergodic Theory  (PET) seminar}\\[0.2\baselineskip]

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

\textbf{On} \emph{Thursday, May  8, 2025}
\bigskip

\textbf{At} \emph{11:10 -- 12:00}
\bigskip

\textbf{In} \emph{-101}

\vspace*{2\baselineskip}

{\large\scshape Shlomo Hoory  
  %
  (Tel-Hai College)
}
\bigskip

will talk about
\bigskip

{\Large\bfseries Entropy and the growth rate of universal covering trees\par}
\bigskip

\end{center}
\vfill

\textsc{Abstract:}
This work studies the relation between two graph parameters, rho and Lambda.
For an undirected graph G,  rho(G) is the growth rate of its universal covering tree,
while Lambda(G) is a weighted geometric average of the vertex degree minus one, corresponding to the rate of entropy growth for the non-backtracking random walk (NBRW).  \newline
It is well known that rho(G) \textgreater{}= Lambda(G) for all graphs, and that  graphs with rho=Lambda exhibit some special properties. 
In this work we derive an easy to check, necessary and sufficient condition for the equality to hold.
Furthermore, we show that the variance of the number of random bits used by a length k NBRW is O(1) if rho = Lambda and Omega(k) if \$rho \textgreater{} \textbackslash{}Lambda.
As a consequence we exhibit infinitely many non-trivial examples of graphs with rho = Lambda.

Joint work with Idan Eisner, Tel-Hai College








% vim: ft=eruby.tex:


\end{document}

% vim: ft=eruby.tex: