Sciweavers

373 search results - page 4 / 75
» On Markov Chains for Independent Sets
Sort
View
ATVA
2006
Springer
82views Hardware» more  ATVA 2006»
13 years 11 months ago
Eager Markov Chains
We consider infinite-state discrete Markov chains which are eager: the probability of avoiding a defined set of final states for more than
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Ma...
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 7 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
FOCS
2002
IEEE
14 years 13 days ago
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, M...
ISAAC
2003
Springer
101views Algorithms» more  ISAAC 2003»
14 years 20 days ago
Rapid Mixing of Several Markov Chains for a Hard-Core Model
The mixing properties of several Markov chains to sample from configurations of a hard-core model have been examined. The model is familiar in the statistical physics of the liqui...
Ravi Kannan, Michael W. Mahoney, Ravi Montenegro
CAV
2009
Springer
135views Hardware» more  CAV 2009»
14 years 8 months ago
Sliding Window Abstraction for Infinite Markov Chains
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
Thomas A. Henzinger, Maria Mateescu, Verena Wolf