SWZ: added code for generating Markov Chain priors for more than 2 states
parent
356fe7b248
commit
d6fdf8fc7f
|
@ -45,23 +45,29 @@ function swz_write_markov_file(fname,M,options)
|
||||||
|
|
||||||
fprintf(fh,['\n//== Free Dirichet dimensions for state_variable[%d] ' ...
|
fprintf(fh,['\n//== Free Dirichet dimensions for state_variable[%d] ' ...
|
||||||
'==//\n'],i_chain);
|
'==//\n'],i_chain);
|
||||||
fprintf(fh,'%d ',repmat(n_states,1,n_states));
|
% fprintf(fh,'%d ',repmat(n_states,1,n_states));
|
||||||
|
fprintf(fh,'%d ',repmat(2,1,n_states));
|
||||||
fprintf(fh,'\n\n');
|
fprintf(fh,'\n\n');
|
||||||
|
|
||||||
%//== The jth restriction matrix is n_states-by-free[j]. Each row of the restriction
|
%//== The jth restriction matrix is n_states-by-free[j]. Each row of the restriction
|
||||||
%//== matrix has exactly one non-zero entry and the sum of each column must be one.
|
%//== matrix has exactly one non-zero entry and the sum of each column must be one.
|
||||||
fprintf(fh,['//== Column restrictions for state_variable[%d] ' ...
|
fprintf(fh,['//== Column restrictions for state_variable[%d] ' ...
|
||||||
'==//\n'],i_chain);
|
'==//\n'],i_chain);
|
||||||
if n_states == 2
|
for i_state = 1:n_states
|
||||||
M = eye(2);
|
if i_state == 1
|
||||||
for i_state = 1:2
|
M = eye(n_states,2);
|
||||||
for j_state = 1:2
|
elseif i_state == n_states
|
||||||
fprintf(fh,'%d ',M(j_state,:));
|
M = [zeros(n_states-2,2); eye(2)];
|
||||||
fprintf(fh,'\n');
|
else
|
||||||
end
|
M = zeros(n_states,2);
|
||||||
|
M(i_state+[-1 1],1) = ones(2,1)/2;
|
||||||
|
M(i_state,2) = 1;
|
||||||
|
end
|
||||||
|
for j_state = 1:n_states
|
||||||
|
fprintf(fh,'%d ',M(j_state,:));
|
||||||
fprintf(fh,'\n');
|
fprintf(fh,'\n');
|
||||||
end
|
end
|
||||||
else
|
fprintf(fh,'\n');
|
||||||
end
|
end
|
||||||
end
|
end
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue