Difference between revisions of "Probability Seminar"

From Math
Jump to: navigation, search
(Thursday, September 28, 2017, TBA)
(7 intermediate revisions by 2 users not shown)
Line 9: Line 9:
  
  
 +
== Thursday, September 14, 2017, [https://math.temple.edu/~brider/ Brian Rider] [https://math.temple.edu/ Temple University] ==
  
 +
'''A universality result for the random matrix hard edge'''
  
 +
The hard edge refers to the distribution of the smallest singular value for certain ensembles of random matrices, or, and what is the same, that of the minimal point of a logarithmic gas constrained to the positive half line. For any "inverse temperature" and “quadratic" potential the possible limit laws (as the dimension, or number of particles, tends to infinity) was characterized by Jose Ramirez and myself in terms of the spectrum of a (random) diffusion generator. Here we show this picture persists for more general convex polynomial potentials. Joint work with Patrick Waters.
  
<!-- == Monday, January 9, [http://www.stat.berkeley.edu/~racz/ Miklos Racz], Microsoft Research ==-->
+
<!-- == Thursday, September 21, 2017, TBA==-->
 +
 
 +
<!-- == Thursday, September 28, 2017, TBA ==
 +
== Thursday, October 5, 2017 ==
 +
== Thursday, October 12, 2017 ==
 +
== Thursday, October 19, 2017 == -->
 +
 
 +
== Thursday, October 26, 2017, [http://www.math.toronto.edu/matetski/ Konstantin Matetski] [https://www.math.toronto.edu/ Toronto] ==
 +
== Thursday, November 2, 2017, TBA ==
 +
== Thursday, November 9, 2017, TBA ==
 +
== <span style="color:red"> Friday,</span> November 17, 2017,  <span style="color:red"> 1pm </span> [http://math.depaul.edu/kliechty/ Karl Leichty] [https://csh.depaul.edu/academics/mathematical-sciences/Pages/default.aspx DePaul University] ==
  
<!--
 
== <span style="color:red">  Monday</span>, January 9,  <span style="color:red"> 4pm, B233 Van Vleck </span> [http://www.stat.berkeley.edu/~racz/ Miklos Racz], Microsoft Research ==
 
  
 
<div style="width:320px;height:50px;border:5px solid black">
 
<div style="width:320px;height:50px;border:5px solid black">
Line 21: Line 32:
 
</div>
 
</div>
  
 
+
== Thursday, November 30, 2017, TBA ==
Title: '''Statistical inference in networks and genomics'''
+
== Thursday, December 7, 2017,  TBA ==
 
+
== Thursday, December 14, 2017, TBA ==
 
+
Abstract:
+
From networks to genomics, large amounts of data are increasingly available and play critical roles in helping us understand complex systems. Statistical inference is crucial in discovering the underlying structures present in these systems, whether this concerns the time evolution of a network, an underlying geometric structure, or reconstructing a DNA sequence from partial and noisy information. In this talk I will discuss several fundamental detection and estimation problems in these areas.
+
 
+
I will present an overview of recent developments in source detection and estimation in randomly growing graphs. For example, can one detect the influence of the initial seed graph? How good are root-finding algorithms? I will also discuss inference in random geometric graphs: can one detect and estimate an underlying high-dimensional geometric structure? Finally, I will discuss statistical error correction algorithms for DNA sequencing that are motivated by DNA storage, which aims to use synthetic DNA as a high-density, durable, and easy-to-manipulate storage medium of digital data.
+
-->
+
 
+
 
+
== Thursday, September 7, 2017 ==
+
== Thursday, September 14, 2017 ==
+
== Thursday, September 21, 2017 ==
+
 
+
== Thursday, September 28, 2017 ==
+
== Thursday, October 5, 2017 ==
+
== Thursday, October 12, 2017 ==
+
== Thursday, October 19, 2017 ==
+
== Thursday, October 26, 2017 ==
+
== Thursday, November 2, 2017 ==
+
== Thursday, November 9, 2017 ==
+
== Thursday, November 16, 2017 ==
+
== Thursday, November 23, 2017 ==
+
== Thursday, November 30, 2017 ==
+
== Thursday, December 7, 2017 ==
+
== Thursday, December 14, 2017 ==
+
  
  

Revision as of 11:28, 3 October 2017


Fall 2017

Thursdays in 901 Van Vleck Hall at 2:25 PM, unless otherwise noted. We usually end for questions at 3:15 PM.

If you would like to sign up for the email list to receive seminar announcements then please send an email to join-probsem@lists.wisc.edu.


Thursday, September 14, 2017, Brian Rider Temple University

A universality result for the random matrix hard edge

The hard edge refers to the distribution of the smallest singular value for certain ensembles of random matrices, or, and what is the same, that of the minimal point of a logarithmic gas constrained to the positive half line. For any "inverse temperature" and “quadratic" potential the possible limit laws (as the dimension, or number of particles, tends to infinity) was characterized by Jose Ramirez and myself in terms of the spectrum of a (random) diffusion generator. Here we show this picture persists for more general convex polynomial potentials. Joint work with Patrick Waters.


Thursday, October 26, 2017, Konstantin Matetski Toronto

Thursday, November 2, 2017, TBA

Thursday, November 9, 2017, TBA

Friday, November 17, 2017, 1pm Karl Leichty DePaul University

Please note the unusual day and time

Thursday, November 30, 2017, TBA

Thursday, December 7, 2017, TBA

Thursday, December 14, 2017, TBA

Past Seminars