2019
DOI: 10.1080/03610926.2019.1615628
|View full text |Cite
|
Sign up to set email alerts
|

A note on identifiability and maximum likelihood estimation for a heterogeneous capture-recapture model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…We will first show that if 2J ≤ K, then Q J is identifiable. The proof of this direction is similar in spirit to the proofs of Theorem 2 in Holzmann et al (2006) and Theorem 1 in Pezzott et al (2019), which were both concerned with characterizing the identifiability of the M h analogue of Q J . Assume 2J ≤ K, and let Q, R ∈ Q J such that m Q = Am R for some A > 0, so that we have the following system of equations:…”
Section: The Answermentioning
confidence: 93%
“…We will first show that if 2J ≤ K, then Q J is identifiable. The proof of this direction is similar in spirit to the proofs of Theorem 2 in Holzmann et al (2006) and Theorem 1 in Pezzott et al (2019), which were both concerned with characterizing the identifiability of the M h analogue of Q J . Assume 2J ≤ K, and let Q, R ∈ Q J such that m Q = Am R for some A > 0, so that we have the following system of equations:…”
Section: The Answermentioning
confidence: 93%
“…e identifiability property has been explored by a variety of authors [12,[16][17][18][19][20][21][22][23][24][25][26][27].…”
Section: Identifiability Of the Finite Mixture Of Ttigl Distributionsmentioning
confidence: 99%