27.10.2014 Views

Russel-Research-Method-in-Anthropology

Russel-Research-Method-in-Anthropology

Russel-Research-Method-in-Anthropology

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

152 Chapter 6<br />

attracts a slightly more affluent group of buyers. If you do a systematic sample<br />

of every 10th apartment then, depend<strong>in</strong>g on where you entered the list of<br />

apartments, you’d have a sample of 180 corner apartments or no corner apartments<br />

at all.<br />

David and Mary Hatch (1947) studied the Sunday society pages of the New<br />

York Times for the years 1932–1942. They found only stories about wedd<strong>in</strong>gs<br />

of Protestants and concluded that the elite of New York must therefore be Protestant.<br />

Cahnman (1948) po<strong>in</strong>ted out that the Hatches had studied only June<br />

issues of the Times. It seemed reasonable. After all, aren’t most society wedd<strong>in</strong>gs<br />

<strong>in</strong> June? Well, yes. Protestant wedd<strong>in</strong>gs. Upper-class Jews married <strong>in</strong><br />

other months, and the Times covered those wedd<strong>in</strong>gs as well.<br />

You can avoid the periodicity problem by do<strong>in</strong>g simple random sampl<strong>in</strong>g,<br />

but if that’s not possible, another solution is to make two systematic passes<br />

through the population us<strong>in</strong>g different sampl<strong>in</strong>g <strong>in</strong>tervals. Then you can compare<br />

the two samples. Any differences should be attributable to sampl<strong>in</strong>g<br />

error. If they’re not, then you might have a periodicity problem.<br />

Sampl<strong>in</strong>g from a Telephone Book<br />

Systematic sampl<strong>in</strong>g is f<strong>in</strong>e if you know that the sampl<strong>in</strong>g frame has 48,673<br />

elements. What do you do when the size of the sampl<strong>in</strong>g frame is unknown?<br />

A big telephone book is an unnumbered sampl<strong>in</strong>g frame of unknown size. To<br />

use this k<strong>in</strong>d of sampl<strong>in</strong>g frame, first determ<strong>in</strong>e the number of pages that actually<br />

conta<strong>in</strong> list<strong>in</strong>gs. To do this, jot down the number of the first and last pages<br />

on which list<strong>in</strong>gs appear. Most phone books beg<strong>in</strong> with a lot of pages that do<br />

not conta<strong>in</strong> list<strong>in</strong>gs.<br />

Suppose the list<strong>in</strong>gs beg<strong>in</strong> on page 30 and end on page 520. Subtract 30<br />

from 520 and add 1 (520 – 30 1 491) to calculate the number of pages<br />

that carry list<strong>in</strong>gs.<br />

Then note the number of columns per page and the number of l<strong>in</strong>es per<br />

column (count all the l<strong>in</strong>es <strong>in</strong> a column, even the blank ones).<br />

Suppose the phone book has three columns and 96 l<strong>in</strong>es per column (this is<br />

quite typical). To take a random sample of 200 nonbus<strong>in</strong>ess list<strong>in</strong>gs from this<br />

phone book, take a random sample of 400 page numbers (yes, 400) out of the<br />

491 page numbers between 30 and 520. Just th<strong>in</strong>k of the pages as a numbered<br />

sampl<strong>in</strong>g frame of 491 elements. Next, take a sample of 400 column numbers.<br />

S<strong>in</strong>ce there are three columns, you want 400 random choices of the numbers<br />

1, 2, 3. F<strong>in</strong>ally, take a sample of 400 l<strong>in</strong>e numbers. S<strong>in</strong>ce there are 96 l<strong>in</strong>es,<br />

you want 400 random numbers between 1 and 96.<br />

Match up the three sets of numbers and pick the sample of list<strong>in</strong>gs <strong>in</strong> the<br />

phone book. If the first random number between 30 and 520 is 116, go to page

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!