本文印刷
全画面プリント
東京確率論セミナー
過去の記録 ～05/23｜次回の予定｜今後の予定 05/24～
| 開催情報 | 月曜日 16:00～17:30 数理科学研究科棟(駒場) 126号室 |
|---|---|
| 担当者 | 佐々田槙子、中島秀太（明治大学）、星野壮登（東京科学大学） |
| セミナーURL | https://sites.google.com/view/tokyo-probability-seminar23/ |
2017年11月27日(月)
16:00-17:30 数理科学研究科棟(駒場) 128号室
Antar Bandyopadhyay 氏 (Indian Statistical Institute)
Random Recursive Tree, Branching Markov Chains and Urn Models (ENGLISH)
Antar Bandyopadhyay 氏 (Indian Statistical Institute)
Random Recursive Tree, Branching Markov Chains and Urn Models (ENGLISH)
[ 講演概要 ]
In this talk, we will establish a connection between random recursive tree, branching Markov chain and urn model. Exploring the connection further we will derive fairly general scaling limits for urn models with colors indexed by a Polish Space and show that several exiting results on classical/non-classical urn schemes can be easily derived out of such general asymptotic. We will further show that the connection can be used to derive exact asymptotic for the sizes of the connected components of a "random recursive forest", obtained by removing the root of a random recursive tree.
[This is a joint work with Debleena Thacker]
In this talk, we will establish a connection between random recursive tree, branching Markov chain and urn model. Exploring the connection further we will derive fairly general scaling limits for urn models with colors indexed by a Polish Space and show that several exiting results on classical/non-classical urn schemes can be easily derived out of such general asymptotic. We will further show that the connection can be used to derive exact asymptotic for the sizes of the connected components of a "random recursive forest", obtained by removing the root of a random recursive tree.
[This is a joint work with Debleena Thacker]
