The Variance of Sample Variance for a Finite Population
|
|
|
- Toby Gallagher
- 9 years ago
- Views:
Transcription
1 The Variance of Sample Variance for a Finite Population Eungchun Cho November 11, 004 Key Words: variance of variance, variance estimator, sampling variance, randomization variance, moments Abstract The variance of variance of sample from a finite population is given in terms of the second and the fourth moments of the population. Examples of the special case when the population is of uniform distribution is given. 1 Introduction If the population variance is estimated by a sample variance, it is important to know a relationship between the variance of the population and the variance of the variance of all the samples of a certain fixed size. Though the sample variance is an unbiased estimator of the population variance, it is problematic if the variance of the variance estimator is too large. For an arbitrary finite population one establishes the unbiasedness of the sample mean x for the population mean; evaluates the randomization variance of the sample mean. One subsequently uses similar developments for related randomized designs, e.g., stratified random sampling and some forms of cluster sampling. In applications of this material to practical problems, it is often important to evaluate the variance of the variance estimator. For example, some cluster sample designs may be considered problematic if the resulting variance estimator is unstable, i.e., has an unreasonably large variance. Historically, introductory sampling textbooks have addressed this issue in a relatively limited form, either through a brief reference to an elaborate algebra of polykays developed by Tukey [4, pages 37-54] and Wishart [8, pages 1-13] or through a direct appeal to large-sample approximations based on the normal and chi-square distributions. See, e.g., Cochran [1, pages. 9, 96] for examples of these two approaches. In addition, the statistical literature has developed computational tools to implement the above mentioned polykay results. Kentucky State University, 400 E. Main Street, Frankfort, KY 40601, USA, [email protected] 3345
2 We present a relatively simple, direct derivation of the variance of variance, that is, the variance of the variance of samples from a finite population. We provide results for the important special case when the population is of uniformly distribution. The Variance of the Sample Variance Routine arguments (e.g., Cochran [1] [Theorems.1,. and.4]) show E{a(S)} = A (1) E{v(S)} = V (A) () V {a(s)} = 1 n N V (A) (3) n where a(s) is the mean of the sample S, v(s) the variance of the sample S, A the mean of A, andv (A) the full finite-population analogue of the sample variance v(s). That is, a(s) = 1 n v(s) = A = 1 N V (A) = a i (4) a i S 1 n 1 (a i a(s)) (5) a i S N a i (6) 1 N 1 N ( ai A ) The equation () shows that v(s) is an unbiased estimator of V (A). The principal task in this paper is to obtain a relatively simple expression for the variance of the variance estimator v(s), V {v(s)} = ( 1 N {v(s) V (A)} n) (8) S L n,a in terms of a i s in the underlying population. The formula will be useful for estimating the variance of the variance estimator v(s) when the straight forward computation by the definition is impractical due the combinatorial explosion when N is not very small. 3 The Main Thheorem and Formua A relationship between the variance of a given population A of size N and the variance of the variance of the samples (of size n )ofa is given. The formula (7) 3346
3 for the variance of the variance estimator is given in terms of the fourth and the second moments of the population, the size of the population, and the sample size. Recall µ 4 and µ, the fourth and the second moments of the population A. µ 4 = 1 N µ = 1 N N N x i 4 x i (9) (10) Since the variance is invariant under a shifting by a constant, we will assume the mean of the population is zeo, which simplifies our formula a lot. Theorem 1 Let A be a population of size N 4, which is represented as a list of N numbers, A =[a 1,a,...,a N ]. Assume the mean of A be 0. Consider the list of all possible samples of n ( n N 1 ) numbers selected without replacement from A, L n,a =[S 1,S,...,S α ] where S i A, S i = n for all i, and α = N!/n!(N n)! (the number of sublists of size n). Let V n =[v(s 1 ),v(s ),..., v(s α )] be ( the list of the sample variance v(s i ) for each S i L n,a. Then V (v(s)) = E [v(s) E{v(S)}] ), the variance of the variance of estimator v(s) taken over all S in V n, is a linear combination V (v(s)) = a 1 µ 4 + a µ (11) where N (N n)(nn N n 1) a 1 = (1) (N 3) (N ) (N 1) (n 1) n a = N (N n) ( N n 3n 3N +6N 3 ) (N 3) (N ) (N 1) (13) (n 1) n Remark 1 Following are alternate forms of the formual N (N n) ( V (v(s)) = (N 3) (N ) (N 1) b1 µ 4 + b µ ) (14) (n 1) n where Note b 1 and b canbewrittenas b 1 = (N 1) (Nn N n 1) (15) b = N ( N n 3n 3N +6N 3 ) (16) b 1 = (N 1) ((N 1) (n 1) ) (17) b = N (n ( N 3 ) 3(N 1) ) = N ( N (n 3) + 3 (N n)+3(n 1) ) (18) 3347
4 V (v(s)) = N (N n) (N 3) (N ) (N 1) (n 1) n ((N 1) (Nn N n 1) µ 4 ( N ( N n 3n 3N +6N 3 )) µ ) (19) A preliminary formula in terms of all the possible fourth order products of the elements in the population will be derived in the lemma, which will be simplified into a form in terms of the second and the fourth moments of the population. Lemma 1 The variance V (v(s)) of the variance of the samples can be represented as a linear combination of the sums of fourth degree terms; V (v(s)) = C 1 a 4 i + C a 3 i a j + C 3 i +C 4 i j,i k j<k where i, j, k, l runs from 1 to N and i j a i a j a k + C 5 i<j i<j<k<l a i a j a i a j a k a l (0) C 1 = N n N n C = 4(N n) N (N 1) n C 3 = (N n)(nn 3 N 3 n +3) N (N 1) n (n 1) C 4 = 8(N n)(nn 3 N 3 n +3) N (N 1) (N ) n (n 1) C 5 = 48 (N n)(nn 3 N 3 n +3) N (N 1) (N ) (N 3) n (n 1) (1) () (3) (4) (5) Remark Note the coefficient c i s have the common factor c 1 =(N n) /N n. This makes it obvious, as expected, that V (v (S)) = 0 when N = n. Sketch of the Proof of the Theorem Let s d represent the sum N d i a i and s 31 = N i j a3 i a j, s = N i<j a i a j, s 11 = N i j,i k a i a ja k,ands 1111 = j<k N i<j<k<l a ia j a k a l.then s 31 = N s 3 s 1 Ns 4 (6) s = 1 N s 1 Ns 4 (7) s 11 = 1 N 3 s s 1 N s 3 s 1 + Ns 4 1 N s s 1111 = 1 4 N 4 s Ns N s 3 s N s 1 4 N 3 s s 1 (8) (9) 3348
5 Now the double, triple and quadruple summations in the formula given by fthe lemma are replaced by simpler summations using these relations and our simplifying assumption, µ = 0, hence s 1 = 0. Collecting the similar terms after the cancellation of various intermediate terms, we get the formula in terms of µ 4 and µ only. The formula in the lemma follows from the definition of the variance of the sample variances. The proof of the formula involves determining the coefficients of all the fourth degree terms a 4 i, a i a j, a i a j a k, a 3 i a j,anda i a j a k a l that appears in the summation. The summations in the formula are such that all like terms are combined thus appear only once. For example, a i a j a k a l appears only for the indices arranged in increasing order i<j<k<l. Example. Consider the first, second and fourth moments of the population A of size N that is uniformly distributed on [-1/,1/] A =[ 1, 1 + h, 1 +h,...,1 ] where h =1/(N 1). Obviously, the first moment µ = 0. The sencond and fourth moments are also easily computed from the mement generating function. µ = 1 N 1 1 N 1 3 N N µ 4 = 40 N 4 Substituting µ and µ 4 into the equation 11, we get the variance of the variance of the sample of size n V (v(s)) = 1 ( 1 N 4 +7nN 4 +5N 3 n 9 N 3 0 N n +1N 15 Nn+1N +3n +3 ) (N n) 360 (n 1) n (N 3) (N ) N 3 When N is large, and µ 1 1 µ V (v(s)) n 360 (n 1) n References [1] W. G. Cochran, Sampling Techniques (3rd ed.), John Wiley, 1977,pages 9,
6 [] R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, [3] J. W. Tukey, Some sampling simplified, Journal of the American Statistical Association, 45 (1950), [4] J. W. Tukey, Keeping moment-like sampling computation simple, The Annals of Mathematical Statistics, 7 (1956), [5] J. W. Tukey, Variances of variance components: I. Balanced designs. The Annals of Mathematical Statistics, 7 (1956), [6] J. W. Tukey, Variances of variance components: II. Unbalanced single classifications. The Annals of Mathematical Statistics, 8 (1957), [7] J. W. Tukey, Variance components: III. The third moment in a balanced single classification. The Annals of Mathematical Statistics, 8 (1957), [8] J. Wishart, Moment Coefficients of the k-statistics in Samples from a Finite Population. Biometrika, 39 (195),
15. Symmetric polynomials
15. Symmetric polynomials 15.1 The theorem 15.2 First examples 15.3 A variant: discriminants 1. The theorem Let S n be the group of permutations of {1,, n}, also called the symmetric group on n things.
Lecture 8. Confidence intervals and the central limit theorem
Lecture 8. Confidence intervals and the central limit theorem Mathematical Statistics and Discrete Mathematics November 25th, 2015 1 / 15 Central limit theorem Let X 1, X 2,... X n be a random sample of
MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model 1 September 004 A. Introduction and assumptions The classical normal linear regression model can be written
Sample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok
THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan
1 Sufficient statistics
1 Sufficient statistics A statistic is a function T = rx 1, X 2,, X n of the random sample X 1, X 2,, X n. Examples are X n = 1 n s 2 = = X i, 1 n 1 the sample mean X i X n 2, the sample variance T 1 =
Integer roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
BINOMIAL OPTIONS PRICING MODEL. Mark Ioffe. Abstract
BINOMIAL OPTIONS PRICING MODEL Mark Ioffe Abstract Binomial option pricing model is a widespread numerical method of calculating price of American options. In terms of applied mathematics this is simple
Indiana State Core Curriculum Standards updated 2009 Algebra I
Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and
Equations, Inequalities & Partial Fractions
Contents Equations, Inequalities & Partial Fractions.1 Solving Linear Equations 2.2 Solving Quadratic Equations 1. Solving Polynomial Equations 1.4 Solving Simultaneous Linear Equations 42.5 Solving Inequalities
Continued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
The Determinant: a Means to Calculate Volume
The Determinant: a Means to Calculate Volume Bo Peng August 20, 2007 Abstract This paper gives a definition of the determinant and lists many of its well-known properties Volumes of parallelepipeds are
The four [10,5,4] binary codes
1 Preliminaries The four [10,,] binary codes There are four distinct [10; ; ] binary codes. We shall prove this in a moderately elementary way, using the MacWilliams identities as the main tool. (For the
Ira Fine and Thomas J. Osler Department of Mathematics Rowan University Glassboro, NJ 08028. [email protected]. 1. Introduction
1 08/0/00 THE REMARKABLE INCIRCLE OF A TRIANGLE Ira Fine and Thomas J. Osler Department of Mathematics Rowan University Glassboro, NJ 0808 [email protected] 1. Introduction The incircle of a triangle is
Solving simultaneous equations using the inverse matrix
Solving simultaneous equations using the inverse matrix 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix
Row Echelon Form and Reduced Row Echelon Form
These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation
is identically equal to x 2 +3x +2
Partial fractions 3.6 Introduction It is often helpful to break down a complicated algebraic fraction into a sum of simpler fractions. 4x+7 For example it can be shown that has the same value as 1 + 3
G(s) = Y (s)/u(s) In this representation, the output is always the Transfer function times the input. Y (s) = G(s)U(s).
Transfer Functions The transfer function of a linear system is the ratio of the Laplace Transform of the output to the Laplace Transform of the input, i.e., Y (s)/u(s). Denoting this ratio by G(s), i.e.,
WHERE DOES THE 10% CONDITION COME FROM?
1 WHERE DOES THE 10% CONDITION COME FROM? The text has mentioned The 10% Condition (at least) twice so far: p. 407 Bernoulli trials must be independent. If that assumption is violated, it is still okay
3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
SECTION 10-2 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
Math 115 Spring 2011 Written Homework 5 Solutions
. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
5.5. Solving linear systems by the elimination method
55 Solving linear systems by the elimination method Equivalent systems The major technique of solving systems of equations is changing the original problem into another one which is of an easier to solve
arxiv:math/0112298v1 [math.st] 28 Dec 2001
Annuities under random rates of interest revisited arxiv:math/0112298v1 [math.st] 28 Dec 2001 Krzysztof BURNECKI, Agnieszka MARCINIUK and Aleksander WERON Hugo Steinhaus Center for Stochastic Methods,
Elements of probability theory
2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted
5.1 Identifying the Target Parameter
University of California, Davis Department of Statistics Summer Session II Statistics 13 August 20, 2012 Date of latest update: August 20 Lecture 5: Estimation with Confidence intervals 5.1 Identifying
PROBABILITY AND STATISTICS. Ma 527. 1. To teach a knowledge of combinatorial reasoning.
PROBABILITY AND STATISTICS Ma 527 Course Description Prefaced by a study of the foundations of probability and statistics, this course is an extension of the elements of probability and statistics introduced
a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)
ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x
Introduction to Engineering Analysis - ENGR1100 Course Description and Syllabus Monday / Thursday Sections. Fall '15.
Introduction to Engineering Analysis - ENGR1100 Course Description and Syllabus Monday / Thursday Sections Fall 2015 All course materials are available on the RPI Learning Management System (LMS) website.
VERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS
VERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS MICHAEL DRMOTA, OMER GIMENEZ, AND MARC NOY Abstract. We show that the number of vertices of a given degree k in several kinds of series-parallel labelled
Notes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
Lecture L3 - Vectors, Matrices and Coordinate Transformations
S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between
Fairfield Public Schools
Mathematics Fairfield Public Schools AP Statistics AP Statistics BOE Approved 04/08/2014 1 AP STATISTICS Critical Areas of Focus AP Statistics is a rigorous course that offers advanced students an opportunity
Moreover, under the risk neutral measure, it must be the case that (5) r t = µ t.
LECTURE 7: BLACK SCHOLES THEORY 1. Introduction: The Black Scholes Model In 1973 Fisher Black and Myron Scholes ushered in the modern era of derivative securities with a seminal paper 1 on the pricing
8.2. Solution by Inverse Matrix Method. Introduction. Prerequisites. Learning Outcomes
Solution by Inverse Matrix Method 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix algebra allows us
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
Unit 31 A Hypothesis Test about Correlation and Slope in a Simple Linear Regression
Unit 31 A Hypothesis Test about Correlation and Slope in a Simple Linear Regression Objectives: To perform a hypothesis test concerning the slope of a least squares line To recognize that testing for a
5 Numerical Differentiation
D. Levy 5 Numerical Differentiation 5. Basic Concepts This chapter deals with numerical approximations of derivatives. The first questions that comes up to mind is: why do we need to approximate derivatives
171:290 Model Selection Lecture II: The Akaike Information Criterion
171:290 Model Selection Lecture II: The Akaike Information Criterion Department of Biostatistics Department of Statistics and Actuarial Science August 28, 2012 Introduction AIC, the Akaike Information
Summation Algebra. x i
2 Summation Algebra In the next 3 chapters, we deal with the very basic results in summation algebra, descriptive statistics, and matrix algebra that are prerequisites for the study of SEM theory. You
arxiv:0909.4913v2 [math.ho] 4 Nov 2009
IRRATIONALITY FROM THE BOOK STEVEN J. MILLER AND DAVID MONTAGUE arxiv:0909.4913v2 [math.ho] 4 Nov 2009 A right of passage to theoretical mathematics is often a proof of the irrationality of 2, or at least
3.6. Partial Fractions. Introduction. Prerequisites. Learning Outcomes
Partial Fractions 3.6 Introduction It is often helpful to break down a complicated algebraic fraction into a sum of simpler fractions. For 4x + 7 example it can be shown that x 2 + 3x + 2 has the same
2DI36 Statistics. 2DI36 Part II (Chapter 7 of MR)
2DI36 Statistics 2DI36 Part II (Chapter 7 of MR) What Have we Done so Far? Last time we introduced the concept of a dataset and seen how we can represent it in various ways But, how did this dataset came
PYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
MATHEMATICAL METHODS OF STATISTICS
MATHEMATICAL METHODS OF STATISTICS By HARALD CRAMER TROFESSOK IN THE UNIVERSITY OF STOCKHOLM Princeton PRINCETON UNIVERSITY PRESS 1946 TABLE OF CONTENTS. First Part. MATHEMATICAL INTRODUCTION. CHAPTERS
k, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
Hook Lengths and Contents. Richard P. Stanley M.I.T.
Hook Lengths and Contents p. Hook Lengths and Contents Richard P. Stanley M.I.T. Hook Lengths and Contents p. Standard Young tableau standard Young tableau (SYT) of shape λ = (4, 4, 3, 1): < < 1 3 4 2
Business Statistics. Successful completion of Introductory and/or Intermediate Algebra courses is recommended before taking Business Statistics.
Business Course Text Bowerman, Bruce L., Richard T. O'Connell, J. B. Orris, and Dawn C. Porter. Essentials of Business, 2nd edition, McGraw-Hill/Irwin, 2008, ISBN: 978-0-07-331988-9. Required Computing
Recursive Algorithms. Recursion. Motivating Example Factorial Recall the factorial function. { 1 if n = 1 n! = n (n 1)! if n > 1
Recursion Slides by Christopher M Bourke Instructor: Berthe Y Choueiry Fall 007 Computer Science & Engineering 35 Introduction to Discrete Mathematics Sections 71-7 of Rosen cse35@cseunledu Recursive Algorithms
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation
Lecture Notes on Polynomials
Lecture Notes on Polynomials Arne Jensen Department of Mathematical Sciences Aalborg University c 008 Introduction These lecture notes give a very short introduction to polynomials with real and complex
1 Lecture: Integration of rational functions by decomposition
Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.
Some probability and statistics
Appendix A Some probability and statistics A Probabilities, random variables and their distribution We summarize a few of the basic concepts of random variables, usually denoted by capital letters, X,Y,
International College of Economics and Finance Syllabus Probability Theory and Introductory Statistics
International College of Economics and Finance Syllabus Probability Theory and Introductory Statistics Lecturer: Mikhail Zhitlukhin. 1. Course description Probability Theory and Introductory Statistics
Homework 11. Part 1. Name: Score: / null
Name: Score: / Homework 11 Part 1 null 1 For which of the following correlations would the data points be clustered most closely around a straight line? A. r = 0.50 B. r = -0.80 C. r = 0.10 D. There is
Unified Lecture # 4 Vectors
Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,
Module 3: Correlation and Covariance
Using Statistical Data to Make Decisions Module 3: Correlation and Covariance Tom Ilvento Dr. Mugdim Pašiƒ University of Delaware Sarajevo Graduate School of Business O ften our interest in data analysis
Statistics Graduate Courses
Statistics Graduate Courses STAT 7002--Topics in Statistics-Biological/Physical/Mathematics (cr.arr.).organized study of selected topics. Subjects and earnable credit may vary from semester to semester.
Sequences. A sequence is a list of numbers, or a pattern, which obeys a rule.
Sequences A sequence is a list of numbers, or a pattern, which obeys a rule. Each number in a sequence is called a term. ie the fourth term of the sequence 2, 4, 6, 8, 10, 12... is 8, because it is the
3.1. Solving linear equations. Introduction. Prerequisites. Learning Outcomes. Learning Style
Solving linear equations 3.1 Introduction Many problems in engineering reduce to the solution of an equation or a set of equations. An equation is a type of mathematical expression which contains one or
Basic Probability Concepts
page 1 Chapter 1 Basic Probability Concepts 1.1 Sample and Event Spaces 1.1.1 Sample Space A probabilistic (or statistical) experiment has the following characteristics: (a) the set of all possible outcomes
SOLVING QUADRATIC EQUATIONS OVER POLYNOMIAL RINGS OF CHARACTERISTIC TWO
Publicacions Matemàtiques, Vol 42 (1998), 131 142. SOLVING QUADRATIC EQUATIONS OVER POLYNOMIAL RINGS OF CHARACTERISTIC TWO Jørgen Cherly, Luis Gallardo, Leonid Vaserstein and Ethel Wheland Abstract We
Mathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
arxiv:1203.1525v1 [math.co] 7 Mar 2012
Constructing subset partition graphs with strong adjacency and end-point count properties Nicolai Hähnle [email protected] arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined
Generalized modified linear systematic sampling scheme for finite populations
Hacettepe Journal of Mathematics and Statistics Volume 43 (3) (204), 529 542 Generalized modified linear systematic sampling scheme for finite populations J Subramani and Sat N Gupta Abstract The present
MATHEMATICS BONUS FILES for faculty and students http://www2.onu.edu/~mcaragiu1/bonus_files.html
MATHEMATICS BONUS FILES for faculty and students http://www2onuedu/~mcaragiu1/bonus_fileshtml RECEIVED: November 1 2007 PUBLISHED: November 7 2007 Solving integrals by differentiation with respect to a
LOGNORMAL MODEL FOR STOCK PRICES
LOGNORMAL MODEL FOR STOCK PRICES MICHAEL J. SHARPE MATHEMATICS DEPARTMENT, UCSD 1. INTRODUCTION What follows is a simple but important model that will be the basis for a later study of stock prices as
Random variables, probability distributions, binomial random variable
Week 4 lecture notes. WEEK 4 page 1 Random variables, probability distributions, binomial random variable Eample 1 : Consider the eperiment of flipping a fair coin three times. The number of tails that
The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
Section 1.1 Linear Equations: Slope and Equations of Lines
Section. Linear Equations: Slope and Equations of Lines Slope The measure of the steepness of a line is called the slope of the line. It is the amount of change in y, the rise, divided by the amount of
Introduction. Appendix D Mathematical Induction D1
Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to
Core Maths C1. Revision Notes
Core Maths C Revision Notes November 0 Core Maths C Algebra... Indices... Rules of indices... Surds... 4 Simplifying surds... 4 Rationalising the denominator... 4 Quadratic functions... 4 Completing the
Number Patterns, Cautionary Tales and Finite Differences
Learning and Teaching Mathematics, No. Page Number Patterns, Cautionary Tales and Finite Differences Duncan Samson St Andrew s College Number Patterns I recently included the following question in a scholarship
with functions, expressions and equations which follow in units 3 and 4.
Grade 8 Overview View unit yearlong overview here The unit design was created in line with the areas of focus for grade 8 Mathematics as identified by the Common Core State Standards and the PARCC Model
THREE DIMENSIONAL GEOMETRY
Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,
Chapter 20. Vector Spaces and Bases
Chapter 20. Vector Spaces and Bases In this course, we have proceeded step-by-step through low-dimensional Linear Algebra. We have looked at lines, planes, hyperplanes, and have seen that there is no limit
SUM OF TWO SQUARES JAHNAVI BHASKAR
SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted
Discrete Mathematics: Homework 7 solution. Due: 2011.6.03
EE 2060 Discrete Mathematics spring 2011 Discrete Mathematics: Homework 7 solution Due: 2011.6.03 1. Let a n = 2 n + 5 3 n for n = 0, 1, 2,... (a) (2%) Find a 0, a 1, a 2, a 3 and a 4. (b) (2%) Show that
Course Text. Required Computing Software. Course Description. Course Objectives. StraighterLine. Business Statistics
Course Text Business Statistics Lind, Douglas A., Marchal, William A. and Samuel A. Wathen. Basic Statistics for Business and Economics, 7th edition, McGraw-Hill/Irwin, 2010, ISBN: 9780077384470 [This
Introduction to Regression and Data Analysis
Statlab Workshop Introduction to Regression and Data Analysis with Dan Campbell and Sherlock Campbell October 28, 2008 I. The basics A. Types of variables Your variables may take several forms, and it
Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem
IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem Time on my hands: Coin tosses. Problem Formulation: Suppose that I have
A SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS
A SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS Eusebio GÓMEZ, Miguel A. GÓMEZ-VILLEGAS and J. Miguel MARÍN Abstract In this paper it is taken up a revision and characterization of the class of
JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials
COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS
COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V. EROVENKO AND B. SURY ABSTRACT. We compute commutativity degrees of wreath products A B of finite abelian groups A and B. When B
Quadratic forms Cochran s theorem, degrees of freedom, and all that
Quadratic forms Cochran s theorem, degrees of freedom, and all that Dr. Frank Wood Frank Wood, [email protected] Linear Regression Models Lecture 1, Slide 1 Why We Care Cochran s theorem tells us
MULTIPLE REGRESSION WITH CATEGORICAL DATA
DEPARTMENT OF POLITICAL SCIENCE AND INTERNATIONAL RELATIONS Posc/Uapp 86 MULTIPLE REGRESSION WITH CATEGORICAL DATA I. AGENDA: A. Multiple regression with categorical variables. Coding schemes. Interpreting
THE DYING FIBONACCI TREE. 1. Introduction. Consider a tree with two types of nodes, say A and B, and the following properties:
THE DYING FIBONACCI TREE BERNHARD GITTENBERGER 1. Introduction Consider a tree with two types of nodes, say A and B, and the following properties: 1. Let the root be of type A.. Each node of type A produces
The Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13 school year.
This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra
MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
Standard Deviation Estimator
CSS.com Chapter 905 Standard Deviation Estimator Introduction Even though it is not of primary interest, an estimate of the standard deviation (SD) is needed when calculating the power or sample size of
Regression III: Advanced Methods
Lecture 16: Generalized Additive Models Regression III: Advanced Methods Bill Jacoby Michigan State University http://polisci.msu.edu/jacoby/icpsr/regress3 Goals of the Lecture Introduce Additive Models
On the Efficiency of Competitive Stock Markets Where Traders Have Diverse Information
Finance 400 A. Penati - G. Pennacchi Notes on On the Efficiency of Competitive Stock Markets Where Traders Have Diverse Information by Sanford Grossman This model shows how the heterogeneous information
