ae Uei meta come il VOLUME | by STs medal LiAdvanced Sampling Theory with Applications How Michael ‘selected’ Amy Volume I by Sarjinder Singh a KLUWER ACADEMIC PUBLISHERS DORDRECHT / BOSTON / LONDONAC.LP. Catalogue record for this book is available from the Library of Congress. ISBN Vol. 1: 1-4020-1706-5 ISBN Vol. 2: |-4020-1707-3 ISBN set: |-4020-1689-1 Published by Kluwer Academic Publishers, RO, Box 17, 3300 AA Dordrecht, The Netherlands. ‘Sold and distributed in North, Central and South America by Kluwer Academic Publishers, 101 Philip Drive, Norwell, MA 02061, U.S.A. In all other countries, sold and distributed bby Kluwer Academic Publishers, PO. Box 322, 3300 AH Dordrecht, The Netherlands. Printed on acid-free paper All Rights Reserved ‘© 2003 Kluwer Academic Publishers: No part of this work may be reproduced, stored in retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, microfilming, recording or otherwise, without written permission from the Publisher, with the exception ‘of any material supplied specifically for the purpose of being entcred and executed on a computer system, for exclusive use by the purchaser of the work. Printed in the Netherlands.2. SIMPLE RANDOM SAMPLING 2.0 INTRODUCTION ‘Simple Random Sampling (SRS) is the simplest and most common method of selecting a sample, in which the sample is selected unit by unit, with oqual probability of selection for each unit at cach draw. In other words, simple random sampling is a method of selecting a sample s of » units from a population © of size N by giving equal probability of selection to all units. It is a sampling scheme in which all possible combinations of units may be formed from the population of N units with the same chance of selection. As discussed in chapter I: (a) If'a unit is selected, observed, and replaced in the population before the next draw is made and the procedure is repeated » times, it gives rise to a simple random sample of units, This procedure is known as simple random sampling with replacement and is denoted as SRSWR. ((b ) If a unit is selected, observed, and not replaced in the population before making the next draw, and the procedure is repeated until n distinct units are selected, ignoring all repetitions, it is called simple random sampling without replacement and is denoted by SRSWOR. Let us discuss the properties of the estimators of population mean, variance, and proportion in each of these cases. 2.1 SIMPLE RANDOM SAMPLING WITH REPLACEMENT Suppose we select a sample of » 22 units from the population of size N’ by using SRSWR sampling. Let y,, (=1,2,...m, denote the value of the / unit selected in the sample and Y,, (=1,2....¥, be the value of the / unit in the population. Then we have the following theorems: Theorem 2.1.1. The sample mean 7, =a”! fy is an unbiased estimator of the population mean F =v"! £y, int Proof, We have to prove that £(7,)= 7. Now we have eu)! | L$ e(y). 2. wii | Now .y; is a random variable and each unit has been sclected by SRSWR sampling, therefore yj can take values Yoyo %y with probabilities /V, 1/N,... YN. By the definition of the expected value we have