BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of California\, Berkeley//UCB Events Calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
DTSTART:19701029T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:19700402T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20170106T215016Z
DTSTART;TZID=America/Los_Angeles:20170207T110000
DTEND;TZID=America/Los_Angeles:20170207T130000
TRANSP:OPAQUE
SUMMARY:Seminar 217\, Risk Management: Simple Random Sampling: Not So Simple
UID:105531-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:639 Evans Hall
DESCRIPTION:Speaker: Kellie Ottoboni\, UC Berkeley\n\nAbstract:\nThe theory of inference from simple random samples (SRSs) is fundamental in statistics\; many statistical techniques and formulae assume that the data are an SRS. True random samples are rare\; in practice\, people tend to draw samples by using pseudo-random number generators (PRNGs) and algorithms that map a set of pseudo-random numbers into a subset of the population. Most statisticians take for granted that the software they use "does the right thing\," producing samples that can be treated as if they are SRSs. In fact\, the PRNG and the algorithm for drawing samples matter enormously. We show\, using basic counting principles\, that some widely used methods cannot generate all SRSs of a given size\, and those that can do not always do so with equal frequencies in simulations. We compare the "randomness" and computational efficiency of commonly-used PRNGs to PRNGs based on cryptographic hash functions\, which avoid these pitfalls. We judge these PRNGs by their ability to generate SRSs and find in simulations that their relative merits varies by seed\, population and sample size\, and sampling algorithm. These results are not just limited to SRSs but have implications for all resampling methods\, including the bootstrap\, MCMC\, and Monte Carlo integration.
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=105531&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20170106T215016Z
LAST-MODIFIED:20170110T174920Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR