\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, December 13, 2018}
\bigskip

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

\textbf{In} \emph{-101}

\vspace*{2\baselineskip}

{\large\scshape Ron Peled 
  %
  (Tel-Aviv University)
}
\bigskip

will talk about
\bigskip

{\Large\bfseries On the site percolation threshold of circle packings and planar graphs, with application to the loop O(n) model\par}
\bigskip

\end{center}
\vfill

\textsc{Abstract:}
A circle packing is a collection of circles in the plane with disjoint interiors. An accumulation point of the circle packing is a point with infinitely many circles in any neighborhood of it. A site percolation with parameter p on the circle packing means retaining each circle with probability p and deleting it with probability 1-p, independently between circles. We will explain the proof of the following result: There exists p\textgreater{}0 satisfying that for any circle packing with finitely many accumulation points, after a site percolation with parameter p there is no infinite connected component of retained circles, almost surely. This implies, in particular, that the site percolation threshold of any planar recurrent graph is at least p. It is conjectured that the same should hold with p=1/2.
The result gives a partial answer to a question of Benjamini, who conjectured that square packings of the unit square admit long crossings after site percolation with parameter p=1/2 and asked also about other values of p.
Time permitting, we will discuss an application of the result to the existence of macroscopic loops in the loop O(n) model on the hexagonal lattice.
Portions joint with Nick Crawford, Alexandar Glazman and Matan Harel.








% vim: ft=eruby.tex:


\end{document}

% vim: ft=eruby.tex:
