2015
DOI: 10.1111/biom.12333
|View full text |Cite
|
Sign up to set email alerts
|

Connecting the Latent Multinomial

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
16
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 17 publications
(16 citation statements)
references
References 28 publications
0
16
0
Order By: Relevance
“…Link et al (2010) implied that Markov chains constructed with this algorithm would connect all elements in F n and hence be irreducible. Schofield and Bonner (2015) showed that this is true for model M tα provided that the right lattice basis is chosen and extended this result to a broader class of models in which errors constitute simple corruptions. However, they also provided examples of more complicated models for which the algorithm does not produce irreducible Markov chains.…”
Section: The Latent Multinomial Modelmentioning
confidence: 68%
See 2 more Smart Citations
“…Link et al (2010) implied that Markov chains constructed with this algorithm would connect all elements in F n and hence be irreducible. Schofield and Bonner (2015) showed that this is true for model M tα provided that the right lattice basis is chosen and extended this result to a broader class of models in which errors constitute simple corruptions. However, they also provided examples of more complicated models for which the algorithm does not produce irreducible Markov chains.…”
Section: The Latent Multinomial Modelmentioning
confidence: 68%
“…However, the discussion implied that the algorithm could be implemented with any basis of ker(A) and could be applied whenever the observed counts can be written as a linear function of latent counts. Schofield and Bonner (2015) proved that the specific basis chosen for M tα when T = 2 does produce irreducible chains, but they showed that this is not true for all bases. They also provided examples of models with more complex error for which no set of linearly independent elements ker(A) can produce irreducible chains.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In this paper, we presented a motivation for including encounter data in capture-recapture studies based on abundance lower bounds from encounter and capture data. This relates to other approaches for handling imperfect individual identification in capture-recapture studies including misidentification (Link et al 2010, McClintock et al 2014a, Schofield and Bonner 2015) and partial identification (Augustine et al 2018). Given that encounter data are included via a modified likelihood and not a modified state model, this approach can be readily integrated with a variety of capture-recapture models, and may be useful for hard to capture species in data-limited settings.…”
Section: Discussionmentioning
confidence: 99%
“…Unfortunately many non‐invasive sampling approaches are likely to have some degree of misidentification. Approaches to account for misidentification include, Wright et al (); Link et al (); Barker et al (); Schofield and Bonner (); Bonner et al (), with Barker et al () focusing on data collected in continuous time.…”
Section: Discussionmentioning
confidence: 99%