Remarks on efficiency in estimation for branching processes
From MaRDI portal
Cited in
(16)- Branching processes. I
- Regularity, partial regularity, partial information process, for a filtered statistical model
- Asymptotic tests of composite hypotheses for non-ergodic type stochastic processes
- Asymptotic inference for stochastic processes
- Asymptotically minimax tests of composite hypotheses for nonergodic type processes
- The efficiency criteria problem for stochastic processes
- On an optimal asymptotic property of the maximum likelihood estimator of a parameter from a stochastic process
- Minimum Hellinger distance estimation for supercritical Galton-Watson processes
- An \textit{EM} algorithm for the model fitting of Markovian binary trees
- Local limit theory and large deviations for supercritical branching processes.
- Information quantities in non-classical settings
- Estimation of growth rate in second order branching process
- Quasi- and pseudo-maximum likelihood estimators for discretely observed continuous-time Markov branching processes
- Asymptotic theory for empirical similarity models
- Some aspects of modern population mathematics
- Norming rates and limit theory for some time-varying coefficient autoregressions
This page was built for publication: Remarks on efficiency in estimation for branching processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4051447)