Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
|
|
- Linda Evans
- 5 years ago
- Views:
Transcription
1 Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing the simplest metho of survey sampling, calle simple ranom sampling. Suppose that we are conucting election polling an are intereste in estimating the proportion of voters who support Obama in a battle groun state, say Floria. There are N voters in this state an we call this population of voters P. Thus, N enotes the population size. We assume that the complete list of N voters is available, allowing us to sample a subset of them from this list. Such a list is calle a sampling frame. Before we begin our sampling, we etermine the total number of voters we are going to interview. This number represents the sample size an is enote by n. Simple ranom sampling refers to the proceure in which a researcher ranomly samples n voters from the list of N voters with equal probability. There are two key characteristics of this proceure. First, we are sampling exactly n voters without replacement. That is, every voter gets sample at most once. Seconly, each voter has an equal probability of being sample. Clearly, this sampling probability is equal to n/n for every voter on the sampling frame. Below, we introuce two inferential approaches, one esign-base an the other moel-base, to survey sampling. In the simple case we are consiering, both approaches give substantially similar estimation proceures. For example, from both perspectives, the sample proportion of Obama s supporters in a poll is a goo estimate of the population proportion. However, the two approaches are conceptually quite ifferent. The basic iea of the esign-base approach is that all statistical properties of one s estimator are base solely on the actual ata collection proceure employe by the researcher here, simple ranom sampling). Thus, this approach faithfully follow the research esign. In contrast, the moel-base approach requires the researcher to specify a probability moel. Such a moel represents an approximation to the actual ata generating process. As escribe in more etail below, each approach has its avantages an isavantages. 1 Design-base Inference Statistical inference is about learning what we o not observe, calle parameters, from what we o observe, calle ata. What sets apart statistical inference from other mathematical or non-mathematical) metho of inference is that it can calibrate the inferential uncertainty using formal quantities such as stanar errors an confience intervals. But where o these uncertainty measures come from? The esign-base inference is an approach where all statistical properties of estimation proceures are erive solely from the key features of research esign impose by the researcher. In the current context, the fact that a researcher collect the ata via simple 1
2 ranom sampling allows us to characterize the egree of accuracy for the resulting estimate. The esign-base inference is attractive because it faithfully respects the key features of ata collection methos employe by researchers. The approach also provies intuition about how statistical properties are relate to actual research. 1.1 Setup To formalize the iea, let X i represents a binary variable inicating whether or not voter i in the population P supports Obama. We efine this quantity for each voter in the population. That is, for i = 1, 2,..., N, X i = 1 X i = 0) implies that voter i supports oes not support) Obama. We now introuce the sampling inicator variable Z i for each voter in the population, representing whether or not the voter is sample. Thus, Z i = 1 Z i = 0) inicates that voter i is sample not sample). Accoring to our simple ranom sampling proceure, we sample exactly n voters with equal probability an without replacement. This implies that N Z i = n an PrZ i = 1) = n/n. How many unique samples of voters can this simple ranom sampling prouce? To answer this question, it is helpful to consier a scenario where we sample an interview one voter at a time. For the first interview, we have N choices, an we choose the secon interviewee from N 1 voters, an finally the nth voter will be selecte from N n + 1 remaining voters. Thus, all together, we have N N 1) N n + 1) ways of interviewing n voters from a population of N voters. What we just i is to count all permutations by assuming that the orer of sampling matters. However, we actually o not care about the orer of sampling an hence nee to remove ouble-counting. How many uplicates o we have? We have a total of n voters in our sample, an using the same logic of permutations above, there are a total of n! = n n 1) 1 ways to arrage these n voters of any istinct sample. Thus, all together we arrive at the stanar formula for combinations ) N n = N N 1) N n + 1) n! = N! n!n n)! Since each istinct sample is equally likely, the probability that a particular combination of n voters is selecte equals 1/ N n) = n!n n)!/n!. 1.2 Estimation Our quantity of interest, or estiman, is the proportion of Obama supporters in the population, an this quantity can be written as the population mean of X i, i.e., X = N X i/n, because the population P consists of N voters. Our goal here is to estimate the population proportion of Obama supporters using our sample of n voters. The sample proportion appears to be a reasonable estimator for the population proportion. In the current notation, we can write the sample proportion or sample mean) as x = N Z ix i /n since those who are not in the sample an have Z i = 0 will not contribute to this quantity. What are the statistical properties of this estimator? We consier how this estimator performs over hypothetical repeate sampling. We will never know how close the proportion of Obama supporters in our actual sample to the population proportion, but we can say something about how our estimator behave if we were to repeat the same sampling process many times. Of course, we can never aminister the same survey to the same population at the same point of time 1) 2
3 more than once. Nevertheless, by knowing how one s estimator performs uner this hypothetical scenario, we can gain a better unerstaning of how reasonable our estimator is. To erive the statistical properties of the sample mean uner the esign-base framework, we take the position that the only source of ranomness comes from the proceure of simple ranom sampling. Formally, for each voter i, Z i is regare as a ranom variable with probability istribution efine by simple ranom sampling whereas X i is assume to be a fixe but possibly unobserve epening on the realization of Z i ) quantity. The iea is that each voter i is either a supporter of Obama, in which case we have X i = 1, or not, i.e,. X i = 0, an this quantity is fixe. While X i is a fixe variable for any given voter, it has a istribution over the population of voters because a certain number of voters are Obama supporters while others are not. Now, suppose that X i represents one s income. Income is a fixe quantity for each voter at the time of survey, but we can still consier a istribution of income over the population of voters. Given this istinction between fixe an ranom variables, we compute the expecte value of our estimator over repeate sampling. What oes this mean? As iscusse above, there exist a total of N n) possible samples one can en up with when applying simple ranom sampling. Since each sample contains ifferent combinations of voters with ifferent realizations of Z i, its sample mean may be ifferent an may not even be close to the population mean, which we woul like to estimate. However, the following calculation shows that on average we get the right answer, E x) = 1 n EZ i X i ) = 1 n EZ i )X i = 1 n n N X i = X 2) where the first equality follows from the fact that the expectation is a linear operator, the secon equalitiy hols because X i is a fixe quantity, an the thir equality comes from the binary nature of the sampling inicator variable, i.e., EZ i ) = PrZ i = 1). Note that the expectation is taken with respect to Z i, which is the only ranom variable in this setting. We have just shown that the sample mean is unbiase for the population mean. That is, even though the sample mean we compute from our actual sample may iffer from the population parameter for any particular raw, the average value of this estimator over hypothetical) repeate sampling equals exactly the estiman of interest. The unbiaseness of the sample mean over repeate sampling is helpful, but how close is my actual estimate to the population mean? While one cannot know exactly how far off one s estimate is from the truth, we can characterize the average istance from the truth, again, over repeate sample. One such measure is the variance of sampling istribution of the estimator. Uner the esign-base framework, this variance is given by, V x) = 1 n ) S 2 N n where 1 n/n) is the finite sample correction an S 2 = N X i X) 2 /N 1) is the population variance. The finite sample correction term ajusts the variance by taking into account the sample size relative to the population size. If the sample size equals the population size, then the sample mean equals the population mean an hence the variance is zero. In most cases, the sample size is small relative to the population size, which means that this term is close to one, resulting in a little impact on the variance. The variance expression given in equation 3) is a theoretical result because it is a function of the population variance of X i, which is an unknown quantity. However, we can estimate S 2 in the 3 3)
4 exactly same way in which we estimate the population mean using the sample mean. In fact, we can use the sample variance of X i, s 2 = N Z ix i x) 2 /n 1), as an unbiase estimator for its population variance, S 2. An unbiase estimator for the variance of the sampling istribution, then, is given by, ˆσ 2 = 1 n ) s 2 N n where Eˆσ 2 ) = V x). We have seen that the sample mean is a goo estimator of the population mean an the sample variance is a goo estimator of the population variance. Di you notice any pattern here? Inee, this is calle plug-in principle: a sample analogue of a population parameter is a goo estimator because it usually equals the population parameter in expectation. How o we erive the variance expression given in equation 3)? The calculation require for erivation is quite similar to what we i for showing the unbiaseness of the sample mean, though of course it is much more involve the slies provie etails about each step of the erivation). The basic iea is still the same, however. Recall that the variance represents the average square istance from its mean, i.e., V x) = E{ x E x)} 2 where in this case E x) = X. Thus, the erivation amounts to taking the expectation with respect to the sampling inicator variable Z i, which again is the only source of ranomness uner the esign-base approach. 1.3 Unequal Probability Sampling an Sampling Weights So far, we have focuse on the simplest probability sampling methos, simple ranom sampling. However, in practice, this proceure may not be appropriate an researchers may wish to sample responents with ifferent sampling probabilities. For example, it is often a common practice to over-sample minorities in orer to ensure that the resulting sample contains enough minority responents. Moreover, even if one applies simple ranom sampling, it is often the case that the refusal to participate in survey i.e., unit non-response) results in unequal sampling probability across ifferent iniviuals. This means that when making inference about the population, we must make aitional statistical ajustments. The sample mean is no longer unbiase for the population mean because the sample is not representative of the population. The most common way to make an ajustment is through weighting. We will weight each observation by the inverse of sampling probability. This makes sense because, for example, oversample minorities nee to be unerweighte so that their sample proportion will resemble their population proportion. For example, if an African American voter is twice more likely to be sample when compare to other voters, then the sample proportion of African American voters is, on average, twice as large as their population proportion. Thus, the African American voters in a sample nee to be ownweighte by a factor of two in orer for the sample to be representative of the population. This simple iea is the basis of the following classical weighting estimator by Horvitz an Thompson, 4) x = 1 N Z i X i π i 5) where π i = PrZ i = 1) is the sampling probability for each voter i in the population. This probability is inexe by i in orer to allow for the possibility that the sampling probability varies 4
5 from one voter to another. In the case of simple ranom sampling, everyone has the same sampling probability so that π i = n/n for all i. Showing that this inverse probability weighting leas to an unbiase estimator can be one in the exactly same manner as before. Taking the expectation with respect to Z i an treating X i as a fixe quantity, we have, E x) = 1 N EZ i )X i π i = X. 6) where EZ i ) = π i. The erivation of the variance of this estimator is similar except that, again, it is much more involve than eriving its expectation. Although we have so far assume that the sampling probability, whether it is constant or varying across units, is known, in practice we often must estimate it from ata. As mentione earlier, a main reason for this is the existence of unit nonresponse, which results in ifferent an unknown sampling probabilities across units. We note that survey weights typically available in many social science surveys are constructe using the metho of post-stratification. Uner this methoology, we first obtain the population istribution of certain covariates e.g., emographics from the census). Then, survey weights are calculate such that after weighting the observations of a sample the sample istribution of these covariates approximates the population istribution. While this approach guarantees that the sample is representative of the population with respect to these covariates, it is not necessarily the case that there may be significant ifferences in other observe an unobserve covariates between the sample an the population. Later in this course, we will have a more complete iscussion of the issues that arise from such sample selection. 2 Moel-base Inference The esign-base inference introuce above is clean an intuitive, an oes not require any strong assumptions. This approach has limite applicability, however, since the erivation of variance of the sample mean is challenging even uner simple ranom sampling. It is easy to imagine that in more complex but realistic situations, the esign-base approach may face analytical an other ifficulties. To aress this issue, we introuce the moel-base inference. This approach requires researchers to irectly moel the ata generating process by specifying a probability istribution that characterize the population we are intereste in. The avantage is that uner this approach all the useful tools of probability theory can be use to erive the statistical properties of one s estimator. The moel-base inference gives much greater analytical flexibility than the esign-base approach because the latter is not allowe to eviate from the actual ata collection mechanisms. A major isavantage of the moel-base approach, however, is that in some cases a moel selecte by researchers oes not approximate the actual ata generating process well. Constructing a goo moel requires a careful balancing act. As famously put by the statistician George Box, All moels are false but some are useful. Therefore, the creibility of moel-base inference relies upon the critical question of whether one s moel is a useful approximation of the real worl. 5
6 2.1 Estimation Let s go back to the polling example. A moel-base approach may assume that the number of Obama supporters in one s sample, enote by X = n X i, follows a Binomial istribution with probability p an size n. Is this a reasonable moel? In substantive terms, the Binomial moel assumes that n inepenent raws are sample from an infinite population of voters where the proportion of Obama supporters is exactly p. This moel is a goo approximation to the simple ranom sampling of voters in Floria for two reasons. First, the number of voters in Floria is quite large an hence assuming that the population size is infinite is reasonable. Seconly, using p as the proportion of Obama supporters in the population of Floria voters, obtaining n inepenent raws from the Binomial istribution resembles the simple ranom sampling proceure of n voters. Given this setup, we estimate the population proportion of Obama supporters p using the sample proportion ˆp = X /n. Now, recall that the mean an variance of a Binomial ranom variable are EX ) = np an VX ) = np1 p), respectively. Using this fact, it is straightforwar to show the unbiaseness of this estimator an its variance as follows, Eˆp) = np n = p an Vˆp) = VX ) p1 p) = 7) n 2 n Again, the variance is a theoretical quantity an must be estimate from ata because p is unknown. This is easily one by following the plug-in principle introuce above: we replace p with its unbiase estimate ˆp in the variance expression Vˆp) given in equation 7). In aition to the mean an variance of the sampling istribution, the moel-base approach also enables inference base on asymptotic approximation where the sample size is assume to approach infinity in the limit. Of course, in practice, we will never have infinite amount of ata. Asymptotic approximation is useful because it allows us to use powerful theorems of probability theory to erive the statistical properties of various estimators in the limit as the sample size tens to infinity. Such a calculation is often ifficult in finite sample settings. Thus, when the sample size is large enough, one can apply these asymptotic approximations. One important asymptotic theorem is the weak) law of large numbers. The theorem states that the sample mean approaches the population mean as the sample size increases. More formally, if {X i } n is a sequence of i.i.. ranom variables with mean µ an finite variance σ 2, then letting X n = n X i/n enote the sample mean, we have X n p µ 8) where p enotes the convergence in probability, which is formally efine as lim n Pr X n µ > ɛ) = 0 for any ɛ > 0. Thus, convergence in probability states that for any arbitrarily small positive number ɛ, the probability that the eviation of the sample mean eviates from the population mean is greater than ɛ becomes negligible as the sample size approaches infinity. In the case of survey sampling, this implies that the sample mean is not only unbiase for the population mean, i.e., EX n ) = µ, but it is also consistent, becoming arbitrarily close to the population mean as the sample size increases. Note that unbiase an consistency are ifferent properties. For example, consier another estimator of the population mean X n +1/n. This rather silly) estimator is biase because EX n + 1/n) = µ + 1/n µ. However, it is still consistent for the population mean as the bias term 1/n tens to zero as the sample size approches infinity. One coul also say that this estimator is asymptotically unbiase though it is biase in a finite sample) because the bias isappears asymptotically. In fact, consistency implies asymptotic unbiaseness, while the converse is true so long as the variance goes to zero as the sample size increases. 6
7 2.2 Confience Intervals Another important probability theorem use for asymptotic approximation is the central limit theorem. This theorem enables us to erive the asymptotic) sampling istribution of the sample mean, going beyon its mean an variance given in equation 7). Using the knowlege of sampling istribution, we can make probabilistic statements about the properties of estimators. Specifically, the theorem states that the sample mean is istribute over repeate sampling) accoring to a normal istribution. Formally, if {X i } n is a sequence of i.i.. ranom variables with mean µ an finite variance σ 2, then we can write the central limit theorem as, nxn µ) σ N 0, 1) 9) where represents the convergence in istribution. We say that a sequence of ranom variable, X n, converges to another ranom variable X, if lim n P X n x) = P X x) for all x with P X x) being continuous at every x. In wors, the istribution function of X n converges to that of X as the sample size approaches infinity. What is the intuition behin equation 9)? Uner the moel-base approach, we can erive the variance of the sample mean as VX n ) = n VX i)/n 2 = σ 2 /n using the assumption that X i is an i.i.. ranom variable. Given this result, it is clear that the left han sie of equation 9) represents the stanarize version of the sample mean X n where the mean of the sampling istribution, i.e., µ, is first subtracte from it an then this ifference is ivie by the stanar eviation, i.e., σ/ n. This stanarize version of the sample mean, accoring to the theorem, has the stanar normal istribution in the limit as the sample size tens to infinity. We present another way to unerstan the central limit theorem. First, rewrite the theorem as nxn µ) N 0, σ 2 ) by multiplying the ranom variable in the left han sie of equation 9) with a constant σ. We know that by law of large numbers, X n approaches µ as the sample size increases, implying that X n µ in the numerator becomes smaller an smaller as n tens to infinity. This is off set exactly by the increase of n term an as the sample size increases the istribution of nx n µ) becomes the normal istribution with mean zero an variance σ 2. For this reason, n is calle the rate of convergence. How can we use the central limit theorem uner the moel-base inference? The theorem provies a irect large-sample i.e., asymptotic) approximation to the sampling istribution of the sample mean. To o this, we assume that for large enough n, equation 9) hols approximately, i.e., nx n µ)/σ approx. N 0, 1). Diviing this ranom variable by σ/ n an then aing µ, we have the following approximate sampling istribution of X n, X n approx. Thus, in aition to its mean an variance, we now know the sampling istribution in the limit as the sample size increases. In typical situations, we o not know σ 2 an hence estimate it from the sample. Again, we apply the plug-in principle an use the sample variance, which is an unbiase an consistent estimator for the population variance σ 2. Does the above approximation still hol when we replace the population variance with its estimate? The answer turns out to be yes. That is, we N µ, σ 2 n ) 10) 7
8 have nx n µ)/ˆσ N 0, 1). This result is base on another important result in probability p theory, calle the Slutzky Theorem, which states that if X n x an Y n Y, then X n + Y n x + Y an X n Y n xy. 11) Specifically, we apply the Slutzky Theorem in the following manner, nxn µ) ˆσ = nxn µ) }{{ σ } N 0,1) σˆσ }{{} p 1 N 0, 1) 12) where the first term converges to the stanar normal ranom variable because of the central limit theorem an the secon term converges in probability to one because ˆσ 2 is a consistent estimator of σ 2. Together, the result irectly implies that the so-calle z-score follows the stanar normal istribution in a large sample, z score = X n s.e. = X n ˆσ/ n approx. N 0, 1) 13) Finally, we erive the asymptotic confience intervals, which are often use as a way to express the uncertainty of an estimator. The basic iea is to construct an interval such that over repeate sampling it covers the true value, say, 95% of time. Note that what is ranom here is the confience interval rather than the truth. The probability that any given confience interval reporte by the researcher contains the true value is either zero or one since the truth is fixe. However, over hypothetical repeate sampling, the proceure shoul prouce confience intervals which vary from one sample to another) that contain the truth for the pre-specifie proportion. In the current context, this means that our 95% confience interval from polling ata may or may not contain the true proportion of Obama supporters in Floria but if we were to conuct polling in the exactly same manner, over this hypothetical repeate sampling, 95% of such confience intervals will contain the true proportion of Obama supporters. To formally construct such confience intervals, we use the result about z-score given in equation 13) an the efinition of convergence in istribution. lim Pr z X n µ n s.e. ) z = Pr z Z z) 14) where Z is the stanar normal ranom variable an z is a pre-etermine quantity calle critical value. Now, for 95% confience intervals, choose z α/ such that Pr z α/2 Z z α/2 ) = Φz α/2 ) = 1 α = 0.95 where α = By rearranging the left han sie of equation 14), we obtain, Pr z α/2 X ) n µ z α/2 = Pr z α/2 s.e. X n µ z α/2 s.e. ) 15) s.e. = Pr X n z α/2 s.e. µ X n + z α/2 s.e. ) 16) where the secon line is obtaine by subtracting X n from each of the three terms an then multiplying them by negative one an therefore switching the irection of inequalities). Thus, in 8
9 a large sample, over repeate sampling, the confience intervals, [X n z α/2 s.e., X n +z α/2 s.e.], contains the true value α)% of time. To sum up, the moel-base approach allows us to erive the mean an variance of the estimator by using all available rules of probability theory. In aition, two powerful asymptotic theorems, i.e., law of large numbers an central limit theorem, enables large sample approximation with a large class of ata generating processes. This asymptotic approximation tells us the sampling istribution of our estimator, which in turn lets us characterize the estimation uncertainty with confience intervals. 9
Topic 7: Convergence of Random Variables
Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information
More informationThis module is part of the. Memobust Handbook. on Methodology of Modern Business Statistics
This moule is part of the Memobust Hanbook on Methoology of Moern Business Statistics 26 March 2014 Metho: Balance Sampling for Multi-Way Stratification Contents General section... 3 1. Summary... 3 2.
More informationMath Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors
Math 18.02 Notes on ifferentials, the Chain Rule, graients, irectional erivative, an normal vectors Tangent plane an linear approximation We efine the partial erivatives of f( xy, ) as follows: f f( x+
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationinflow outflow Part I. Regular tasks for MAE598/494 Task 1
MAE 494/598, Fall 2016 Project #1 (Regular tasks = 20 points) Har copy of report is ue at the start of class on the ue ate. The rules on collaboration will be release separately. Please always follow the
More informationA Course in Machine Learning
A Course in Machine Learning Hal Daumé III 12 EFFICIENT LEARNING So far, our focus has been on moels of learning an basic algorithms for those moels. We have not place much emphasis on how to learn quickly.
More informationSeparation of Variables
Physics 342 Lecture 1 Separation of Variables Lecture 1 Physics 342 Quantum Mechanics I Monay, January 25th, 2010 There are three basic mathematical tools we nee, an then we can begin working on the physical
More informationSchrödinger s equation.
Physics 342 Lecture 5 Schröinger s Equation Lecture 5 Physics 342 Quantum Mechanics I Wenesay, February 3r, 2010 Toay we iscuss Schröinger s equation an show that it supports the basic interpretation of
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson
JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises
More informationCalculus in the AP Physics C Course The Derivative
Limits an Derivatives Calculus in the AP Physics C Course The Derivative In physics, the ieas of the rate change of a quantity (along with the slope of a tangent line) an the area uner a curve are essential.
More informationImproving Estimation Accuracy in Nonrandomized Response Questioning Methods by Multiple Answers
International Journal of Statistics an Probability; Vol 6, No 5; September 207 ISSN 927-7032 E-ISSN 927-7040 Publishe by Canaian Center of Science an Eucation Improving Estimation Accuracy in Nonranomize
More informationTutorial on Maximum Likelyhood Estimation: Parametric Density Estimation
Tutorial on Maximum Likelyhoo Estimation: Parametric Density Estimation Suhir B Kylasa 03/13/2014 1 Motivation Suppose one wishes to etermine just how biase an unfair coin is. Call the probability of tossing
More informationSYNCHRONOUS SEQUENTIAL CIRCUITS
CHAPTER SYNCHRONOUS SEUENTIAL CIRCUITS Registers an counters, two very common synchronous sequential circuits, are introuce in this chapter. Register is a igital circuit for storing information. Contents
More informationLecture 2 Lagrangian formulation of classical mechanics Mechanics
Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,
More informationCalculus and optimization
Calculus an optimization These notes essentially correspon to mathematical appenix 2 in the text. 1 Functions of a single variable Now that we have e ne functions we turn our attention to calculus. A function
More informationELECTRON DIFFRACTION
ELECTRON DIFFRACTION Electrons : wave or quanta? Measurement of wavelength an momentum of electrons. Introuction Electrons isplay both wave an particle properties. What is the relationship between the
More informationInverse Theory Course: LTU Kiruna. Day 1
Inverse Theory Course: LTU Kiruna. Day Hugh Pumphrey March 6, 0 Preamble These are the notes for the course Inverse Theory to be taught at LuleåTekniska Universitet, Kiruna in February 00. They are not
More informationImplicit Differentiation
Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,
More informationLecture 6 : Dimensionality Reduction
CPS290: Algorithmic Founations of Data Science February 3, 207 Lecture 6 : Dimensionality Reuction Lecturer: Kamesh Munagala Scribe: Kamesh Munagala In this lecture, we will consier the roblem of maing
More informationParameter estimation: A new approach to weighting a priori information
Parameter estimation: A new approach to weighting a priori information J.L. Mea Department of Mathematics, Boise State University, Boise, ID 83725-555 E-mail: jmea@boisestate.eu Abstract. We propose a
More information. Using a multinomial model gives us the following equation for P d. , with respect to same length term sequences.
S 63 Lecture 8 2/2/26 Lecturer Lillian Lee Scribes Peter Babinski, Davi Lin Basic Language Moeling Approach I. Special ase of LM-base Approach a. Recap of Formulas an Terms b. Fixing θ? c. About that Multinomial
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
More informationThe Principle of Least Action
Chapter 7. The Principle of Least Action 7.1 Force Methos vs. Energy Methos We have so far stuie two istinct ways of analyzing physics problems: force methos, basically consisting of the application of
More informationState observers and recursive filters in classical feedback control theory
State observers an recursive filters in classical feeback control theory State-feeback control example: secon-orer system Consier the riven secon-orer system q q q u x q x q x x x x Here u coul represent
More informationLecture XII. where Φ is called the potential function. Let us introduce spherical coordinates defined through the relations
Lecture XII Abstract We introuce the Laplace equation in spherical coorinates an apply the metho of separation of variables to solve it. This will generate three linear orinary secon orer ifferential equations:
More informationVI. Linking and Equating: Getting from A to B Unleashing the full power of Rasch models means identifying, perhaps conceiving an important aspect,
VI. Linking an Equating: Getting from A to B Unleashing the full power of Rasch moels means ientifying, perhaps conceiving an important aspect, efining a useful construct, an calibrating a pool of relevant
More informationApplications of the Wronskian to ordinary linear differential equations
Physics 116C Fall 2011 Applications of the Wronskian to orinary linear ifferential equations Consier a of n continuous functions y i (x) [i = 1,2,3,...,n], each of which is ifferentiable at least n times.
More informationThe derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)
Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)
More informationThe Role of Models in Model-Assisted and Model- Dependent Estimation for Domains and Small Areas
The Role of Moels in Moel-Assiste an Moel- Depenent Estimation for Domains an Small Areas Risto Lehtonen University of Helsini Mio Myrsylä University of Pennsylvania Carl-Eri Särnal University of Montreal
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationExperiment 2, Physics 2BL
Experiment 2, Physics 2BL Deuction of Mass Distributions. Last Upate: 2009-05-03 Preparation Before this experiment, we recommen you review or familiarize yourself with the following: Chapters 4-6 in Taylor
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationLecture 6: Calculus. In Song Kim. September 7, 2011
Lecture 6: Calculus In Song Kim September 7, 20 Introuction to Differential Calculus In our previous lecture we came up with several ways to analyze functions. We saw previously that the slope of a linear
More informationThe Exact Form and General Integrating Factors
7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More information'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21
Large amping in a structural material may be either esirable or unesirable, epening on the engineering application at han. For example, amping is a esirable property to the esigner concerne with limiting
More information1 dx. where is a large constant, i.e., 1, (7.6) and Px is of the order of unity. Indeed, if px is given by (7.5), the inequality (7.
Lectures Nine an Ten The WKB Approximation The WKB metho is a powerful tool to obtain solutions for many physical problems It is generally applicable to problems of wave propagation in which the frequency
More informationThe new concepts of measurement error s regularities and effect characteristics
The new concepts of measurement error s regularities an effect characteristics Ye Xiaoming[1,] Liu Haibo [3,,] Ling Mo[3] Xiao Xuebin [5] [1] School of Geoesy an Geomatics, Wuhan University, Wuhan, Hubei,
More informationd dx But have you ever seen a derivation of these results? We ll prove the first result below. cos h 1
Lecture 5 Some ifferentiation rules Trigonometric functions (Relevant section from Stewart, Seventh Eition: Section 3.3) You all know that sin = cos cos = sin. () But have you ever seen a erivation of
More informationTransmission Line Matrix (TLM) network analogues of reversible trapping processes Part B: scaling and consistency
Transmission Line Matrix (TLM network analogues of reversible trapping processes Part B: scaling an consistency Donar e Cogan * ANC Eucation, 308-310.A. De Mel Mawatha, Colombo 3, Sri Lanka * onarecogan@gmail.com
More informationFLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction
FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number
More informationConvergence of Random Walks
Chapter 16 Convergence of Ranom Walks This lecture examines the convergence of ranom walks to the Wiener process. This is very important both physically an statistically, an illustrates the utility of
More informationLectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs
Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent
More informationMulti-View Clustering via Canonical Correlation Analysis
Technical Report TTI-TR-2008-5 Multi-View Clustering via Canonical Correlation Analysis Kamalika Chauhuri UC San Diego Sham M. Kakae Toyota Technological Institute at Chicago ABSTRACT Clustering ata in
More informationConstruction of the Electronic Radial Wave Functions and Probability Distributions of Hydrogen-like Systems
Construction of the Electronic Raial Wave Functions an Probability Distributions of Hyrogen-like Systems Thomas S. Kuntzleman, Department of Chemistry Spring Arbor University, Spring Arbor MI 498 tkuntzle@arbor.eu
More informationA Modification of the Jarque-Bera Test. for Normality
Int. J. Contemp. Math. Sciences, Vol. 8, 01, no. 17, 84-85 HIKARI Lt, www.m-hikari.com http://x.oi.org/10.1988/ijcms.01.9106 A Moification of the Jarque-Bera Test for Normality Moawa El-Fallah Ab El-Salam
More information05 The Continuum Limit and the Wave Equation
Utah State University DigitalCommons@USU Founations of Wave Phenomena Physics, Department of 1-1-2004 05 The Continuum Limit an the Wave Equation Charles G. Torre Department of Physics, Utah State University,
More informationensembles When working with density operators, we can use this connection to define a generalized Bloch vector: v x Tr x, v y Tr y
Ph195a lecture notes, 1/3/01 Density operators for spin- 1 ensembles So far in our iscussion of spin- 1 systems, we have restricte our attention to the case of pure states an Hamiltonian evolution. Toay
More informationA Review of Multiple Try MCMC algorithms for Signal Processing
A Review of Multiple Try MCMC algorithms for Signal Processing Luca Martino Image Processing Lab., Universitat e València (Spain) Universia Carlos III e Mari, Leganes (Spain) Abstract Many applications
More informationEstimation of District Level Poor Households in the State of. Uttar Pradesh in India by Combining NSSO Survey and
Int. Statistical Inst.: Proc. 58th Worl Statistical Congress, 2011, Dublin (Session CPS039) p.6567 Estimation of District Level Poor Househols in the State of Uttar Praesh in Inia by Combining NSSO Survey
More informationLogarithmic spurious regressions
Logarithmic spurious regressions Robert M. e Jong Michigan State University February 5, 22 Abstract Spurious regressions, i.e. regressions in which an integrate process is regresse on another integrate
More informationResearch Article When Inflation Causes No Increase in Claim Amounts
Probability an Statistics Volume 2009, Article ID 943926, 10 pages oi:10.1155/2009/943926 Research Article When Inflation Causes No Increase in Claim Amounts Vytaras Brazauskas, 1 Bruce L. Jones, 2 an
More informationQuantum mechanical approaches to the virial
Quantum mechanical approaches to the virial S.LeBohec Department of Physics an Astronomy, University of Utah, Salt Lae City, UT 84112, USA Date: June 30 th 2015 In this note, we approach the virial from
More informationSimilarity Measures for Categorical Data A Comparative Study. Technical Report
Similarity Measures for Categorical Data A Comparative Stuy Technical Report Department of Computer Science an Engineering University of Minnesota 4-92 EECS Builing 200 Union Street SE Minneapolis, MN
More informationIntegration Review. May 11, 2013
Integration Review May 11, 2013 Goals: Review the funamental theorem of calculus. Review u-substitution. Review integration by parts. Do lots of integration eamples. 1 Funamental Theorem of Calculus In
More informationMath 1B, lecture 8: Integration by parts
Math B, lecture 8: Integration by parts Nathan Pflueger 23 September 2 Introuction Integration by parts, similarly to integration by substitution, reverses a well-known technique of ifferentiation an explores
More informationCascaded redundancy reduction
Network: Comput. Neural Syst. 9 (1998) 73 84. Printe in the UK PII: S0954-898X(98)88342-5 Cascae reunancy reuction Virginia R e Sa an Geoffrey E Hinton Department of Computer Science, University of Toronto,
More informationThe Press-Schechter mass function
The Press-Schechter mass function To state the obvious: It is important to relate our theories to what we can observe. We have looke at linear perturbation theory, an we have consiere a simple moel for
More informationNOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,
NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which
More informationDEGREE DISTRIBUTION OF SHORTEST PATH TREES AND BIAS OF NETWORK SAMPLING ALGORITHMS
DEGREE DISTRIBUTION OF SHORTEST PATH TREES AND BIAS OF NETWORK SAMPLING ALGORITHMS SHANKAR BHAMIDI 1, JESSE GOODMAN 2, REMCO VAN DER HOFSTAD 3, AND JÚLIA KOMJÁTHY3 Abstract. In this article, we explicitly
More informationQuantum Mechanics in Three Dimensions
Physics 342 Lecture 20 Quantum Mechanics in Three Dimensions Lecture 20 Physics 342 Quantum Mechanics I Monay, March 24th, 2008 We begin our spherical solutions with the simplest possible case zero potential.
More information2Algebraic ONLINE PAGE PROOFS. foundations
Algebraic founations. Kick off with CAS. Algebraic skills.3 Pascal s triangle an binomial expansions.4 The binomial theorem.5 Sets of real numbers.6 Surs.7 Review . Kick off with CAS Playing lotto Using
More informationOptimization of Geometries by Energy Minimization
Optimization of Geometries by Energy Minimization by Tracy P. Hamilton Department of Chemistry University of Alabama at Birmingham Birmingham, AL 3594-140 hamilton@uab.eu Copyright Tracy P. Hamilton, 1997.
More informationLecture 2: Correlated Topic Model
Probabilistic Moels for Unsupervise Learning Spring 203 Lecture 2: Correlate Topic Moel Inference for Correlate Topic Moel Yuan Yuan First of all, let us make some claims about the parameters an variables
More information4.2 First Differentiation Rules; Leibniz Notation
.. FIRST DIFFERENTIATION RULES; LEIBNIZ NOTATION 307. First Differentiation Rules; Leibniz Notation In this section we erive rules which let us quickly compute the erivative function f (x) for any polynomial
More informationA variance decomposition and a Central Limit Theorem for empirical losses associated with resampling designs
Mathias Fuchs, Norbert Krautenbacher A variance ecomposition an a Central Limit Theorem for empirical losses associate with resampling esigns Technical Report Number 173, 2014 Department of Statistics
More informationCONTROL CHARTS FOR VARIABLES
UNIT CONTOL CHATS FO VAIABLES Structure.1 Introuction Objectives. Control Chart Technique.3 Control Charts for Variables.4 Control Chart for Mean(-Chart).5 ange Chart (-Chart).6 Stanar Deviation Chart
More informationSurvey-weighted Unit-Level Small Area Estimation
Survey-weighte Unit-Level Small Area Estimation Jan Pablo Burgar an Patricia Dörr Abstract For evience-base regional policy making, geographically ifferentiate estimates of socio-economic inicators are
More informationIntroduction to Markov Processes
Introuction to Markov Processes Connexions moule m44014 Zzis law Gustav) Meglicki, Jr Office of the VP for Information Technology Iniana University RCS: Section-2.tex,v 1.24 2012/12/21 18:03:08 gustav
More informationA Random Graph Model for Massive Graphs
A Ranom Graph Moel for Massive Graphs William Aiello AT&T Labs Florham Park, New Jersey aiello@research.att.com Fan Chung University of California, San Diego fan@ucs.eu Linyuan Lu University of Pennsylvania,
More informationVectors in two dimensions
Vectors in two imensions Until now, we have been working in one imension only The main reason for this is to become familiar with the main physical ieas like Newton s secon law, without the aitional complication
More informationEstimating International Migration on the Base of Small Area Techniques
MPRA Munich Personal RePEc Archive Estimating International Migration on the Base of Small Area echniques Vergil Voineagu an Nicoleta Caragea an Silvia Pisica 2013 Online at http://mpra.ub.uni-muenchen.e/48775/
More informationAPPPHYS 217 Thursday 8 April 2010
APPPHYS 7 Thursay 8 April A&M example 6: The ouble integrator Consier the motion of a point particle in D with the applie force as a control input This is simply Newton s equation F ma with F u : t q q
More informationIterated Point-Line Configurations Grow Doubly-Exponentially
Iterate Point-Line Configurations Grow Doubly-Exponentially Joshua Cooper an Mark Walters July 9, 008 Abstract Begin with a set of four points in the real plane in general position. A to this collection
More informationTable of Common Derivatives By David Abraham
Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec
More informationII. First variation of functionals
II. First variation of functionals The erivative of a function being zero is a necessary conition for the etremum of that function in orinary calculus. Let us now tackle the question of the equivalent
More informationWhy Bernstein Polynomials Are Better: Fuzzy-Inspired Justification
Why Bernstein Polynomials Are Better: Fuzzy-Inspire Justification Jaime Nava 1, Olga Kosheleva 2, an Vlaik Kreinovich 3 1,3 Department of Computer Science 2 Department of Teacher Eucation University of
More informationTwo formulas for the Euler ϕ-function
Two formulas for the Euler ϕ-function Robert Frieman A multiplication formula for ϕ(n) The first formula we want to prove is the following: Theorem 1. If n 1 an n 2 are relatively prime positive integers,
More informationA comparison of small area estimators of counts aligned with direct higher level estimates
A comparison of small area estimators of counts aligne with irect higher level estimates Giorgio E. Montanari, M. Giovanna Ranalli an Cecilia Vicarelli Abstract Inirect estimators for small areas use auxiliary
More informationCalculus of Variations
Calculus of Variations Lagrangian formalism is the main tool of theoretical classical mechanics. Calculus of Variations is a part of Mathematics which Lagrangian formalism is base on. In this section,
More informationLagrangian and Hamiltonian Mechanics
Lagrangian an Hamiltonian Mechanics.G. Simpson, Ph.. epartment of Physical Sciences an Engineering Prince George s Community College ecember 5, 007 Introuction In this course we have been stuying classical
More informationSwitching Time Optimization in Discretized Hybrid Dynamical Systems
Switching Time Optimization in Discretize Hybri Dynamical Systems Kathrin Flaßkamp, To Murphey, an Sina Ober-Blöbaum Abstract Switching time optimization (STO) arises in systems that have a finite set
More informationA NONLINEAR SOURCE SEPARATION APPROACH FOR THE NICOLSKY-EISENMAN MODEL
6th European Signal Processing Conference EUSIPCO 28, Lausanne, Switzerlan, August 25-29, 28, copyright by EURASIP A NONLINEAR SOURCE SEPARATION APPROACH FOR THE NICOLSKY-EISENMAN MODEL Leonaro Tomazeli
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More informationThe Subtree Size Profile of Plane-oriented Recursive Trees
The Subtree Size Profile of Plane-oriente Recursive Trees Michael FUCHS Department of Applie Mathematics National Chiao Tung University Hsinchu, 3, Taiwan Email: mfuchs@math.nctu.eu.tw Abstract In this
More informationIntroduction to variational calculus: Lecture notes 1
October 10, 2006 Introuction to variational calculus: Lecture notes 1 Ewin Langmann Mathematical Physics, KTH Physics, AlbaNova, SE-106 91 Stockholm, Sween Abstract I give an informal summary of variational
More informationTEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE
TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS Yannick DEVILLE Université Paul Sabatier Laboratoire Acoustique, Métrologie, Instrumentation Bât. 3RB2, 8 Route e Narbonne,
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
More informationChapter 6: Energy-Momentum Tensors
49 Chapter 6: Energy-Momentum Tensors This chapter outlines the general theory of energy an momentum conservation in terms of energy-momentum tensors, then applies these ieas to the case of Bohm's moel.
More informationOn colour-blind distinguishing colour pallets in regular graphs
J Comb Optim (2014 28:348 357 DOI 10.1007/s10878-012-9556-x On colour-blin istinguishing colour pallets in regular graphs Jakub Przybyło Publishe online: 25 October 2012 The Author(s 2012. This article
More informationCalculus of Variations
16.323 Lecture 5 Calculus of Variations Calculus of Variations Most books cover this material well, but Kirk Chapter 4 oes a particularly nice job. x(t) x* x*+ αδx (1) x*- αδx (1) αδx (1) αδx (1) t f t
More informationLecture Note 2. 1 Bonferroni Principle. 1.1 Idea. 1.2 Want. Material covered today is from Chapter 1 and chapter 4
Lecture Note 2 Material covere toay is from Chapter an chapter 4 Bonferroni Principle. Iea Get an iea the frequency of events when things are ranom billion = 0 9 Each person has a % chance to stay in a
More informationEstimating Unemployment for Small Areas in Navarra, Spain
Estimating Unemployment for Small Areas in Navarra, Spain Ugarte, M.D., Militino, A.F., an Goicoa, T. Departamento e Estaística e Investigación Operativa, Universia Pública e Navarra Campus e Arrosaía,
More informationFinal Exam Study Guide and Practice Problems Solutions
Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making
More informationCrowdsourced Judgement Elicitation with Endogenous Proficiency
Crowsource Jugement Elicitation with Enogenous Proficiency Anirban Dasgupta Arpita Ghosh Abstract Crowsourcing is now wiely use to replace jugement or evaluation by an expert authority with an aggregate
More informationHybrid Fusion for Biometrics: Combining Score-level and Decision-level Fusion
Hybri Fusion for Biometrics: Combining Score-level an Decision-level Fusion Qian Tao Raymon Velhuis Signals an Systems Group, University of Twente Postbus 217, 7500AE Enschee, the Netherlans {q.tao,r.n.j.velhuis}@ewi.utwente.nl
More informationDesigning of Acceptance Double Sampling Plan for Life Test Based on Percentiles of Exponentiated Rayleigh Distribution
International Journal of Statistics an Systems ISSN 973-675 Volume, Number 3 (7), pp. 475-484 Research Inia Publications http://www.ripublication.com Designing of Acceptance Double Sampling Plan for Life
More informationUnit #6 - Families of Functions, Taylor Polynomials, l Hopital s Rule
Unit # - Families of Functions, Taylor Polynomials, l Hopital s Rule Some problems an solutions selecte or aapte from Hughes-Hallett Calculus. Critical Points. Consier the function f) = 54 +. b) a) Fin
More informationLecture 6: Generalized multivariate analysis of variance
Lecture 6: Generalize multivariate analysis of variance Measuring association of the entire microbiome with other variables Distance matrices capture some aspects of the ata (e.g. microbiome composition,
More informationu!i = a T u = 0. Then S satisfies
Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace
More information