Emeritus Professorial Lecture: James Fill
225 بار بازدید -
پارسال
-
James Fill, an emeritus professor
James Fill, an emeritus professor of applied mathematics and statistics, is an expert in the areas of probability and stochastic processes, especially as applied to theoretical computer science.
Fill has authored many papers and made research contributions to a variety of topics, including the analysis of algorithms, Markov chains and perfect simulation, random graphs, matrix analysis, and partially ordered sets. Current interests include random trees and the geometry and simulation of multivariate (Pareto) records.
After receiving his PhD in statistics from the University of Chicago, Fill was an assistant professor of statistics at Stanford University before joining the Whiting faculty and has held visiting positions at the University of Chicago, MIT, and Microsoft Research. He is a Fellow of the American Mathematical Society and of the Institute of Mathematical Statistics and has served since 2006 as the second editor-in-chief of Journal of Theoretical Probability. Fill is a four-time recipient of the Professor Joel Dean Award for Excellence in Teaching.
Abstract:
Graphs known as trees have been of interest to mathematicians for more than 150 years, and to Fill since his undergraduate years minoring in computer science. In this lecture, Fill will describe a model for random trees known as simply generated trees and the very closely related notion of critical Galton–Watson trees conditioned on size. After a brief historical review, he will demonstrate how his work on trees, from past joint projects with former PhD students Bob Dobrow and Nevin Kapur and the late great mathematician Philippe Flajolet to current work with Uppsala University's Svante Janson and Stephan Wagner, has benefited from the use of three fields of mathematics: probability, complex variables, and real analysis. The focus of the talk will narrow gradually to an asymptotic study of (i) sums of powers of subtree sizes and (ii) the so-called "shape functional" for conditioned critical Galton–Watson trees.
Fill has authored many papers and made research contributions to a variety of topics, including the analysis of algorithms, Markov chains and perfect simulation, random graphs, matrix analysis, and partially ordered sets. Current interests include random trees and the geometry and simulation of multivariate (Pareto) records.
After receiving his PhD in statistics from the University of Chicago, Fill was an assistant professor of statistics at Stanford University before joining the Whiting faculty and has held visiting positions at the University of Chicago, MIT, and Microsoft Research. He is a Fellow of the American Mathematical Society and of the Institute of Mathematical Statistics and has served since 2006 as the second editor-in-chief of Journal of Theoretical Probability. Fill is a four-time recipient of the Professor Joel Dean Award for Excellence in Teaching.
Abstract:
Graphs known as trees have been of interest to mathematicians for more than 150 years, and to Fill since his undergraduate years minoring in computer science. In this lecture, Fill will describe a model for random trees known as simply generated trees and the very closely related notion of critical Galton–Watson trees conditioned on size. After a brief historical review, he will demonstrate how his work on trees, from past joint projects with former PhD students Bob Dobrow and Nevin Kapur and the late great mathematician Philippe Flajolet to current work with Uppsala University's Svante Janson and Stephan Wagner, has benefited from the use of three fields of mathematics: probability, complex variables, and real analysis. The focus of the talk will narrow gradually to an asymptotic study of (i) sums of powers of subtree sizes and (ii) the so-called "shape functional" for conditioned critical Galton–Watson trees.
پارسال
در تاریخ 1401/12/26 منتشر شده
است.
225
بـار بازدید شده