Description Usage Arguments Details References Examples
Fit seven random walk models to a movement path
1 2 |
movltraj |
one ltraj object containing the movement path |
graph |
one logical value that states whether the models should be plotted |
PRdetails |
one logical value that states whether the details of the pseudoresiduals should be returned |
TAc |
one numeric value for the threshold angle used in the local turn method |
conts |
logical value stating whether to constrain mu between 1 and 3 (i.e. the values relevant for the Levy walk searching strategy) |
dn |
logical value stating whether to direct numerical maximization of the log likelihood is used rather than the EM-algorithm for the CCRW. see details |
ww |
logical value stating whether to investigate the CCRW with weibull distributions for SL and wrapped cauchy for TA. |
hs |
logical value stating whether to investigate the CCRW that is a hidden semi Markov model (HSMM) with weibull distributions for SL, wrapped cauchy for TA, and negative binomial for the state dwell time. |
hsl |
logical value stating whether to investigate the CCRW that is a hidden semi Markov model (HSMM) with weibull distributions for SL, wrapped cauchy for TA, and negative binomial for the state dwell time (probility of the negative binomial is equal across behaviours). |
hsl |
logical value stating whether to investigate the CCRW that is a hidden semi Markov model (HSMM) with weibull distributions for SL, wrapped cauchy for TA, and negative binomial for the state dwell time (size of the negative binomial is equal across behaviours). |
hsp |
logical value stating whether to investigate the CCRW that is a hidden semi Markov model (HSMM) with weibull distributions for SL, wrapped cauchy for TA, and Poisson for the state dwell time. |
hsp |
logical value stating whether to investigate the CCRW that is a hidden semi Markov model (HSMM) with exponential distributions for SL, von Mises for TA, and Poisson for the state dwell time. |
movLikelihoods fits a CCRW, TLW, LW, BW, CRW, TBW, TCRW to a movement path.
Note by default the EM-algorithm is used for the CCRW. Because it is coded in C++ it is much faster than the numerical maximization. If dn=TRUE, the numerical maximization is used, which has the advantage to have one less parameter to estimate: dI.
Please refer to Auger-Methe, M., A.E. Derocher, M.J. Plank, E.A. Codling, M.A. Lewis (2015-In Press) Differentiating the Levy walk from a composite correlated random walk. Methods in Ecology and Evolution. Preprint available at http://arxiv.org/abs/1406.4355
1 2 3 4 5 6 7 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.