<node id="168091">
  <nid>168091</nid>
  <type>event</type>
  <uid>
    <user id="27439"><![CDATA[27439]]></user>
  </uid>
  <created>1351856844</created>
  <changed>1475892066</changed>
  <title><![CDATA[CSE Seminar: Leonid Bunimovich, Regents' Professor of Mathematics]]></title>
  <body><![CDATA[<p><strong>CSE Seminar</strong></p><p><strong>Speaker:</strong> Leonid Bunimovich, Regents' Professor of Mathematics, Georgia Tech</p><p><strong>Title:</strong></p><p>How to compress networks while keeping their important characteristics<br /><strong>Abstract:</strong></p><p>One of the fundamental concerns in the study of networks is<br />understanding the relation between a network's structure ("topology") and<br />its dynamics (evolution in time). However, the networks we often encounter<br />in either nature or engineering are typically very large. It is therefore<br />tempting to want to reduce such networks by excluding a part of their<br />elements while preserving some important characteristic(s) of the original<br />network. Such fundamental characteristic is the spectrum (collection of all<br />eigenvalues) of the network's weighted adjacency matrix. Moreover, this<br />matrix often contains all the known information about a network. Can one<br />hope to reduce a network while maintaining its spectrum? It seems that<br />there is no hope because of the Fundamental Theorem of Algebra which says<br />that the spectrum of MxM matrix contains M eigenvalues. Therefore the<br />spectrum of a smaller matrix (corresponding to a smaller network) contains<br />fewer eigenvalues. However, it is possible to do and the recently developed<br />theory of isospectral networks' reduction suggests new ways of networks'<br />analysis and synthesis. In particular, a new equivalence relation in the<br />class of all networks was found. Besides (as a "byproduct") the theory of<br />isospectral networks transformations allowed to advance some classical<br />areas of Mathematics as e.g. estimation of matrices' spectra. Another good<br />news is that numerical implementation of the procedure of isospectral<br />reduction is very simple and straightforward.<br /><br /><strong>Bio:</strong></p><p>Prof. Leonid Bunimovich is a Regents' Professor of Mathematics at<br />Georgia Tech. His research concerns a wide array of problems at the<br />intersection of dynamical systems and statistics. He is known for his<br />discovery of focusing chaotic billiards (the "Bunimovich stadium") and for<br />the Bunimovich mushroom, a billiard with mixed regular and chaotic<br />dynamics. He became a Regents’ Professor and given the Exemplary Senior<br />Faculty Award, in 2000 receiving the Outstanding Faculty Research Author<br />Award. He was made a Fellow of the Institute of Physics in 2004, and was<br />named a Chartered Physicist and Fellow of the UK Institute of Physics in<br />1999. He received the Humboldt Prize in 2003. Prof. Bunimovich received his<br />PhD from the University of Moscow (1973) and a Doctorate of Sciences from<br />the Institute for Theoretical Physics of the Academy of Sciences of USSR,<br />Kiev (1986).</p><p>&nbsp;</p>]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[How to compress networks while keeping their important characteristics]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2012-11-09T13:00:00-05:00]]></value>
      <value2><![CDATA[2012-11-09T14: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>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[<p>For more information, please contact Mark Borodovsky – <a href="mailto:borodovsky@gatech.edu">borodovsky@gatech.edu</a></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[]]></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>1304</item>
          <item>47223</item>
          <item>50875</item>
          <item>50876</item>
          <item>50877</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[High Performance Computing (HPC)]]></item>
          <item><![CDATA[College of Computing]]></item>
          <item><![CDATA[School of Computer Science]]></item>
          <item><![CDATA[School of Interactive Computing]]></item>
          <item><![CDATA[School of Computational Science and Engineering]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1795</tid>
        <value><![CDATA[Seminar/Lecture/Colloquium]]></value>
      </item>
      </field_categories>
  <field_keywords>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
