Gauss–Markov Model in mathematical statistics (in this theorem, one does ''not'' assume the probability distributions are Gaussian.)
{{mathematical disambiguation ...
The phrase Gauss–Markov is used in two different ways: * Gauss–Markov processes in probability theory *The Gauss–Markov theorem In statistics, the Gauss–Markov theorem (or simply Gauss theorem for some authors) states that the ordinary least squares (OLS) estimator has the lowest sampling variance within the class of linear unbiased estimators, if the errors in ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Gauss–Markov Process
Gauss–Markov stochastic processes (named after Carl Friedrich Gauss and Andrey Markov) are stochastic processes that satisfy the requirements for both Gaussian processes and Markov processes. A stationary Gauss–Markov process is unique up to rescaling; such a process is also known as an Ornstein–Uhlenbeck process. Gauss–Markov processes obey Langevin equations. Basic properties Every Gauss–Markov process ''X''(''t'') possesses the three following properties: C. B. Mehr and J. A. McFadden. Certain Properties of Gaussian Processes and Their First-Passage Times. Journal of the Royal Statistical Society. Series B (Methodological), Vol. 27, No. 3(1965), pp. 505-522 # If ''h''(''t'') is a non-zero scalar function of ''t'', then ''Z''(''t'') = ''h''(''t'')''X''(''t'') is also a Gauss–Markov process # If ''f''(''t'') is a non-decreasing scalar function of ''t'', then ''Z''(''t'') = ''X''(''f''(''t'')) is also a Gauss–Markov process # If the process is non-degenerate and mea ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |