To join the mailing list, contact Amir Gonen (amir.gonen@weizmann.ac.il). This seminar also has a google calendar entry: Weizmann - GFAP Seminar (Geometric Functional Analysis and Probability)

Nov 29h, 2018

Amir Dembo (Stanford)

*Large deviations of subgraph counts for sparse random graphs*

For fixed t>1 and L>3 we establish sharp asymptotic formula for the log-probability that the number of cycles of length L in the Erdos - Renyi random graph G(N,p) exceeds its expectation by a factor t, assuming only that p >> log N/sqrt(N). We obtain such sharp upper tail bounds also for the Schatten norms of the corresponding adjacency matrices, and in a narrower range of p=p(N), also for general subgraph counts. In this talk, based on a recent joint work with Nick Cook, I will explain our approach and in particular our quantitative refinement of Szemeredi's regularity lemma for sparse random graphs in the large deviations regime.

Dec 6th, 2018

Boaz Slomka (WIS)

*TBA*

Dec 13th, 2018

Manuel Stadlbauer

*TBA*

Dec 20th, 2018

Max Fathi

*TBA*

Dec 27th

Yury Makarychev

*TBA*

Jan 10th, 2019

Godofredo Lommi

*TBA*

Jan 17th, 2019

Dan Mikulincer (WIS)

*TBA*

Jan 24th, 2019

Noam Lifshhitz

*TBA*

Feb 21st, 2019

Ori Gurel Gurevich (HUJI)

*TBA*

Nov 8h, 2018

Snir Ben Ovadia (WIS)

*What are SRB and GSRB measures, and a new characterisation of their existence*

SRB measures are an important object in dynamical systems and mathematical physics. Named after Sinai , Ruelle and Bowen, these measures have important properties of being equilibrium states which describe chaotic behaviour, yet may also describe the asymptotic of ``observable” events in the phase space. An open and important question, is in what generality do systems admit SRB measures? We present the notion of generalised SRB measures (GSRB in short), mention some of their important properties, and present a new condition to characterise their existence on a general setup. The first part of the talk will describe some of the motivation leading to define and to study SRB measures; and so we will define GSRB measures and compare their properties with the properties sought for SRB measures. We will also describe a case study of examples motivating to study GSRB measures. Our new result is a characterisation of systems admitting GSRB measures. In the second part of the talk, as much as time permits, we will present some key steps in the construction of GSRB measures.

Oct 25th, 2018

Daniel Dadush (CWI Amsterdam)

*Balancing vectors in any norm*

In the vector balancing problem, we are given N vectors v_1,..., v_N in an n-dimensional normed space, and our goal is to assign signs to them, so that the norm of their signed sum is as small as possible. The balancing constant of the vectors is the smallest number beta, such that any subset of the vectors can be balanced so that their signed sum has norm at most beta. The vector balancing constant generalizes combinatorial discrepancy, and is related to rounding problems in combinatorial optimization, and to the approximate Caratheodory theorem. We study the question of efficiently approximating the vector balancing constant of any set of vectors, with respect to an arbitrary norm. We show that the vector balancing constant can be approximated in polynomial time to within factors logarithmic in the dimension, and is characterized by (an appropriately optimized version of) a known volumetric lower bound. Our techniques draw on results from geometric functional analysis and the theory of Gaussian processes. Our results also imply an improved approximation algorithm for hereditary discrepancy. Joint work with Aleksandar Nikolov, Nicole Tomczak-Jaegermann and Kunal Talwar.

Aug 30th, 2018

Assaf Naor (Princeton)

*Coarse (non)Universality of Alexandrov Spaces*

Aug 16th, 2018

David Ellis (Queen Mary U)

*Random graphs with constant r-balls*

Let $F$ be a fixed infinite, vertex-transitive graph. We say a graph $G$ is {\em $r$-locally $F$} if for every vertex $v$ of $G$, the ball of radius $r$ and centre $v$ in $G$ is isometric to the ball of radius $r$ in $F$. For each positive integer $n$, let $G_n$ be a graph chosen uniformly at random from the set of all unlabelled, $n$-vertex graphs that are $r$-locally $F$. We investigate the properties that the random graph $G_n$ has with high probability --- i.e., how these properties depend on the fixed graph $F$. We show that if $F$ is a Cayley graph of a torsion-free group of polynomial growth, then there exists a positive integer $r_0$ such that for every integer $r \geq r_0$, with high probability the random graph $G_n = G_n(F,r)$ defined above has largest component of size between $n^{c_1}$ and $n^{c_2}$, where $0 < c_1 < c_2 < 1$ are constants depending upon $F$ alone, and moreover that $G_n$ has a rather large automorphism group. This contrasts sharply with the random $d$-regular graph $G_n(d)$ (which corresponds to the case where $F$ is replaced by the infinite $d$-regular tree). Our proofs use a mixture of results and techniques from group theory, geometry and combinatorics. We obtain somewhat more precise results in the case where $F$ is $\mathbb{L}^d$ (the standard Cayley graph of $\mathbb{Z}^d$): for example, we obtain quite precise estimates on the number of $n$-vertex graphs that are $r$-locally $\mathbb{L}^d$, for $r$ at least linear in $d$. Many intriguing open problems remain: concerning groups with torsion, groups with faster than polynomial growth, and what happens for more general structures than graphs. This is joint work with Itai Benjamini (WIS).

July 26th, 2018

Eliran Subag (NYU)

*Free energy landscapes in spherical spin glasses*

I will describe a new approach to the study of spherical spin glass models via free energy landscapes, defined by associating to interior points of the sphere the free energy computed only over the spherical band around them. They are closely related to several fundamental objects from spin glass theory: the TAP free energy, pure states decomposition, overlap distribution, and temperature chaos. I will explain some of of those connections.

Jul 5th, 2018

Jonathan Hermon (Cambridge)

*The exclusion process (usually) mixes faster than independent particles.*

The exclusion process is one of the most basic and best studied processes in the literature on interacting particle systems, with connections to card shuffling and statistical mechanics. It has been one of the major examples driving the study of mixing-times. In the exclusion process on an n-vertex graph we have k black particles and n-k white particles, one per site. Each edge rings at rate 1. When an edge rings, the particles occupying its end-points switch positions. Oliveira conjectured that the order of the mixing time of the process is at most that of the mixing-time of k independent particles. Together with Richard Pymar we verify this up to a constant factor for d-regular (or bounded degree) graphs 1 in various cases: (1) the degree d is at least logarithmic in n, or (2) the spectral-gap of a single walk is small (at most log number of vertices to the power 4) or (3) when the number of particles k is roughly $n^a$ for some constant $a \in (0,1)$. In these cases our analysis yields a probabilistic proof of Aldous' famous spectral-gap conjecture (resolved by Caputo et al.). We also prove a general bound which (when $k \geq n^c$) is within a $\log \log n$ factor from Oliveira's conjecture. As applications we get new mixing bounds: (a) $O(\log n \log \log n)$ for expanders, (b) order $ \log (dk)$ for the hypercube ${0,1}^d$ and (c) order $(diameter)^2 \log k$ for vertex-transitive graphs of moderate growth and for the giant component of supercritical percolation on a torus.

June 28th, 2018

Omer Bobrowski (Technion)

*Homological connectivity and percolation in random geometric complexes*

Connectivity and percolation are two well studied phenomena in random graphs. In this talk we will discuss higher-dimensional analogues of connectivity and percolation that occur in random simplicial complexes. Simplicial complexes are a natural generalization of graphs, consisting of vertices, edges, triangles, tetrahedra, and higher dimensional simplexes. We will mainly focus on random geometric complexes. These complexes are generated by taking the vertices to be a random point process, and adding simplexes according to their geometric configuration. Our generalized notions of connectivity and percolation use the language of homology - an algebraic-topological structure representing cycles of different dimensions. In this talk we will review some recent progress in characterizing and analyzing these phenomena, as well as describing related phase transitions.

June 7th, 2018

Ohad Feldheim (HUJI) + Eviatar Procaccia (Texas A&M)

*Ohad Feldheim: Convergence of a quantile admission processes.*

Consider the following stochastic model for a growing set. At time $0$ the model consists of the singleton $S = \{-\infty\}$. At every subsequent time, two i.i.d. samples, distributed according to some distribution $D$ on $\mathbb{R}$, are suggested as candidates for $S$. If the smaller among the two is closer to at least a fraction of $r$ of the current elements of $S$ (in comparison with the larger one), then it is admitted into $S$. How will the distribution of the members of $S$ evolve over time as a function of $r$ and $D$? This model was suggested by Alon, Feldman, Mansour, Oren and Tennenholtz as a model for the evolution of an exclusive social group. We’ll show that the empirical distribution of the elements of $S$ converges to a (not-necessarily deterministic) limit distribution for any $r$ and $D$. This we do by relating the process to a random walk in changing environment. The analysis of this random walk involves various classical exponential concentration inequalities as well as a new general inequality concerning mean and minimum of independent random variables. Joint work with Naomi Feldheim.

*Eviatar Procaccia: Stabilization of Diffusion Limited Aggregation in a Wedge. *

We prove a discrete Beurling estimate for the harmonic measure in a wedge in $\mathbf{Z}^2$, and use it to show that Diffusion Limited Aggregation (DLA) in a wedge of angle smaller than $\pi/4$ stabilizes. This allows to consider the infinite DLA and questions about the number of arms, growth and dimension. I will present some conjectures and open problems.

June 14th, 2018

Emanuel Milman (Technion)

*The Gaussian Double-Bubble and Multi-Bubble Conjectures*

The classical Gaussian isoperimetric inequality, established in the 70’s independently by Sudakov-Tsirelson and Borell, states that the optimal way to decompose $\mathbb{R}^n$ into two sets of prescribed Gaussian measure, so that the (Gaussian) area of their interface is minimal, is by using two complementing half-planes. This is the Gaussian analogue of the classical Euclidean isoperimetric inequality, and is therefore referred to as the ``single-bubble” case. A natural generalization is to decompose $\mathbb{R}^n$ into $q \geq 3$ sets of prescribed Gaussian measure. It is conjectured that when $q \leq n+1$, the configuration whose interface has minimal (Gaussian) area is given by the Voronoi cells of $q$ equidistant points. For example, for $q=3$ (the ``double-bubble” conjecture) in the plane ($n=2$), the interface is conjectured to be a ``tripod” or ``Y” - three rays meeting at a single point in 120 degree angles. For $q=4$ (the ``triple-bubble” conjecture) in $\mathbb{R}^3$, the interface is conjectured to be a tetrahedral cone. We confirm the Gaussian double-bubble and, more generally, multi-bubble conjectures for all $3 \leq q \leq n+1$. The double-bubble case $q=3$ is simpler, and we will explain why. None of the numerous methods discovered over the years for establishing the classical $q=2$ case seem amenable to the $q \geq 3$ cases, and our method consists of establishing a Partial Differential Inequality satisfied by the isoperimetric profile. To treat $q > 3$, we first prove that locally minimimal configurations must have flat interfaces, and thus convex polyhedral cells. Uniqueness of minimizers up to null-sets is also established. This is joint work with Joe Neeman (UT Austin).

June 21st, 2018

No seminar (Conference at BIU)

May 31st, 2018

Bhaswar Bhattacharya (UPenn) + Elliot Paquette (Ohio)

*Bhaswar Bhattacharya: Large Deviation Variational Problems in Random Combinatorial Structures*

The upper tail problem in the Erdos-Renyi random graph $G\sim\mathcal{G}_{n,p}$, where every edge is included independently with probability $p$, is to estimate the probability that the number of copies of a graph $H$ in $G$ exceeds its expectation by a factor of $1+\delta$. The arithmetic analog of this problem counts the number of $k$-term arithmetic progressions in a random subset of $\{1, 2, \ldots, N\}$, where every element is included independently with probability $p$. The recently developed framework of non-linear large deviations (Chatterjee and Dembo (2016) and Eldan (2017)) shows that the logarithm of these tail probabilities can be reduced to a natural variational problem on the space of weighted graphs/functions. In this talk we will discuss methods for solving these variational problems in the sparse regime ($p \rightarrow 0$), and show how the solutions are often related to extremal problems in combinatorics. (This is based on joint work with Shirshendu Ganguly, Eyal Lubetzky, Xuancheng Shao, and Yufei Zhao.)

*Elliot Paquette: Random matrix point processes via stochastic processes*

In 2007, Virag and Valko introduced the Brownian carousel, a dynamical system that describes the eigenvalues of a canonical class of random matrices. This dynamical system can be reduced to a diffusion, the stochastic sine equation, a beautiful probabilistic object requiring no random matrix theory to understand. Many features of the limiting eigenvalue point process, the Sine--beta process, can then be studied via this stochastic process. We will sketch how this stochastic process is connected to eigenvalues of a random matrix and sketch an approach to two questions about the stochastic sine equation: deviations for the counting Sine--beta counting function and a functional central limit theorem.

May 24th, 2018

No seminar (IMU meeting in Technion)

*TBA*

May 17th, 2018

Ron Peled (TAU)

*The fluctuations of random surfaces*

Random surfaces in statistical physics are commonly modeled by a real-valued function phi on a lattice, whose probability density penalizes nearest-neighbor fluctuations. Precisely, given an even function $V$, termed the potential, the energy $H(\phi)$ is computed as the sum of $V$ over the nearest-neighbor gradients of phi, and the probability density of phi is set proportional to $\exp(-H(\phi))$. The most-studied case is when $V$ is quadratic, resulting in the so-called Gaussian free field. Brascamp, Lieb and Lebowitz initiated in 1975 the study of the global fluctuations of random surfaces for other potential functions and noted that understanding is lacking even in the case of the quartic potential, $V(x)=x^4$. We will review the state of the art for this problem and present recent work with Alexander Magazinov which finally settles the question of obtaining upper bounds for the fluctuations for the quartic and many other potential functions.

May 10th, 2018

David Jerison (MIT) + Ron Rosenthal (Technion)

*David Jerison: Localization of eigenfunctions via an effective potential*

We discuss joint work with Douglas Arnold, Guy David, Marcel Filoche and Svitlana Mayboroda. Consider the Neumann boundary value problem for the operator $L u = - \mbox{div} (A \nabla u) + Vu$ on a Lipschitz domain $\Omega$ and, more generally, on a manifold with or without boundary. The eigenfunctions of $L$ are often localized, as a result of disorder of the potential $V$, the matrix of coefficients $A$, irregularities of the boundary, or all of the above. In earlier work, Filoche and Mayboroda introduced the function $u$ solving $Lu = 1$, and showed numerically that it strongly reflects this localization. Here, we deepen the connection between the eigenfunctions and this {\em landscape} function $u$ by proving that its reciprocal $1/u$ acts as an {\em effective potential}. The effective potential governs the exponential decay of the eigenfunctions of the system and delivers information on the distribution of eigenvalues near the bottom of the spectrum.

*Ron Rosenthal: Eigenvector correlation in the complex Ginibre ensemble *

The complex Ginibre ensemble is a non-Hermitian random matrix on C^N with i.i.d. complex Gaussian entries normalized to have mean zero and variance 1=N. Unlike the Gaussian unitary ensemble, for which the eigenvectors are orthogonal, the geometry of the eigenbases of the Ginibre ensemble are not particularly well understood. We will discuss a some results regarding the analytic and algebraic structure of eigenvector correlations in this matrix ensemble. In particular, we uncover an extended algebraic structure which describes the asymptotic behavior (as N goes to infinity) of these correlations. Our work extends previous results of Chalker and Mehlig [CM98], in which the correlation for pairs of eigenvectors was computed. Based on a joint work with Nick Crawford.

April 26th, 2018

Anirban Basak (WIS)

*Local weak limits of Ising and Potts measures on locally tree-like graphs.*

Consider a sequence of growing graphs converging locally weakly to an infinite (possibly random) tree. As there are uncountably many Ising and Potts Gibbs measures on the limiting tree in the low-temperature regime it is not apriori clear whether the local weak limit of such measures exists and if so, identifying the limit remains a challenge. In this talk, I will describe these limits. The talk is based on joint works with Amir Dembo and Allan Sly.

April 12th, 2018

David Ellis (Queen Mary U) + Benjamin Fehrman (Max Planck Institute)

*David Ellis - The edge-isoperimetric problem for antipodally symmetric subsets of the discrete cube.*

A major open problem in geometry is to solve the isoperimetric problem for n-dimensional real projective space, i.e. to determine, for each real number V, the minimum possible size of the boundary of a (well-behaved) set of volume V, in n-dimensional real projective space. We study a discrete analogue of this question: namely, among all antipodally symmetric subsets of {0,1}^n of fixed size, which sets have minimal edge-boundary? We obtain a complete answer to the second question. This is joint work with Imre Leader (Cambridge)

*Benjamin Fehrman - Well-posedness of stochastic porous media equations with nonlinear, conservative noise.*

In this talk, which is based on joint work with Benjamin Gess, I will describe a pathwise well-posedness theory for stochastic porous media equations driven by nonlinear, conservative noise. Such equations arise in the theory of mean field games, as an approximation to the Dean-Kawasaki equation in fluctuating hydrodynamics, to describe the fluctuating hydrodynamics of a zero range process, and as a model for the evolution of a thin film in the regime of negligible surface tension. Our methods are loosely based on the theory of stochastic viscosity solutions, where the noise is removed by considering a class of test functions transported along underlying stochastic characteristics. We apply these ideas after passing to the equation's kinetic formulation, for which the noise enters linearly and can be inverted using the theory of rough paths.

March 22nd, 2018

Faculty retreat - no seminar

March 29th, 2018

Yinon Spinka (TAU) + Mark Rudelson (UMich)

*Mark Rudelson: Invertibility of the adjacency matrices of random graphs.*

Consider an adjacency matrix of a bipartite, directed, or undirected Erdos-Renyi random graph. If the average degree of a vertex is large enough, then such matrix is invertible with high probability. As the average degree decreases, the probability of the matrix being singular increases, and for a sufficiently small average degree, it becomes singular with probability close to 1. We will discuss when this transition occurs, and what the main reason for the singularity of the adjacency matrix is. This is a joint work with Anirban Basak.

* Yinon Spinka: Finitary codings of Markov random fields*

Let X be a stationary Z^d-process. We say that X can be coded by an i.i.d. process if there is a (deterministic and translation-invariant) way to construct a realization of X from i.i.d. variables associated to the sites of Z^d. That is, if there is an i.i.d. process Y and a measurable map F from the underlying space of Y to that of X, which commutes with translations of Z^d and satisfies that F(Y)=X in distribution. Such a coding is called finitary if, in order to determine the value of X at a given site, one only needs to look at a finite (but random) region of Y. It is known that a phase transition (existence of multiple Gibbs states) is an obstruction for the existence of such a finitary coding. On the other hand, we show that when X is a Markov random field satisfying certain spatial mixing conditions, then X can be coded by an i.i.d. process in a finitary manner. Moreover, the coding radius has exponential tails, so that typically the value of X at a given site is determined by a small region of Y. We give applications to models such as the Potts model, proper colorings and the hard-core model.

March 8th, 2018

Erwin Bolthausen (UZH)

*On the high temperature phase in mean-field spin glasses*

We present a new way to derive the replica symmetric solution for the free energy in mean-field spin glasses. Only the Sherrington-Kirpatrick case has been worked out in details, but the method also works in other cases, for instance for the perceptron (work in progress), and probably also for the Hopfield net. The method is closely related to the TAP equations (for Thouless-Anderson-Palmer). It does not give any new results, presently, but it gives a new viewpoint, and it looks to be quite promising. As the TAP equations are widely discussed in the physics literature, also at low temperature, it is hoped that the method could be extended to this case, too. But this is open, and probably very difficult.

March 15th, 2018

Elie Aidekon (Paris)

*Points of infinite multiplicity of a planar Brownian motion.*

Points of infinite multiplicity are particular points which the Brownian motion visits infinitely often. Following a work of Bass, Burdzy and Khoshnevisan, we construct and study a measure carried by these points. Joint work with Yueyun Hu and Zhan Shi.

Jan 18th, 2018

Oren Louidor (Technion) + Alexander Glazman (TAU)

*Oren Louidor: Dynamical freezing in a spin-glass with logarithmic correlations.*

We consider a continuous time random walk on the 2D torus, governed by the exponential of the discrete Gaussian free field acting as potential. This process can be viewed as Glauber dynamics for a spin-glass system with logarithmic correlations. Taking temperature to be below the freezing point, we then study this process both at pre-equilibrium and in-equilibrium time scales. In the former case, we show that the system exhibits aging and recover the arcsine law as asymptotics for a natural two point temporal correlation function. In the latter case, we show that the dynamics admits a functional scaling limit, with the limit given by a variant of Kolmogorov's K-process, driven by the limiting extremal process of the field, or alternatively, by a super-critical Liouville Brownian motion. Joint work with A. Cortines, J. Gold and A. Svejda.

*Alexander Glazman: Level lines of a random Lipschitz function*

We consider the uniform distribution on Lipschitz functions on the triangular lattice, i.e. all integer-valued functions which differ by 0 or 1 on any two adjacent vertices. We show that with a positive probability such a function exhibits macroscopic level lines. Instead of working directly with Lipschitz functions we map this model to the loop $O(2)$ model with parameter $x=1$. The loop $O(n)$ model is a model for a random collection of non-intersecting loops on the hexagonal lattice, which is believed to be in the same universality class as the spin $O(n)$ model.
A main tool in the proof is a positive association (FKG) property that was recently shown to hold when $n \ge 1$ and $0

Jan 4th, 2018

Sebastien Bubeck (Microsoft) + Percy Deift (NYU)

*Sebastien Bubeck: k-server via multiscale entropic regularization*

I will start by describing how mirror descent is a natural strategy for online decision making, specifically in online learning and metrical task systems. To motivate the k-server problem I will also briefly recall what we know and what we don't know for structured state/action spaces in these models. Using the basic mirror descent calculations I will show how to easily obtain a log(k)-competitive algorithm for k-paging. I will then introduce our new parametrization of fractional k-server on a tree, and explain how to analyze the movement cost of entropy-regularized mirror descent on this parametrization. This leads to a depth*log(k)-competitive (fractional) algorithm for general trees, and log^2(k) for HSTs. I will also briefly mention dynamic embeddings to go beyond the standard log(n) loss in the reduction from general metrics to HSTs. Joint work with Michael B. Cohen, James R. Lee, Yin Tat Lee, and Aleksander Madry.

*Percy Deift: Universality in numerical analysis with some examples of cryptographic algorithms. *

We show that a wide variety of numerical algorithms with random data exhibit universality. Most of the results are computational, but in some important cases universality is established rigorously. We also discuss universality for some cryptographic algorithms. Joint work with C. Pfrany, G. Menon, S. Olver, T. Trogdan and S. Miller.

Dec 28th, 2017

Amir Dembo (Stanford) + Yuval Peres (Microsoft)

*Amir Dembo: Large deviations theory for chemical reaction networks.*

The microscopic dynamics of well-stirred networks of chemical reactions are modeled as jump Markov processes. At large volume, one may expect in this framework to have a straightforward application of large deviation theory. This is not at all true, for the jump rates are typically neither globally Lipschitz, nor bounded away from zero, with both blowup and absorption as quite possible scenarios. In joint work with Andrea Agazzi and Jean-Pierre Eckman, we utilize Lyapunov stability theory to bypass this challenge and to characterize a large class of network topologies that satisfy the full Wentzell-Freidlin theory of asymptotic rates of exit from domains of attraction.

*Yuval Peres: Trace reconstruction for the deletion channel *

In the trace reconstruction problem, an unknown string $x$ of $n$ bits is observed through the deletion channel, which deletes each bit with some constant probability q, yielding a contracted string. How many independent outputs (traces) of the deletion channel are needed to reconstruct $x$ with high probability? The best lower bound known is linear in $n$. Until 2016, the best upper bound was exponential in the square root of $n$. We improve the square root to a cube root using statistics of individual output bits and some inequalities for Littlewood polynomials on the unit circle. This bound is sharp for reconstruction algorithms that only use this statistical information. (Similar results were obtained independently and concurrently by De, O’Donnell and Servedio). If the string $x$ is random, we can show a subpolynomial number of traces suffices by comparison to a random walk. (Joint works with Fedor Nazarov, STOC 2017, with Alex Zhai, FOCS 2017 and with Nina Holden & Robin Pemantle, preprint (2017).)

Dec 21st, 2017

Nadav Yesha (King's College London)

*CLT for small scale mass distribution of toral Laplace eigenfunctions*

In this talk we discuss the fine scale $L^2$-mass distribution of toral Laplace eigenfunctions with respect to random position. For the 2-dimensional torus, under certain flatness assumptions on the Fourier coefficients of the eigenfunctions and generic restrictions on energy levels, both the asymptotic shape of the variance and the limiting Gaussian law are established, in the optimal Planck-scale regime. We also discuss the 3-dimensional case, where the asymptotic behaviour of the variance is analysed in a more restrictive scenario. This is joint work with Igor Wigman.

Dec 7th, 2017

Matan Harel (TAU)

*Discontinuity of the phase transition for the planar random-cluster and Potts models with $q > 4$*

The random-cluster model is a dependent percolation model where the weight of a configuration is proportional to q to the power of the number of connected components. It is highly related to the ferromagnetic q-Potts model, where every vertex is assigned one of q colors, and monochromatic neighbors are encouraged. Through non-rigorous means, Baxter showed that the phase transition is first-order whenever $q > 4$ - i.e. there are multiple Gibbs measures at criticality. We provide a rigorous proof of this claim. Like Baxter, our proof uses the correspondence between the above models and the six-vertex model, which we analyze using the Bethe ansatz and transfer matrix techniques. We also prove Baxter's formula for the correlation length of the models at criticality. This is joint work with Hugo Duminil-Copin, Maxime Gangebin, Ioan Manolescu, and Vincent Tassion.

Nov 30th, 2017

Fanny Augeri (WIS)

*Large deviations principles for random matrices*

In this talk, I will try to present some techniques to handle the problem of large deviations of the spectrum of random matrices. I will focus on the case of macroscopic statistics of the spectrum of Hermitian matrices - in particular Wigner matrices - as the empirical distribution of the eigenvalues, the largest eigenvalue or the traces of powers. In a first part, I will be concerned with the so-called ``objective method''. Coined by David Aldous, this method consists in introducing, given a sequence of random objects, like random finite graphs, a new infinite random object from which one can deduce asymptotic properties of the original sequence. In the context of random matrices, this method has been mainly advertised by Balint Virag, and proven effective in showing universality results for the so-called beta-ensembles. Regarding large deviations of random matrices, this ``objective method'' amounts to embed our sequence of matrices with growing size into an appropriate space on which one is able to understand the large deviations, and carry out a contraction principle. I will review several large deviations principles obtained by this method, given by interpretations of random matrices as either dense or sparse graphs, and point out the limits of this strategy. In a second part, I will present a different approach which is inspired from Ledoux's proof of the large deviations of Wiener chaoses. I will give a large deviations principles for the traces of Gaussian Wigner matrices using this strategy. Similarly as for Wiener chaoses, where the deviations are obtained by translations in the direction of the reproducing kernel, the large deviations of the traces of Gaussian Wigner matrices are due to additive perturbations of the underlying matrix. If time permits, I will explain how this approach can be generalized to large deviations governed by the same phenomenon. In particular, this approach enables us to partially recover some large deviations results for a family of Wigner matrices which exhibit a ``heavy-tail phenomenon'', meaning that the deviations of their spectrum are due to the deviations of a negligible proportion of the entries.

Nov 23rd, 2017

Naomi Feldheim (WIS)

*Persistence of Gaussian Stationary Processes*

Nov 9th, 2017

Ilya Goldsheid (Queen Many University)

*Real and complex eigenvalues of the non-self-adjoint Anderson model*

June 29th, 2017

Amir Dembo (Stanford)

*The criticality of a randomly-driven front*

Consider independent continuous-time random walks on the integers to the right of a front R(t). Starting at R(0)=0, whenever a particle attempts to jump into the front, the latter instantaneously advances k steps to the right, absorbing all particles along its path. Sly (2016) resolves the question of Kesten and Sidoravicius (2008), by showing that for k=1 the front R(t) advances linearly once the particle density exceeds 1, but little is known about the large t asymptotic of R(t) at critical density 1. In a joint work with L-C Tsai, for the variant model with k taken as the minimal random integer such that exactly k particles are absorbed by the move of R(t), we obtain both scaling exponent and the random scaling limit for the front at the critical density 1. Our result unveils a rarely seen phenomenon where the macroscopic scaling exponent is sensitive to the initial local fluctuations (with the scaling limit oscillating between instantaneous super and sub-critical phases).

June 15th, 2017

Pyotr Nayar (Technion)

*Gaussian mixtures with applications to entropy inequalities and convex geometry*

We say that a symmetric random variable X is a Gaussian mixture if X has the same distribution as YG, where G is a standard Gaussian random variable, and Y is a positive random variable independent of G. In the first part of the talk we use this simple notion to study the Shannon entropy of sums of independent random variables. In the second part we investigate, using Gaussian mixtures, certain topics related to the geometry of $B_p^n$ balls, including optimal Khinchine-type inequalities and Schur-type comparison for volumes of section and projections of these sets. In the third part we discuss extensions of Gaussian correlation inequality to the case of p-stable laws and uniform measure on the Euclidean sphere. Based on a joint work with Alexandros Eskenazis and Tomasz Tkocz.

June 8th, 2017

Nishant Chandgotia (Tel Aviv University)

*Irrational rotations, random affine transformations and the central limit theorem*

It is a well-known result from Hermann Weyl that if alpha is an irrational number in [0,1) then the number of visits of successive multiples of alpha modulo one in an interval contained in [0,1) is proportional to the size of the interval. In this talk we will revisit this problem, now looking at finer joint asymptotics of visits to several intervals with rational end points. We observe that the visit distribution can be modelled using random affine transformations; in the case when the irrational is quadratic we obtain a central limit theorem as well. Not much background in probability will be assumed. This is in joint work with Jon Aaronson and Michael Bromberg.

March 9th, 2017

Sasha Shamov

*Conditional determinantal processes are determinantal*

A determinantal point process governed by a locally trace class Hermitian contraction kernel on a measure space $E$ remains determinantal when conditioned on its configuration on an arbitrary measurable subset $B \subset E$. Moreover, the conditional kernel can be chosen canonically in a way that is "local" in a non-commutative sense, i.e. invariant under "restriction" to closed subspaces $L^2(B) \subset P \subset L^2(E)$. Using the properties of the canonical conditional kernel we establish a conjecture of Lyons and Peres: if $K$ is a projection then almost surely all functions in its image can be recovered by sampling at the points of the process.

Feb 9th, 2017

Alexander Fish (Sydney)

*The values of quadratic forms on difference sets, measure rigidity and equidistribution.*

Given a quadratic form Q in d variables over the integers, e.g. Q(x,y,z) = xy - z^2, and a set of positive density E in Z^d, we investigate what kind of structure can be found in the set Q(E-E). We will see that if d >= 3, and Q is indefinite, then the measure rigidity, due to Bourgain-Furman-Lindenstrauss-Mozes or Benoist-Quint, of the action of the group of the symmetries of Q implies that there exists k >=1 such that k^2*Q(Z^d) is a subset of Q(E-E). We will give an alternative proof of the theorem for the case Q(x,y,z) = xy - z^2 that uses more classical equidistribution results of Vinogradov, and Weyl, as well as a more recent result by Frantzikinakis-Kra. The latter proof extends the theorem to other polynomials having a much smaller group of symmetries. Based on joint works with M. Bjorklund (Chalmers), and K. Bulinski (Sydney).

Jan 19th, 2017

Jay Rosen

*Tightness for the Cover Time of $S^{2}$*

Let M be a smooth, compact, connected two-dimensional, Riemannian manifold without boundary, and let $ C_{\epsilon}$ be the amount of time needed for the Brownian motion to come within (Riemannian) distance $\epsilon$ of all points in M. The first order asymptotics of $ C_{\epsilon}$ as $\epsilon$ goes to 0 are known. We show that for the two dimensional sphere $\sqrt{C_{\epsilon}}-2\sqrt{2}\left( \log \epsilon^{-1}- \frac{1}{4}\log\log \epsilon^{-1}\right)$is tight. Joint work with David Belius and Ofer Zeitouni.

Jan 12th, 2017

Ran Tessler (ETH) + Assaf Naor (Princeton)

*Ran Tessler (11:00): A sharp threshold for Hamiltonian spheres in a random 2-complex*

We define the notion of Hamiltonian sphere - a 2-complex homeomorphic to a sphere which uses all vertices. We prove an explicit sharp threshold for the appearance of Hamiltonian spheres in the Linial-Meshulam model for random 2-complexes. The proof combines combinatorial, probabilistic and geometric arguments. Based on a joint work with Zur luria.

*Assaf Naor (12:00): A new vertical-versus-horizontal isoperimetric inequality on the Heisenberg group, with applications to metric geometry and approximation algorithms.*

In this talk we will show that for every measurable subset of the Heisenberg group of dimension at least 5, an appropriately defined notion of its "vertical perimeter" is at most a constant multiple of its horizontal (Heisenberg) perimeter. We will explain how this new isoperimetric-type inequality solves open questions in analysis (an endpoint estimate for a certain singular integral on $W^{1,1}$), metric geometry (sharp nonembeddability into $L_1$) and approximation algorithms (asymptotic evaluation of the performance of the Goemans-Linial algorithm for the Sparsest Cut problem). Joint work with Robert Young.

Jan 5th, 2017

Amir Dembo

*Title: Walking within growing domains: recurrence versus transience*

When is simple random walk on growing in time d-dimensional domains recurrent? For domain growth which is independent of the walk, we review recent progress and related universality conjectures about a sharp recurrence versus transience criterion in terms of the growth rate. We compare this with the question of recurrence/transience for time varying conductance models, where Gaussian heat kernel estimates and evolving sets play an important role. We also briefly contrast such expected universality with examples of the rich behavior encountered when monotone interaction enforces the growth as a result of visits by the walk to the current domain's boundary. This talk is based on joint works with Ruojun Huang, Ben Morris, Yuval Peres, Vladas Sidoravicius and Tianyi Zheng.

For previous years see: 2010-2016, 2007-2010, 2005-2007 (maintained by Boaz Tsaban) 2000-2005 (maintained by Gideon Schechtman)