simdiff(N,nit,ai=NULL,vi=NULL,gamma=NULL,theta=NULL,ter=NULL, model="D",max.iter=19999,eps=1e-15)
nit
containing the true values for the item boundary separation, a[i].nit
containing the true values for the item drift rate, v[i].N
containing the true values for the person boundary separation, gamma[p].N
containing the true values for the person drift rate, theta[p].nit
containing the true values for the item non-decision time, ter[i].ai[i]
vi[i]
gamma[p]
theta[p]
ter[i]
simdiff
is an extension of the rejection algorithm outlined in Tuerlinckx et al. (2001). In this algorithm,
a proposal response time is sampled from an exponential distribution. This proposal is accepted as actual response
time when a specific condition is satisfied (see Eq. 16 in Tuerlinckx, 2001). As this condition requires the
approximation of an infinite sum, a convergence criterion needs to be specified (see the argument eps
). When
the condition is not satisfied, a new proposal response time is sampled. This is repeated until the proposal response
time is accepted or when max.iter
has been reached.
diffIRT
for fitting diffusion IRT models.
## Not run:
# # simulate data accroding to D-diffusion model
# data=simdiff(N=100,nit=10,model="D")
#
# ## End(Not run)
Run the code above in your browser using DataLab