<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN">
<html><body style='font-family: Verdana,Geneva,sans-serif'>
<div>Dear colleagues,</div>
<div>
<p>You are cordially invited to the general <span class="m_5448320135740532138m_6472383400221921050il">seminar</span> organized by the Department of Mathematics, Atılım University.<br /><br />Our speaker is<strong> Türker Bıyıkoğlu.</strong></p>
<p>The title of his talk is <strong>"Graph Entropy, Degree Assortativity, and Hierarchical Structures in Networks"</strong>. </p>
<p>You can find the abstract of his talk below.</p>
</div>
<div>
<p>Abstract: One of the main challenges underlying the recent interest in complex networks is to relate the function to the structure. Many different measures have been proposed as the relevant quantity for characterizing networks, each one typically capturing only some particular aspect of the problem.</p>
<p>I will establish rigorous relations between several major network properties, based on ideas from diverse fields. Among them are the concept of (graph) entropy from information theory that measures the complexity of certain dynamical systems, a breadth-first search algorithm from computer science, Randi\'c index introduced to graph theory from chemistry, degree assortativity of social (networks) interaction patterns and spectral radius of a graph .</p>
<p>We will see that we can tie seemingly unrelated concepts together for a better understanding of complex networks.</p>
<p>This is a joint work with Fatihcan Atay, Bilkent University.</p>
<div>
<div><strong>Date: November 22, 2017</strong></div>
<p><strong>Time: <span class="m_5448320135740532138aBn"><span class="m_5448320135740532138aQJ"><span class="aBn"><span class="aQJ">15:40</span></span></span></span></strong></p>
<p><strong>Place: FEF 404</strong></p>
<div>With my best regards,</div>
<div> </div>
<div>Burcu Gülmez Temür</div>
</div>
<div> </div>
<p> </p>
</div>
<div> </div>
</body></html>