#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2012

2017

- This year (1)
- Last five years (9)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Prateek Bhakta, Sarah Miracle, Dana Randall, Amanda Pascoe Streib
- ArXiv
- 2012

Sampling permutations from S n is a fundamental problem from probability theory. The nearest neighbor transposition chain M nn is known to converge in time Θ(n 3 log n) in the uniform case [18] and time Θ(n 2) in the constant bias case, in which we put adjacent elements in order with probability p = 1/2 and out of order with probability 1 − p [2]. Here we… (More)

We study the mixing time of a Markov chain Mnn on permutations that performs nearest neighbor transpositions in the non-uniform setting, a problem arising in the context of self-organizing lists. We are given " positively biased " probabilities {pi,j ≥ 1/2} for all i < j and let pj,i = 1 − pi,j. In each step, the chain Mnn chooses two adjacent elements k,… (More)

- Prateek Bhakta, Sarah Miracle, +51 authors Yi Wu
- 2013

- Prateek Bhakta, Sarah Miracle, Dana Randall
- SODA
- 2014

The Schelling Segregation Model was proposed by Thomas Schelling in 1971 as a means of explaining possible causes of racial segregation in cities. He considered residents of two types, say red and blue, where each person prefers the majority of his or her neighbors to have the same color. He showed through simulations that even mild preferences of this type… (More)

The Schelling segregation model attempts to explain possible causes of racial segregation in cities. Schelling considered residents of two types, where everyone prefers that the majority of his or her neighbors are of the same type. He showed through simulations that even mild preferences of this type can lead to segregation if residents move whenever they… (More)

Markov chains are fundamental tools used throughout the sciences and engineering; the design and analysis of Markov Chains has been a focus of theoretical computer science for the last 20 years. A Markov Chain takes a random walk in a large state space Ω, converging to a target stationary distribution π over Ω. The number of steps needed for the random walk… (More)

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often #P-complete, so we consider approximation algorithms for counting and uniform sampling. We show that for certain classes of posets, biased Markov chains that walk along edges of their Hasse… (More)

- Prateek Bhakta, MARKOV CHAINS, +6 authors David Goldberg
- 2016

To my parents Tarulata and Jayesh who have all my life always been my strongest supporters. To my sister Smita, who was also there, I guess. iii ACKNOWLEDGEMENTS I rst and foremost thank my advisor Dana Randall for supporting and encouraging me in my time at Georgia Tech. Without her patient mentorship, I would be greatly diminished as an academic. Her… (More)

- Prateek Bhakta, Dana Randall
- ANALCO
- 2016

We consider perfect matchings of the square-octagon lattice, also known as " fortresses " [16]. There is a natural local Markov chain on the set of perfect matchings that is known to be ergodic. However, unlike Markov chains for sampling perfect matchings on the square and hexagonal lattices, corresponding to domino and lozenge tilings, respectively, the… (More)

- ‹
- 1
- ›