<node id="641623">
  <nid>641623</nid>
  <type>event</type>
  <uid>
    <user id="27544"><![CDATA[27544]]></user>
  </uid>
  <created>1606227147</created>
  <changed>1606227257</changed>
  <title><![CDATA[ARC and Indo-US Virtual Center Seminar: Zongchen Chen (Georgia Tech)]]></title>
  <body><![CDATA[<p align = "center"><strong>Algorithms &amp; Randomness Center (ARC) and</strong></p>

<p align = "center"><strong>Indo-US Virtual Center Seminar</strong></p>

<p align = "center"><strong>Zonchen Chen (Georgia Tech)</strong></p>

<p align = "center"><strong>Monday, November 30, 2020</strong></p>

<p align = "center"><strong>Virtual via BlueJeans - 11:00am</strong></p>

<p>&nbsp;</p>

<p><strong>Title:&nbsp; </strong>Optimal Mixing of Glauber Dynamics: Entropy Factorization via High-Dimensional Expansion</p>

<p><strong>Abstract:&nbsp; </strong>We consider the Glauber dynamics (also called Gibbs sampling) for sampling from a discrete high-dimensional space, where in each step&nbsp;one variable is chosen uniformly at random and gets updated conditional on all other variables. We show an optimal mixing time bound for&nbsp;the Glauber dynamics in a variety of settings. Our work presents an improved version of the spectral independence approach of Anari et al.&nbsp;(2020) and shows O(nlogn) mixing time for graphical models/spin systems on any n-vertex graph of bounded degree when the maximum&nbsp;eigenvalue of an associated influence matrix is bounded. Our proof approach combines classic tools of entropy tensorization/factorization&nbsp;and recent developments of high-dimensional expanders.<br />
<br />
As an application of our results, for the hard-core model on independent sets weighted by a fugacity lambda, we establish O(nlogn) mixing&nbsp;time for the Glauber dynamics on any n-vertex graph of constant maximum degree D when lambda&lt;lambda_c(D) where lambda_c(D) is&nbsp;the critical point for the uniqueness/non-uniqueness phase transition on the D-regular tree. More generally, for any antiferromagnetic 2-spin&nbsp;system we prove O(nlogn) mixing time of the Glauber dynamics on any bounded degree graph in the corresponding tree uniqueness&nbsp;region. Our results apply more broadly; for example, we also obtain O(nlogn) mixing for sampling random q-colorings of triangle-free&nbsp;graphs of maximum degree D when the number of colors satisfies q &gt; aD where a = 1.763&hellip;, and O(mlogn) mixing for generating random&nbsp;matchings of any graph with bounded degree and m edges.</p>

<p>----------------------------------</p>

<p><a href="https://sites.google.com/view/zongchenchen">Speaker&#39;s Webpage</a></p>

<p><em>Videos of recent talks are available at: </em><a href="http://arc.gatech.edu/node/121">http://arc.gatech.edu/node/121</a></p>

<p><a href="https://mailman.cc.gatech.edu/mailman/listinfo/arc-colloq"><em>Click here to subscribe to the seminar email list: arc-colloq@Klauscc.gatech.edu </em></a></p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Optimal Mixing of Glauber Dynamics: Entropy Factorization via High-Dimensional Expansion: Virtual via Bluejeans @ 11:00am]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2020-11-30T11:00:00-05:00]]></value>
      <value2><![CDATA[2020-11-30T12:00:00-05:00]]></value2>
      <rrule><![CDATA[]]></rrule>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_time>
  <field_fee>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_fee>
  <field_extras>
      </field_extras>
  <field_audience>
          <item>
        <value><![CDATA[Faculty/Staff]]></value>
      </item>
          <item>
        <value><![CDATA[Postdoc]]></value>
      </item>
          <item>
        <value><![CDATA[Graduate students]]></value>
      </item>
          <item>
        <value><![CDATA[Undergraduate students]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_location>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_phone>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_phone>
  <field_url>
    <item>
      <url><![CDATA[]]></url>
      <title><![CDATA[]]></title>
            <attributes><![CDATA[]]></attributes>
    </item>
  </field_url>
  <field_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_email>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>70263</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[ARC]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1795</tid>
        <value><![CDATA[Seminar/Lecture/Colloquium]]></value>
      </item>
      </field_categories>
  <field_keywords>
      </field_keywords>
  <userdata><![CDATA[]]></userdata>
</node>
