Sciweavers

ECAI
2004
Springer
14 years 6 months ago
Generating Random Bayesian Networks with Constraints on Induced Width
We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The algorithms use ergodic Markov chains to generate samples....
Jaime Shinsuke Ide, Fabio Gagliardi Cozman, Fabio ...
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
15 years 26 days 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