Title	Polynomial Convolutions and (finite) free probability
Creator	Marcus, Adam
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2016-12-06T09:00
Description	My talk will discuss ongoing work in developing finite random matrix techniques that have been motivated by free probability. The key player on the finite side of the correspondence will be the characteristic polynomial. I will show that certain binary operations on polynomials converge to the free additive and multiplicative convolutions and how one can use these operations to make statements about discrete, finite matrix ensembles that exhibit "free-like" behavior. In particular, I will introduce a free probability analogue of the "Poisson paradigm," as introduced by Alon and Spencer in their book on Probabilistic Combinatorics.
Extent	51 minutes
Subject	Mathematics; Functional analysis; Probability theory and stochastic processes; Operator theory/algebras
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Princeton University
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2017-05-15
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0347457
URI	http://hdl.handle.net/2429/61626
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos