Department of

Mathematics


Seminar Calendar
for Probability Seminar events the year of Friday, February 26, 2021.

     .
events for the
events containing  

(Requires a password.)
More information on this calendar program is available.
Questions regarding events or the calendar should be directed to Tori Corkery.
     January 2021          February 2021            March 2021     
 Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa
                 1  2       1  2  3  4  5  6       1  2  3  4  5  6
  3  4  5  6  7  8  9    7  8  9 10 11 12 13    7  8  9 10 11 12 13
 10 11 12 13 14 15 16   14 15 16 17 18 19 20   14 15 16 17 18 19 20
 17 18 19 20 21 22 23   21 22 23 24 25 26 27   21 22 23 24 25 26 27
 24 25 26 27 28 29 30   28                     28 29 30 31         
 31                                                                

Tuesday, March 16, 2021

2:00 pm in Zoom Meeting (email daesungk@illinois.edu for info),Tuesday, March 16, 2021

Solution to Enflo's problem

Paata Ivanishvili (North Carolina State University)

Abstract: Pick any finite number of points in a Hilbert space. If they coincide with vertices of a parallelepiped then the sum of the squares of the lengths of its sides equals the sum of the squares of the lengths of the diagonals (parallelogram law). If the points are in a general position then we can define sides and diagonals by labeling these points via vertices of the discrete cube {0,1}^n. In this case the sum of the squares of diagonals is bounded by the sum of the squares of its sides no matter how you label the points and what n you choose. In a general Banach space we do not have parallelogram law. Back in 1978 Enflo asked: in an arbitrary Banach space if the sum of the squares of diagonals is bounded by the sum of the squares of its sides for all parallelepipeds (up to a universal constant), does the same estimate hold for any finite number of points (not necessarily vertices of the parallelepiped)? In the joint work with Ramon van Handel and Sasha Volberg we positively resolve Enflo's problem. Banach spaces satisfying the inequality with parallelepipeds are called of type 2 (Rademacher type 2), and Banach spaces satisfying the inequality for all points are called of Enflo type 2. In particular, we show that Rademacher type and Enflo type coincide.

Tuesday, March 23, 2021

2:00 pm in Zoom Meeting (email daesungk@illinois.edu for info),Tuesday, March 23, 2021

Phylogenomics: Inverting Random Trees

Sebastien Roch (University of Wisconsin-Madison)

Abstract: Phylogenomic analysis, in particular the estimation of species phylogenies from genome-scale data, is a common step in modern evolutionary studies. This estimation is complicated by the fact that genes evolve under biological processes that produce discordant trees. Such processes include horizontal gene transfer (HGT), incomplete lineage sorting (ILS), and gene duplication and loss (GDL), all of which can be modeled using specialized random tree distributions. I will survey some recent results regarding the analysis of these probabilistic models. Specifically their identifiability, or "invertibility," will be discussed as well as the asymptotic properties of species tree estimation methods (time permitting). Based on joint works with Max Bacharach, Brandon Legried, Erin Molloy, Elchanan Mossel, Allan Sly, Tandy Warnow, Shuqi Yu.

Tuesday, March 30, 2021

2:00 pm in Zoom Meeting (email daesungk@illinois.edu for info),Tuesday, March 30, 2021

Exponential concentration of overlap, free energy, and replica symmetry breaking for inhomogeneous Sherrington-Kirkpatrick Spin glass

Qiang Wu (UIUC)

Abstract: Multi-species Sherrington-Kirkpatrick Spin glass model, as an inhomogeneous generalization of classical SK model, was first introduced by Barra etal in 2015, later Panchenko set up the Parisi formula to compute limiting free energy at all temperatures. However, all those results can only hold when the disorder variance matrix is positive semi-definite. For the indefinite MSK model, nearly nothing rigorous is known, physicists conjectured that this model has some intrinsic difference with the positive definite case. In this talk, we will discuss some fluctuation results for the general MSK model in replica symmetric regime. First, A unified argument for the exponential concentration of overlap will be presented, and this concentration result further enables one to prove a CLT of free energy. Besides that, we also introduce a new species-wise cavity approach to study the fluctuation of overlap vectors, and this approach does not require positive definite assumption. The fluctuation results also suggest the phase boundary (known as AT line) of replica symmetry and replica symmetry breaking for general MSK model, we will conclude with an explicit form of conjectured AT equation.

Tuesday, April 6, 2021

2:00 pm in Zoom Meeting (email daesungk@illinois.edu for info),Tuesday, April 6, 2021

Modified log-Sobolev inequalities, Beckner inequalities and moment estimates

Radek Adamczak (University of Warsaw)

Abstract: I will present recent results concerning the equivalence between the modified log-Sobolev inequality and a family of Beckner type inequalities with constants uniformly separated from zero. Next I will discuss moment estimates which can be derived from such inequalities, generalizing previous results due to Aida and Stroock, based on a stronger log-Sobolev inequality due to Federbush and Gross. If time permits I will present examples to moment estimates for certain Cauchy type measures, for invariant measures of Glauber dynamics and on the Poisson path space. Based on joint work with B. Polaczyk and M. Strzelecki.

Wednesday, April 14, 2021

3:00 pm in Zoom Meeting (email daesungk@illinois.edu for info),Wednesday, April 14, 2021

Random Graph Matching with Improved Noise Robustness

Konstantin Tikhomirov (Georgia Institute of Technology)

Abstract: Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields such as computer vision and biology. In this work we will discuss a new algorithm for exact matching of correlated Erdos-Renyi graphs. Based on joint work with Cheng Mao and Mark Rudelson.

Tuesday, April 20, 2021

2:00 pm in Zoom Meeting (email daesungk@illinois.edu for info),Tuesday, April 20, 2021

To Be Announced

Firas Rassoul-Agha (University of Utah)

Tuesday, April 27, 2021

2:00 pm in Zoom Meeting (email daesungk@illinois.edu for info),Tuesday, April 27, 2021

To Be Announced

Wenqing Hu (Missouri University of Science and Technology)

Tuesday, May 4, 2021

2:00 pm in Zoom Meeting (email daesungk@illinois.edu for info),Tuesday, May 4, 2021

To Be Announced

Jeremy Hoskins (University of Chicago)