2018 May 28

# Combinatorics: Daniel Jerison (TAU) "Random walks on sandpile groups"

11:00am to 12:30pm

## Location:

IIAS, Eilat hall, Feldman bldg, Givat Ram
Speaker: Daniel Jarison,  TAU

Title: Random walks on sandpile groups

Abstract:
2018 Jun 25

# Combinatorics: Roman Glebov (HU) "Perfect Matchings in Random Subgraphs of Regular Bipartite Graphs"

11:00am to 12:30pm

## Location:

IIAS, room 130, Feldman bldg, Givat Ram
Speaker: Roman Glebov (HU) Title: Perfect Matchings in Random Subgraphs of Regular Bipartite Graphs Abstract: Consider the random process in which the edges of a graph $G$ are added one by one in a random order. A classical result states that if $G$ is the complete graph $K_{2n}$ or the complete bipartite graph $K_{n,n}$, then typically a perfect matching appears at the moment at which the last isolated vertex disappears. We extend this result to arbitrary $k$-regular bipartite graphs $G$ on $2n$ vertices for all $k=\Omega(n)$.
2018 Jun 11

# Combinatorics: Chris Cox (CMU) "Nearly orthogonal vectors"

11:00am to 12:30pm

## Location:

IIAS, Eilat hall, Feldman bldg, Givat Ram
2018 Apr 26

# Basic Notions: Alex Lubotzky "From expander graphs to high dimensional expanders: a road map"

4:00pm to 5:30pm

## Location:

Math Hall 2
Expander graphs have been a topic of great interest in the last 50 years for mathematicians and computer scientists. In recent years a high dimensional theory is emerging.  We will describe some of its main directions and questions.
2018 May 16

# Analysis Seminar: Nadav Dym (WIS) "Linear algorithms for computing conformal mappings"

12:00pm to 1:00pm

## Location:

Ross Building
Abstract: (joint with Noam Aigerman, Raz Sluzky and Yaron Lipman)
2018 May 29

# Dynamics Lunch: Matan Seidel (Huji) - "The Mass Transport Principle in Percolation Theory"

12:00pm to 1:00pm

## Location:

Manchester lounge
The Mass Transport Principle is a useful technique that was introduced to the study of automorphism-invariant percolations by Häggström in 1997. The technique is a sort of mass conservation principle, that allows us to relate random properties (such as the random degree of a vertex) to geometric properties of the graph. I will introduce the principle and the class of unimodular graphs on which it holds, as well as a few of its applications.