Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, June 29, 2006, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Shuji Kijima (The University of Tokyo)

Perfect Sampler for Closed Jackson Networks

I will talk about a perfect sampler based on CFTP algorithm for closed Jackson networks. The Jackson network is one of the basic and significant models of queueing networks, and it is well-known that the network has a product form solution as the equilibrium state of the jobs in the network. In 1996, Propp and Wilson devised the monotone CFTP algorithm, which realizes a perfect sampler that provides a random sample exactly according to the stationary distribution of a monotone Markov chain. We propose a new Markov chain for Jackson network, which is NOT the simulation of the transitions of jobs in the network, but whose unique stationary distribution is the product form solution. We show the chain is monotone and construct a monotone CFTP algorithm.

Joint work with Tomomi Matsui.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login