The information in aggregate data from Markov chains (Q3683376)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3905691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The information in aggregate data from Markov chains |
scientific article; zbMATH DE number 3905691 |
Statements
The information in aggregate data from Markov chains (English)
0 references
1984
0 references
asymptotic efficiency
0 references
prediction
0 references
Markov chains
0 references
aggregate data
0 references
loss of information
0 references
generalized least squares estimator
0 references
k-state chains
0 references
panel data
0 references
transition probabilities
0 references
estimation of equilibrium distributions
0 references
mean occupancy numbers
0 references
0 references
0.89949226
0 references
0 references
0.8924641
0 references
0 references
The authors discuss estimation in Markov chains from aggregate data (i.e. data consisting of mere counts of the total number of individuals in each state at each time point). The purpose of the paper is to investigate the information about various aspects of a chain, and to measure the loss of information incurred by aggregating data rather than observing the complete histories of each individual (panel data). A generalized least squares estimator and its asymptotic properties are first reviewed. Then two-state chains and finally k-state chains are considered and comparisons made with the panel data case. The main general conclusion is that although aggregate data are generally much less informative than panel data about individual transition probabilities, they provide relatively good estimation of equilibrium distributions and of mean occupancy numbers for the states of the chain.
0 references