# test input file for graph_sampler
# hypergraphs sampler, first 10 iterations
# =========================================================================

n_runs    = 500;
n_burn_in = 0;

random_seed = 31456;                        

n_nodes = 20;

hypergraph = true;

initial_adjacency = matrix{empty};    

likelihood = constant_gamma;

n_data = 3;

data = matrix {
  -1.58,  -0.817,  0.828,
   1.70,   0.324, -1.35,
  -0.014, -0.039, -0.581,
  -1.8,    1.65,   0.117,
   1.42,  -0.272, -1.22,
   
   0.825,  1.31,   0.368,
  -0.138, -1.56,   1.21,
  -0.059,  0.083,  0.46,
   1.97,   0.6194, 2.15,
  -2.67,  -0.68,   1.18,
  
  -1.54,   0.972,  0.18,
  -0.23,  -1.77,   0.993,
  -0.384, -0.513,  1.88,
   0.066,  1.27,  -0.836,
  -0.576,  0.203,  0.475,
  
  -0.933, -1.79,  -0.349,
  -0.255, -1.0,    0.67,
  -1.45,  -0.585, -1.58,
  -0.56,   0.554, -0.9748,
  -0.65,   0.63,  -0.296};

n_saved_adjacency = 10;

# End.
