Advanced Search
DSpace@MIT

Kac's random walk and coupon collector's process on posets

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.advisor Igor Pak. en_US
dc.contributor.author Sidenko, Sergiy en_US
dc.contributor.other Massachusetts Institute of Technology. Dept. of Mathematics. en_US
dc.date.accessioned 2008-12-11T18:26:40Z
dc.date.available 2008-12-11T18:26:40Z
dc.date.copyright 2008 en_US
dc.date.issued 2008 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/43781
dc.description Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2008. en_US
dc.description Includes bibliographical references (p. 100-104). en_US
dc.description.abstract In the first part of this work, we study a long standing open problem on the mixing time of Kac's random walk on SO(n, R) by random rotations. We obtain an upper bound mix = O (n2.5 log n) for the weak convergence which is close to the trivial lower bound [Omega] (n2). This improves the upper bound O (n4 log n) by Diaconis and SaloffCoste 1131. The proof is a variation on the coupling technique we develop to bound the mixing time for compact Markov chains, which is of independent interest. In the second part, we consider a generalization of the coupon collector's problem in which coupons are allowed to be collected according to a partial order. Along with the discrete process, we also study the Poisson version which admits a tractable parametrization. This allows us to prove convexity of the expected completion time E T with respect to sample probabilities, which has been an open question for the standard coupon collector's problem. Since the exact computation of E - is formidable, we use convexity to establish the upper and the lower bound (these bounds differ by a log factor). We refine these bounds for special classes of posets. For instance, we show the cut-off phenomenon for shallow posets that are closely connected to the classical Dixie Cup problem. We also prove the linear growth of the expectation for posets whose number of chains grows at most exponentially with respect to the maximal length of a chain. Examples of these posets are d-dimensional grids, for which the Poisson process is usually referred as the last passage percolation problem. In addition, the coupon collector's process on a poset can be used to generate a random linear extension. en_US
dc.description.abstract (cont.) We show that for forests of rooted directed trees it is possible to assign sample probabilities such that the induced distribution over all linear extensions will be uniform. Finally, we show the connection of the process with some combinatorial properties of posets. en_US
dc.description.statementofresponsibility by Sergiy Sidenko. en_US
dc.format.extent 104 p. en_US
dc.language.iso eng en_US
dc.publisher Massachusetts Institute of Technology en_US
dc.rights M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. en_US
dc.rights.uri http://dspace.mit.edu/handle/1721.1/7582 en_US
dc.subject Mathematics. en_US
dc.title Kac's random walk and coupon collector's process on posets en_US
dc.type Thesis en_US
dc.description.degree Ph.D. en_US
dc.contributor.department Massachusetts Institute of Technology. Dept. of Mathematics. en_US
dc.identifier.oclc 261135189 en_US


Files in this item

Name Size Format Description
261135189-MIT.pdf 3.010Mb PDF Full printable version

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage