<node id="550161">
  <nid>550161</nid>
  <type>event</type>
  <uid>
    <user id="27466"><![CDATA[27466]]></user>
  </uid>
  <created>1467388254</created>
  <changed>1492118126</changed>
  <title><![CDATA[ARC Colloquium:  Shayan Oveis Gharan (Washington)]]></title>
  <body><![CDATA[<p style="color:maroon;">Video of this talk is available at: <a href="https://smartech.gatech.edu/handle/1853/55876">https://smartech.gatech.edu/handle/1853/55876</a></p>
Full collection of talk videos are available at:  
<a href="https://smartech.gatech.edu/handle/1853/46836">https://smartech.gatech.edu/handle/1853/46836</a>

<br>
<br>


<p  align="center"><strong>Algorithms &amp; Randomness Center (ARC)</strong></p>

<p  align="center"><a href="http://homes.cs.washington.edu/~shayan/"><strong>Shayan Oveis Gharan &ndash; </strong><strong>University of Washington</strong></a></p>

<p  align="center"><strong>Monday, September 12, 2016</strong></p>

<p  align="center"><strong>Klaus 1116 East - 11am</strong></p>

<p><strong>Title: &nbsp;</strong><em>Strongly Rayleigh distributions and their Applications in Algorithm Design</em></p>

<p><strong>Abstract</strong>:</p>

<p>A multivariate polynomial p(z1,...,zn) is stable if p(z1,...,zn) &lt;&gt; 0 whenever Im(zi)&gt;0 for all i. Strongly Rayleigh distributions are probability distributions on 0-1 random variables whose generating polynomial is stable. They can be seen as a natural generalization of product distributions.&nbsp;Borcea, Branden and Liggett used&nbsp;the geometry of stable polynomials to prove numerous properties of strongly Rayleigh distributions,&nbsp;including negative association, and closure under conditioning and truncation.<br />
In this talk I will go over basic properties of these distributions, and then I will describe several algorithmic applications.<br />
Based on joint works with Nima Anari, Alireza Rezaei,&nbsp;Mohit Singh, Amin Saberi.</p>

<p><strong>Bio:</strong></p>

<p>Shayan Oveis Gharan is an assistant professor in the <a href="https://www.cs.washington.edu">computer science and engineering</a> department at <a href="http://uw.edu">University of Washington</a>.&nbsp; He received his PhD from the <a href="http://msande.stanford.edu">MS&amp;E department</a> at <a href="http://stanford.edu">Stanford University</a> in 2013 advised by <a href="http://stanford.edu/%7Esaberi%22">Amin Saberi</a> and <a href="http://www.eecs.berkeley.edu/%7Eluca/">Luca Trevisan</a>.&nbsp; Before joining <a href="http://www.washington.edu/">UW</a> he spent one and a half years as a postdoctoral <a href="http://millerinstitute.berkeley.edu">Miller Fellow</a> at <a href="http://www.berkeley.edu/">UC Berkeley</a> where his host was <a href="http://www.cs.berkeley.edu/%7Evazirani/">Umesh Vazirani</a>. He did his undergraduate studies at the <a href="http://ce.sharif.edu">Computer Engineering department</a> at <a href="http://sharif.edu">Sharif University</a>.<br />
Shayan&#39;s research includes Algorithm design, Graph Theory and Applied Probability.&nbsp; He received ACM doctoral dissertation award honorable mention for his PhD thesis &quot;New Rounding Techniques for the Design and Analysis of Approximation Algorithms&quot; in 2013. He and his coauthors received best paper awards at SODA 2010 and FOCS 2011 for their works on the Traveling Salesman Problem.</p>

<p>URL: <a href="http://homes.cs.washington.edu/~shayan/">http://homes.cs.washington.edu/~shayan/</a></p>]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Strongly Rayleigh distributions and their Applications in Algorithm Design (Klaus 1116 E at 11am)]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2016-09-12T12:00:00-04:00]]></value>
      <value2><![CDATA[2016-09-12T13:00:00-04: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[Public]]></value>
      </item>
          <item>
        <value><![CDATA[Undergraduate students]]></value>
      </item>
          <item>
        <value><![CDATA[Graduate students]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[<p>Dani Denton</p>

<p>denton at cc dot gatech dot edu</p>
]]></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[https://www.google.com/maps/place/Klaus+Advanced+Computing+Building/@33.777252,-84.396185,17z/data=!3m1!4b1!4m2!3m1!1s0x87b781ec0ab42ea5:0x16eec927f37b40ec]]></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>
          <item>
        <url>http://homes.cs.washington.edu/~shayan/</url>
        <link_title><![CDATA[Shayan Oveis Gharan]]></link_title>
      </item>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>70263</item>
          <item>50875</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[ARC]]></item>
          <item><![CDATA[School of Computer Science]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1795</tid>
        <value><![CDATA[Seminar/Lecture/Colloquium]]></value>
      </item>
      </field_categories>
  <field_keywords>
          <item>
        <tid>92341</tid>
        <value><![CDATA[Algorithms and Randomness Center]]></value>
      </item>
          <item>
        <tid>4265</tid>
        <value><![CDATA[ARC]]></value>
      </item>
      </field_keywords>
  <userdata><![CDATA[]]></userdata>
</node>
