Random Structures & Algorithms
Decomposition Methods and Sampling Circuits in the Cartesian Lattice
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Torpid mixing of simulated tempering on the Potts model
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Rapidly Mixing Markov Chains with Applications in Computer Science and Physics
Computing in Science and Engineering
Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
Combinatorics, Probability and Computing
Pseudorandom walks on regular digraphs and the RL vs. L problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Undirected connectivity in log-space
Journal of the ACM (JACM)
Dobrushin conditions and systematic scan
Combinatorics, Probability and Computing
Derandomized squaring of graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Dobrushin conditions and systematic scan
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
| Hi-index | 0.00 |
Staircase walks are lattice paths from (0,0) to (2n,0) which take diagonal steps and which never fall below the x-axis. A path hitting the x-axis /spl kappa/ times is assigned a weight of /spl lambda//sup /spl kappa//, where /spl lambda/1. We give the first proof that this Markov chain is also mixing in the more interesting case of /spl lambda/