Seminar at SMU Delhi
August 22, 2013 (Thursday) ,
3:30 PM at Webinar
Indian Statistical Institute, Delhi
Polya-Eggenberger-Friedman Urn Models: A New Approach
Abstract of Talk
In this talk we will consider the classical as well as some novel generalizations including infinite color generalization of the Polya-Eggenberger-Friedman Urn Models and show that in the balanced case the configuration of the urn after n steps can be obtained by sampling the underlying Markov chain at random time which depends on n. We will show that most of the existing results may be derived using this representation. Moreover new results will be derived particularly for the infinite color case.
If time permits then we will also discuss further generalization to urn models with negative reinforcement and show that the representation can be used to solve certain open problem in Computer Science.
[Most of the talk will be based on joint work with Debleena Thacker. The negative reinforcement urn models part is a joint work with Gursharn Kaur and Debleena Thacker.]