An O(n2) bound for the relaxation time of a Markov chain on cladograms
Random Structures & Algorithms
A Path Method for the Logarithmic Sobolev Constant
Combinatorics, Probability and Computing
Scalable Uniform Graph Sampling by Local Computation
SIAM Journal on Scientific Computing
Computer Science Review
Hi-index | 0.00 |