Fitting a reversible Markov chain by maximum likelihood: converting an awkwardly constrained optimization problem to an unconstrained one (Q2143292): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: R / rank | |||
Normal rank | |||
Revision as of 01:28, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fitting a reversible Markov chain by maximum likelihood: converting an awkwardly constrained optimization problem to an unconstrained one |
scientific article |
Statements
Fitting a reversible Markov chain by maximum likelihood: converting an awkwardly constrained optimization problem to an unconstrained one (English)
0 references
31 May 2022
0 references
Markov chain
0 references
reversibility
0 references
detailed balance
0 references
likelihood
0 references
numerical optimization
0 references
parametric bootstrap
0 references
