Given that determining substitution costs in sequence analysis is such a bone of contention, many researchers look for a way for the data to generate the costs. The typical way to do this is, is by pooling transition rates and defining the substitution cost to be:<\/p>\n
2 – p(ij) – p(ji)<\/em><\/p>\n where p(ij)<\/em> is the transition rate from state i<\/em> to state j<\/em>. Intuitively, states that are closer to each other will have higher transitions, and vice versa.<\/p>\n I don’t recommend this approach in general, for reasons which I will not go into here, but I do have a utility in my Stata package for sequence analysis, SADI, which calculates these quantities, This requires the data in long format, so we reshape first (by default the sequences are in wide format, as variables The transition rates are calculated by default without the diagonal (i.e., ignoring cases where the sequence remains in the same state from t<\/em> to t+1<\/em>), but this can be over-ridden by an option.<\/p>\n The command works by cross-tabulating state<\/em> with its lag, putting the results in a matrix, and letting Mata do some simple calculations on the result. However, the As a short term solution, I present an alternative command here, if (rows(G)!=cols(G)) { if (diagincl==0) { Gr=G:\/rowsum(G) capture program drop t2s if (“`diagincl'”==””) { marksample touse<\/p>\n local colvar `varlist’ by `idvar’: gen `rowvar’=`colvar'[_n-1] if _n>1<\/p>\n di “Generating transition-driven substitution matrix”<\/p>\n qui tab `rowvar’ `colvar’ if `touse’, matcell(`subsmat’)<\/p>\n mata: transition_driven_subsmat2(“`subsmat'”,`diagincl’) Given that determining substitution costs in sequence analysis is such a bone of contention, many researchers look for a way for the data to generate the costs. The typical way to do this is, is by pooling transition rates and defining the substitution cost to be: 2 – p(ij) – p(ji) where p(ij) is the … Continue reading Substitution costs from transition rates<\/span> trans2subs<\/code>.<\/p>\nstate1<\/code> to state<\/code>N<\/em>).<\/p>\nreshape long state, i(id) j(t)
\ntrans2subs state, id(id) distmat(trpr1)
\ntrans2subs state, id(id) distmat(trpr2) diagincl
\nreshape wide<\/code><\/p>\ntrans2subs<\/code> command as distributed is fragile, and can break down in certain circumstances, for instance where a row or column has values only on the diagonal (i.e., a state that is only exited or is never exited, such as never-married or retired). Thanks to Anna Manzoni for alerting me to this problem.<\/p>\nt2s<\/code>, which is more robust. I will replace trans2subs<\/code> with this code when I next update the SADI package, but for now you can access it from this link<\/a>, or by cutting and pasting from here:<\/p>\n
\nmata:
\nvoid transition_driven_subsmat2(string matrix tabmat, scalar diagincl) {
\n\/\/ Read stata matrix into mata
\nG=st_matrix(tabmat)<\/code><\/p>\n
\n_error(“Table isn’t square”)
\n}<\/p>\n
\nG = G – diag(G)
\n}<\/p>\n
\nsubsmat= trunc(0.5:+(J(rows(G),rows(G),2) – Gr – Gr’):*1000000):\/1000000
\nsubsmat = subsmat – diag(subsmat)
\nst_matrix(tabmat,subsmat)
\n}
\nend<\/p>\n
\nprogram define t2s
\nsyntax varlist(min=1 max=1) [if] [in], IDvar(varname) SUBSmat(string) [DIAgincl]<\/p>\n
\nlocal diagincl 0
\n}
\nelse {
\nlocal diagincl 1
\n}<\/p>\n
\ntempvar rowvar<\/p>\n
\nend
\n<\/code><\/p>\n","protected":false},"excerpt":{"rendered":"