Title: New Mathematics from Biology: Limit theorems for the number of matchings in random graphs
Speaker: Professor Greg Rempala, Deputy Director, MBI, and Professor of Biostatistics, OSU College of Public Health
Seminar Type: Analysis and Operator Theory
Abstract: I will give some examples of how questions in biological sciences may inspire interesting mathematical ones. The focus will be on the so called network connectivity and redundancy test, which in mathematical terms is a question about asymptotic distribution of the number of matchings in a bipartite random graphs. I will show how this problem may be elegantly solved using some simple tools from modern stochastic analysis like multiples stochastic integrals and martingale decompositions. The methods discussed may be also used in a broader context for instance, when analyzing functionals of random matrices.
