4 citations · 5 across the 3 of their papers we have counts for
4 papers
Sampling permutations satisfying constraints within the lopsided local lemma regime
Kun He, Guoliang Qiu, Xiaoming Sun
Sampling a random permutation with restricted positions, or equivalently approximating the permanent of a 0-1 matrix, is a fundamental problem in computer science, with several not…
Perfect Sampling for (Atomic) Lovász Local Lemma
Kun He, Xiaoming Sun, Kewen Wu
We give a Markov chain based perfect sampler for uniform sampling solutions of constraint satisfaction problems (CSP). Under some mild Lovász local lemma conditions where each cons…
Dynamic inference in probabilistic graphical models
Weiming Feng, Kun He, Xiaoming Sun +1
Probabilistic graphical models, such as Markov random fields (MRFs), are useful for describing high-dimensional distributions in terms of local dependence structures. The probabili…
Null-free False Discovery Rate Control Using Decoy Permutations
Kun He, Mengjie Li, Yan Fu +2
The traditional approaches to false discovery rate (FDR) control in multiple hypothesis testing are usually based on the null distribution of a test statistic. However, all types o…