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:20111110T222353Z
DTSTART;TZID=America/Los_Angeles:20120402T161000
DTEND;TZID=America/Los_Angeles:20120402T170000
TRANSP:OPAQUE
SUMMARY:Sampling Paths\, Permutations and Lattice Structures
UID:49287-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:60 Evans Hall
DESCRIPTION:Dana Randall\, Georgia Tech\n\nRandom sampling is ubiquitous throughout mathematics\, computing and the sciences as a means of studying very large sets. In this talk we will discuss simple\, classical Markov chains for efficiently sampling paths and permutations. We will look at various natural generalizations with some surprising results. First\, we show how to extend these Markov chain algorithms to sample biased paths\, with applications to tile-based self-assembly\, asymmetric exclusion processes\, self-organized lists\, and biased card shuffling. Next\, we show how generating random configurations with mutliple paths allows us to sample planar tilings and colorings. Using insights from statistical physics\, however\, we will see why these methods break down and may be inefficient in models with non-uniform bias\, in higher dimensions\, or in weighted models with sufficiently high fugacity.
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=49287&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20111110T222353Z
LAST-MODIFIED:20120327T003523Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR