Preview

OLS is blue

Satisfactory Essays
Open Document
Open Document
445 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
OLS is blue
Econometrics Assignment 2

Group Members :
Eliza Tan 01120120073
Praisya Lordrietta 01120120061
Wirhan Pandutama 0112012

UNIVERSITAS PELITA HARAPAN
LIPPO KARAWACI-TANGERANG
2014
Gauss-Markov Theorem
The Gauss-Markov Theorem is given in the following regression model and assumptions:
The regression model (1)

Assumptions (A) or Assumptions (B):
Assumptions (A)

Assumptions (B)
E(

If we use Assumptions (B), we need to use the law of iterated expectations in proving the BLUE. With Assumptions (B), the BLUE is given conditionally on
Let us use Assumptions (A). The Gauss-Markov Theorem is stated below
Under Assumptions (A), the OLS estimators, are the Best Linear Unbiased Estimator (BLUE), that is
1. Unbias :
2. Best : Real data seldomly satisfy Assumptions (A) or Assumptions (B). Accordingly we should think that the Gauss-Markov theorem only holds in the never-never land. However, it is important to understand the Gauss-Markov theorem on two grounds:
1. We may treat the world of the Gauss-Markov theorem as equivalent to the world of perfect competition in micro economic theory.
2. The mathematical exercises are good for your souls.
We shall prove the Gauss-Markov theorem using the simple regression model of equation (1). We can prove the Gauss-Markov theorem using the multiple regression model (2)
To do so, however, we need to use vector and matrix language (linear algebra.) Actually, once you learn linear algebra the proof of Gauss-Markov theorem is far more straight forward than the proof for the simple regression model of (1).
Proving the Gauss-Markov Theorem
Proof that is best
We need to re-express first

The BLUE only looks at linear estimators of The linear estimators are defined by

If we noticed that if

Then

We have to make unbiased. To take expectation of we first

You May Also Find These Documents Helpful

  • Satisfactory Essays

    ECON 300 HW9

    • 811 Words
    • 4 Pages

    -impure heteroskedasticity caused by an omitted variable will have possible specification bias. Impure heteroskedasticity causes bias in the coefficient and the variance of error is no longer minimum variance and no longer efficient. The variances of OLS estimators are biased.…

    • 811 Words
    • 4 Pages
    Satisfactory Essays
  • Powerful Essays

    Paul Keating Analysis

    • 2020 Words
    • 9 Pages

    The third paragraph informs us of what we know through statistics. What is the effect of this technique?…

    • 2020 Words
    • 9 Pages
    Powerful Essays
  • Good Essays

    External World Skepticism

    • 791 Words
    • 4 Pages

    2) Hypotheses 1 and 2 postulate qualitatively identical experiences, so we can’t know on the basis of experience which of hypotheses 1 and 2 is correct. --from(1)…

    • 791 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    MAT 540 Quiz 1

    • 741 Words
    • 3 Pages

    Parameters are known, constant values that are usually coefficients of variables in equations.


Answer
True 
False…

    • 741 Words
    • 3 Pages
    Satisfactory Essays
  • Powerful Essays

    Reinforced Random Walks

    • 6054 Words
    • 25 Pages

    Differentt surveys on random processes with reinforcement have been written by Pemantle [47],, Davis [7], and Benaïm [4]. My emphasis here is on work which has connections with myy own results. Randomm walks with edge reinforcement Reinforcedd random walks were invented by Coppersmith and Diaconis in 1987 (see [11]). Theyy introduced edge-reinforced random walk, a nearest-neighbor random walk on a locallyy finite graph, as follows: All edges are given strictly positive numbers as weights. In eachh step, the random walker jumps to a nearest-neighbor vertex traversing an edge e incidentt to her current location with probability proportional to the weight of e. Each timee an edge is traversed, its weight is increased by 1. The process remembers where it hass been before and prefers edges which have been traversed often in the past. Edgereinforcedd random walk can be considered as a simple model for a person exploring a neww city. First she traverses randomly the streets around her hotel. As a street becomes familiarr to her, she has a higher preference to traverse the street again in the future. Inn a special case, edge-reinforced random walk is well-known. Consider the graph whichh consists of two vertices w, v and two parallel edges e, ƒ connecting them.…

    • 6054 Words
    • 25 Pages
    Powerful Essays
  • Powerful Essays

    Beginning graduate students in mathematics and other quantitative subjects are expected to have a daunting breadth of mathematical knowledge, but few have such a background. This book will help students see the broad outline of mathematics and to fill in the gaps in their knowledge. The author explains the basic points and a few key results of the most important undergraduate topics in mathematics, emphasizing the intuitions behind the subject. The topics include linear algebra, vector calculus, differential geometry, real analysis, point-set topology, differential equations, probability theory, complex analysis, abstract algebra, and more. An annotated bibliography offers a guide to further reading and more rigorous foundations. This book will be an essential resource for advanced undergraduate and beginning graduate students in mathematics, the physical sciences, engineering, computer science, statistics, and economics, and for anyone else who needs to quickly learn some serious mathematics. Thomas A. Garrity is Professor of Mathematics at Williams College in Williamstown, Massachusetts. He was an undergraduate at the University of Texas, Austin, and a graduate student at Brown University, receiving his Ph.D. in 1986. From 1986 to 1989, he was G.c. Evans Instructor at Rice University. In 1989, he moved to Williams College, where he has been ever since except in 1992-3, when he spent the year at the University of Washington, and 2000-1, when he spent the year at the University of Michigan, Ann Arbor.…

    • 18007 Words
    • 73 Pages
    Powerful Essays
  • Powerful Essays

    Rao, C.R (1973). Representations of Best Linear Unbiased Estimators in the Gauss-Markov Model with a Singular Dispersion Matrix. Journal of Multivariate Analysis 3: 276-292.…

    • 11358 Words
    • 46 Pages
    Powerful Essays
  • Better Essays

    The Blue

    • 1357 Words
    • 6 Pages

    The Blues is a musical form and genre, which originated in South America within the African-American communities. It originated near the end of the 19th century, and was rooted from spirituals, work songs, field hollers (which are very similar to work songs, but some do not have lyrics), shouts and rhymes. The blues form in jazz, rhythm and blues and rock and roll; and each is characterised by a specific chord progression, the most common being the twelve bar blues. The blues notes, are played or sung flat or gradually bent (minor 3rd to major 3rd) in relation to the pitch of the major scale. Though the blues genre is heavily based upon the blues scale (blues form), there are other characteristics that they need to possess such as a specific lyric pattern, bass line and the use of certain instruments.There are many different types of blues, some of the most common being the Delta, Piedmont, Jump and the Chicago blues styles. There are many other different types of blues, ranging from country, to urban blues, some being more popular than others during different periods of the 20th century. It was during World War II, when blues was listened to by a much wider audience and marked the transition from acoustic blues to electric blues.…

    • 1357 Words
    • 6 Pages
    Better Essays
  • Powerful Essays

    Hello World

    • 3828 Words
    • 16 Pages

    Consider a Markov chain with a countable state space and stochastic matrix P . In this paper, we provide simple proofs of convergence when a northwest corner or a banded matrix is used to approximate certain measures associated with P . Our treatment is unified in the sense that these probabilistic quantities are well defined for both ergodic and nonergodic Markov chains, and all results are valid for both approximation methods. Our proofs are simple in the sense that they only depend on one theorem from analysis: Weierstrass’ M-test. Our results include the convergence of stationary probability distributions when the Markov chain is ergodic. This work was directly motivated by the need to compute stationary probabilities for infinite-state Markov chains, but applications need not be limited to this. Computationally, when we solve for the stationary distribution of a countable-state Markov chain, the transition probability matrix has to be: i) truncated in some way to a finite matrix; or ii) banded in some way such that the computer implementation is finite. The second method is highly recommended for preserving properties of structured probability transition matrices. There are two questions which naturally arise here: i) in which ways can we truncate or band the transition matrix? and ii) for a selected truncation or banded restriction, does the solution approximate the original probability distribution?…

    • 3828 Words
    • 16 Pages
    Powerful Essays
  • Good Essays

    only new thing here is that I give emphasis to probabilistic methods as soon as possible.…

    • 268 Words
    • 2 Pages
    Good Essays
  • Good Essays

    Pricing by Arbitrage

    • 6128 Words
    • 25 Pages

    Here we will take a first look at a financial market using a simple state space model. We first develop some structure then examine the implications of the absence of arbitrage.…

    • 6128 Words
    • 25 Pages
    Good Essays
  • Powerful Essays

    Pmri

    • 3073 Words
    • 13 Pages

    [1] Makowski and Ostroy (2001) provide a nice contemporary survey of the main criticisms of perfect competition.…

    • 3073 Words
    • 13 Pages
    Powerful Essays
  • Best Essays

    Machine Learning

    • 2439 Words
    • 10 Pages

    Tom M. Mitchell provided a widely quoted definition: A computer program is said to learn from experience E with respect to some class of tasks T and performance measure P, if its performance at tasks in T, as measured by P, improves with experience E.[1]…

    • 2439 Words
    • 10 Pages
    Best Essays
  • Best Essays

    Assignment On Queuing

    • 3525 Words
    • 18 Pages

    15. Ramaswami, V. (1988). "A stable recursion for the steady state vector in markov chains of m/g/1 type". Communications in Statistics. Stochastic Models 4: 183–188. doi:10.1080/15326348808807077.…

    • 3525 Words
    • 18 Pages
    Best Essays
  • Powerful Essays

    Leadership

    • 6149 Words
    • 25 Pages

    * Write down the linear model in conditional expectation form and in the error form and explain why the conditional expectation form of the model is more realistic than the assumption that the regressors are deterministic.…

    • 6149 Words
    • 25 Pages
    Powerful Essays