학과 세미나 및 콜로퀴엄
구분 | 학과 세미나/콜로퀴엄 |
분류 | Discrete Math |
제목 | Graph dynamical systems: Some combinatorial problems related to Markov chains |
Abstract | An order-t Markov chain is a discrete process where the outcome of each trial is linearly determined by the outcome of most recent t trials. The set of outcomes can be modelled by functions from a set V to a set F. The linear influences can be described as t-linear maps. When t=1, the set of linear influences can be conveniently described as digraphs on the vertex set V. Most of our talk is concerned with a combinatorial counterpart of Markov chains, where we can only tell the difference between zero probability and positive probability. We especially focus on the Boolean case, namely F is a 2-element set. This talk is to introduce several easy-to-state combinatorial problems about discrete dynamics, which arise from the combinatorial considerations of Markov chains. |
일시 | 2015-08-05 (Wed) / 15:00 ~ 15:50 |
장소 | E6-1, ROOM 1409 |
강연언어 | 영어 |
강연자성명 | Yaokun Wu |
강연자소속 | Shanghai Jiao Tong University, Shanghai, China |
강연자홈페이지 | |
기타정보 | |
초청인 | Sung-Ho Kim |
URL | http://mathsci.kaist.ac.kr/~sangil/seminar/entry/20150805/ |
담당자 | |
연락처 |