Παρουσίαση/Προβολή

(CEID1187) -  Σωτήριος Νικολετσέας

Περιγραφή Μαθήματος

Το μάθημα διδάσκεται από τον καθηγητή Σωτήρη Νικολετσέα, Παρασκευή, 11-1μμ, στην αίθουσα Δ1 του κτιρίου Μηχανικών Η/Υ και Πληροφορικής.

Συνοπτική περιγραφή. Most social, biological, and technological networks display substantial non-trivial topological features, with patterns of connection between their elements that are neither purely regular nor purely random. Such features include a heavy tail in the degree distribution, a high clustering coefficient, assortativity or disassortativity among vertices, community structure, and hierarchical structure. In contrast, many of the mathematical models of networks that have been studied in the past, such as lattices and random graphs, do not show these features.

Two well-known and much studied classes of complex networks are scale-free networks and small-world networks. Both are characterized by specific structuralfeatures?power-law degree distributions for the former and short path lengths and high clustering for the latter. However, as the study of complex networks has continued to grow in importance and popularity, many other aspects of network structure have attracted attention as well.

Recently, the study of complex networks has been expanded to networks of networks. If those networks are interdependent, they become significantly more vulnerable to random failures and targeted attacks and exhibit cascading failures and percolation transitions. The field continues to develop at a brisk pace, and has brought together researchers from many areas including mathematics, physics, electric power systems, biology, climate, computer science, sociology, epidemiology, and others.

Ημερομηνία δημιουργίας

Τρίτη, 17 Μαρτίου 2020