Graph Entropy, Degree Assortativity, and Hierarchical Structures in Networks

Salı, 20 Aralık 2016
Başlangıç zamanı: 
16:00 – 17:00

Doç Dr. Türker Bıyıkoğlu

I will connect several notions relating the structural and dynamical properties of a graph. Among them are the topological graph entropy that is a measure of  the complexity of certain dynamical systems, the spectral radius of the graph’s adjacency matrix, the Randi\'c index of chemical compounds, and the degree assortativity of (social) networks. We will see that a hierarchical structure so called breadth-first search ordering with decreasing degrees is a necessary structure for the extremal graphs that maximize these properties.