BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Claremont Center for the Mathematical Sciences
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20180311T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20181104T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20190310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20191103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20200308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20201101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20191104T161500
DTEND;TZID=America/Los_Angeles:20191104T171500
DTSTAMP:20260501T210801
CREATED:20190803T171420Z
LAST-MODIFIED:20191026T215438Z
UID:1351-1572884100-1572887700@colleges.claremont.edu
SUMMARY:Markov Chains and Emergent Behavior in Programmable Matter given by Prof. Sarah Canon (CMC)
DESCRIPTION:Markov chains are widely used throughout mathematics\, statistics\, and the sciences\, often for modelling purposes or for generating random samples. In this talk I’ll discuss a different\, more recent application of Markov chains\, to developing distributed algorithms for programmable matter systems. Programmable matter is a material or substance that has the ability to change its features in a programmable\, distributed way; examples are diverse and include robot swarms and smart materials. We study an abstraction of programmable matter where particles independently move on a lattice according to simple\, local algorithms. We want to design these algorithms so that the system has a desired collective behavior\, such as compression of the particles into a shape with small perimeter or separation of differently colored particles. In our stochastic approach\, we describe a desired collective behavior using an energy function; design a Markov chain that uses local moves and converges to the Gibbs distribution for this energy function; and then turn the Markov chain into an asynchronous distributed algorithm that each particle can execute independently. In several of our algorithms\, changing just a single parameter results in a different\, but equally desirable\, emergent global behavior. To prove our algorithms are correct\, we must show this Gibbs distribution has the desired properties with high probability\, which we do using proof techniques from probability\, statistical physics\, and Markov chain analysis. This principled approach has been used to inform the design of real-world robot systems. Joint work with Marta Andres Arroyo\, Enis Aydin\, Joshua J. Daymude\, Bahnisikha Dutta\, Cem Gokmen\, Daniel I. Goldman\, Shengkai Li\, Dana Randall\, Andrea Richa\, William Savoie\, and Ross Warkentin.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-sarah-canon-cmc/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Applied Math Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
END:VCALENDAR