Past Probability Seminars Spring 2020: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
Line 23: Line 23:


== Thursday, October 1 [http://www.math.wisc.edu/~roch Sebastien Roch], [http://www.math.wisc.edu/ UW-Madison]  ==
== Thursday, October 1 [http://www.math.wisc.edu/~roch Sebastien Roch], [http://www.math.wisc.edu/ UW-Madison]  ==
Title: '''Mathematics of the Tree of Life--From Genomes to Phylogenetic Trees and Beyond'''
Abstract:
The reconstruction of the Tree of Life is an old problem in evolutionary biology which has benefited from various branches of mathematics, including probability, combinatorics, algebra, and geometry. Modern DNA sequencing technologies are producing a deluge of new data on a vast array of organisms--transforming how we view the Tree of Life and how it is reconstructed. I will survey recent progress on some mathematical and computational questions that arise in this context. No biology background will be assumed. (This is a practice run for a plenary talk at an AMS meeting.)


== Thursday, October 8, No Seminar due to the [http://sites.math.northwestern.edu/mwp/ Midwest Probability Colloquium] ==
== Thursday, October 8, No Seminar due to the [http://sites.math.northwestern.edu/mwp/ Midwest Probability Colloquium] ==

Revision as of 18:39, 23 September 2015


Fall 2015

Thursdays in 901 Van Vleck Hall at 2:25 PM, unless otherwise noted.

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 17, Nicholas A. Cook, UCLA, 2:25pm Van Vleck B325

Please note the unusual location, Van Vleck Hall B325

Title: Random regular digraphs: singularity and spectrum

We consider two random matrix ensembles associated to large random regular digraphs: (1) the 0/1 adjacency matrix, and (2) the adjacency matrix with iid bounded edge weights. Motivated by universality conjectures, we show that the spectral distribution for the latter ensemble is asymptotically described by the circular law, assuming the graph has degree linear in the number of vertices. Towards establishing the same result for the adjacency matrix without iid weights, we prove that it is invertible with high probability. Along the way we make use of Stein's method of exchangeable pairs to establish some graph discrepancy properties.

Thursday, September 24, No seminar

Thursday, October 1 Sebastien Roch, UW-Madison

Title: Mathematics of the Tree of Life--From Genomes to Phylogenetic Trees and Beyond

Abstract: The reconstruction of the Tree of Life is an old problem in evolutionary biology which has benefited from various branches of mathematics, including probability, combinatorics, algebra, and geometry. Modern DNA sequencing technologies are producing a deluge of new data on a vast array of organisms--transforming how we view the Tree of Life and how it is reconstructed. I will survey recent progress on some mathematical and computational questions that arise in this context. No biology background will be assumed. (This is a practice run for a plenary talk at an AMS meeting.)

Thursday, October 8, No Seminar due to the Midwest Probability Colloquium

Midwest Probability Colloquium

Thursday, October 15, Louis Fan, UW-Madison

Thursday, October 22, Tom Kurtz, UW-Madison

Thursday, October 29, Ecaterina Sava-Huss, Cornell

TBA

Thursday, November 5, TBA

Thursday, November 12, Janna Lierl, UIUC

Thursday, November 19, David Herzog Iowa State

Thursday, November 26, No Seminar, Thanksgiving Break

Thursday, December 3, Leonid Petrov, University of Virginia

Thursday, December 10, Elizabeth Meckes, Case Western Reserve University

Past Seminars