{"492641":{"#nid":"492641","#data":{"type":"event","title":"ARC Colloquium: Antonio Blanca - UC Berkeley","body":[{"value":"\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003ENOTE - Talk is at 2 pm instead of 1 pm.\u003Cbr \/\u003E\u003C\/strong\u003E\u003C\/p\u003E\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003EAlgorithms \u0026amp; Randomness Center (ARC) \u003C\/strong\u003E\u003C\/p\u003E\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003EAntonio Blanca - UC Berkeley\u003C\/strong\u003E\u003C\/p\u003E\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003EFriday, February 5, 2016\u003C\/strong\u003E\u003C\/p\u003E\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003EKlaus 1116 East (not West) - 2:00 pm\u003C\/strong\u003E\u003C\/p\u003E\u003Cp align=\u0022center\u0022\u003E\u003Cstrong\u003E(Refreshments will be served in Klaus 2222 at 3 pm)\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003ETitle: \u003Cbr \/\u003E \u003C\/strong\u003EDynamics for the random-cluster model\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003EAbstract:\u003C\/strong\u003E \u003Cbr \/\u003E The random-cluster model has been widely studied as a unifying framework for random graphs, spin systems and electrical networks, but its dynamics have so far largely resisted analysis. In this talk we present recent results concerning the mixing behavior of natural Markov chains for the random-cluster model in two canonical cases: the mean-field model and the two dimensional lattice graph Z^2. In the mean-field case, we identify a critical regime of the model parameter p in which several natural dynamics undergo an exponential slowdown. In Z^2, we provide tight mixing time bounds for the heat-bath dynamics for all non-critical values of p. These results hold for all values of the second model parameter q \u0026gt; 1.\u003Cbr \/\u003E \u003Cbr \/\u003E Based on joint works with Alistair Sinclair.\u003Cbr \/\u003E \u003Cbr \/\u003E Short Bio: Antonio Blanca is a 5th year PhD student at UC Berkeley advised by Alistair Sinclair. He is interested in algorithms, Markov chain mixing, phase transitions and random structures. He graduated with a BS in Computer Science\/Discrete Math from Georgia Tech.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Talk is at 2 pm instead of 1 pm - Klaus 1116 West"}],"uid":"27466","created_gmt":"2016-01-29 12:48:17","changed_gmt":"2017-04-13 21:16:51","author":"Dani Denton","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2016-02-05T13:00:00-05:00","event_time_end":"2016-02-05T14:00:00-05:00","event_time_end_last":"2016-02-05T14:00:00-05:00","gmt_time_start":"2016-02-05 18:00:00","gmt_time_end":"2016-02-05 19:00:00","gmt_time_end_last":"2016-02-05 19:00:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"70263","name":"ARC"},{"id":"47223","name":"College of Computing"},{"id":"50875","name":"School of Computer Science"}],"categories":[],"keywords":[{"id":"111051","name":"Algorithm and Randomness Center"},{"id":"4265","name":"ARC"},{"id":"115001","name":"Computational Complexity"},{"id":"114991","name":"Computational Learning Theory"},{"id":"109","name":"Georgia Tech"}],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1795","name":"Seminar\/Lecture\/Colloquium"}],"invited_audience":[{"id":"78751","name":"Undergraduate students"},{"id":"78761","name":"Faculty\/Staff"},{"id":"78771","name":"Public"},{"id":"174045","name":"Graduate students"}],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003EDani Denton\u003Cbr \/\u003Edenton at cc dot gatech dot edu\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}