annotate toolboxes/FullBNT-1.0.7/graph/mk_rnd_dag_given_edge_prob.m @ 0:e9a9cd732c1e tip

first hg version after svn
author wolffd
date Tue, 10 Feb 2015 15:05:51 +0000
parents
children
rev   line source
wolffd@0 1 function dag = sample_dag(P)
wolffd@0 2 % SAMPLE_DAG Create a random directed acyclic graph with edge probabilities P(i,j)
wolffd@0 3 % dag = sample_dag(P)
wolffd@0 4 %
wolffd@0 5 % This uses rejection sampling to reject graphs with directed cycles.
wolffd@0 6
wolffd@0 7 done = 0;
wolffd@0 8 directed = 1;
wolffd@0 9 iter = 1;
wolffd@0 10 while ~done
wolffd@0 11 dag = binornd(1, P); % each edge is an indep Bernoulli (0/1) random variable
wolffd@0 12 dag = setdiag(dag, 0);
wolffd@0 13 done = acyclic(dag, directed);
wolffd@0 14 iter = iter + 1
wolffd@0 15 end