Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

Variations on the Matching Problem

Judkovich, David

Abstract Details

2019, Master of Sciences, Case Western Reserve University, Mathematics.
We consider two extensions of the matching problem of classical combinatorial probability. We first consider the number of approximate matches in a randomly chosen permutation; an element is called an approximate match if it is within c of its original position. We also consider the distribution of the number of k-cycles of a random permutation and, more generally, a permutation conditioned to only contain cycles of length not exceeding r. In both cases we prove that the distributions are approximately Poisson under suitable conditions and obtain bounds on the total variation distance between the distributions and their respective Poisson limiting distributions. The main technical tool used is Stein's method of exchangeable pairs.
Elizabeth Meckes (Advisor)
Mark Meckes (Committee Member)
Stanislaw Szarek (Committee Member)
41 p.

Recommended Citations

Citations

  • Judkovich, D. (2019). Variations on the Matching Problem [Master's thesis, Case Western Reserve University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=case1554308993793382

    APA Style (7th edition)

  • Judkovich, David. Variations on the Matching Problem. 2019. Case Western Reserve University, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=case1554308993793382.

    MLA Style (8th edition)

  • Judkovich, David. "Variations on the Matching Problem." Master's thesis, Case Western Reserve University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=case1554308993793382

    Chicago Manual of Style (17th edition)