<node id="612935">
  <nid>612935</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1539865483</created>
  <changed>1539865483</changed>
  <title><![CDATA[PhD Defense by Kaeser M. Sabrin]]></title>
  <body><![CDATA[<p><strong>Title: The Hourglass Effect in Source-Target Dependency Networks </strong><br />
<br />
Kaeser M. Sabrin<br />
School of Computer Science<br />
College of Computing<br />
Georgia Institute of Technology<br />
<br />
<strong>Date:</strong> Wednesday, Oct 31, 2018<br />
<strong>Time:</strong> 02:30 pm - 04:30 pm&nbsp;<br />
<strong>Location:</strong> Klaus 1202<br />
<br />
<strong>Committee:</strong><br />
Dr. Constantine Dovrolis (Advisor), School of Computer Science, Georgia Institute of Technology<br />
Dr. Bistra Dilkina, Department of Computer Science, University of Southern California &amp; School of Computational Science and Engineering, Georgia Institute of Technology<br />
Dr. &Uuml;mit V. &Ccedil;ataly&uuml;rek, School of Computational Science and Engineering, Georgia Institute of Technology<br />
Dr. Rahul Basole, School of Interactive Computing, Georgia Institute of Technology<br />
Dr. Faryad Darabi Sahneh, Department of Mathematics, University of Arizona<br />
<br />
<strong>Abstract:</strong></p>

<p>Many hierarchically modular systems are structured in a way that resembles the shape of an hourglass: the system generates many outputs from many inputs through a relatively small number of intermediate modules that are critical for the operation of the entire system, referred to as the waist of the hourglass.</p>

<p>&nbsp;</p>

<p>We first investigate the hourglass effect in hierarchical, but not necessarily layered, dependency networks. Our analysis focuses on the number of source-to-target dependency paths that traverse each vertex. We identify the core of a dependency network as the smallest set of vertices that collectively cover a given fraction of all dependency paths. We examine if a given network exhibits the hourglass property or not, comparing its core size with a &quot;flat&quot; (i.e., non-hierarchical) network that preserves the source dependencies of each target in the original network.</p>

<p>&nbsp;</p>

<p>As a possible explanation for the hourglass effect, we propose the &quot;Reuse Preference&quot; (RP) model that captures the bias of new modules to reuse intermediate modules of similar complexity instead of connecting directly to sources or low-complexity modules.</p>

<p>&nbsp;</p>

<p>We have applied this analysis in dependency networks that include technological, natural and information systems, showing that they exhibit the general hourglass property but to a varying degree and with different waist characteristics. We also compare the hourglass analysis framework with existing network &ldquo;core finding&quot; methods and compare path centrality with other vertex centrality metrics.</p>

<p>&nbsp;</p>

<p>Finally, we extend our framework to networks that are not strictly hierarchical because they include feedback loops and lateral connections. In that context, we focus on the&nbsp;<em>C. elegans</em>&nbsp;brain network (connectome) and identify a core of ten neurons that almost all paths from sensory to motor neurons traverse. We explain the role of those neurons as a dimensionality reduction mechanism, compressing the information provided by the 88 sensory neurons into a smaller set of intermediate-complexity functions that are re-used by the 119 motor neurons.<br />
&nbsp;</p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[The Hourglass Effect in Source-Target Dependency Networks ]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2018-10-31T15:30:00-04:00]]></value>
      <value2><![CDATA[2018-10-31T17:30: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[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>221981</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[Graduate Studies]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1788</tid>
        <value><![CDATA[Other/Miscellaneous]]></value>
      </item>
      </field_categories>
  <field_keywords>
          <item>
        <tid>100811</tid>
        <value><![CDATA[Phd Defense]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
