2 papers
cs.DS2015
Random Walks and Evolving Sets: Faster Convergences and Limitations
Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analy…
cs.IT2012
On extracting common random bits from correlated sources on large alphabets
Siu On Chan, Elchanan Mossel, Joe Neeman
Suppose Alice and Bob receive strings and each uniformly random in but so that and are correlated . For each symbol , we have…