Complex networks, network descriptors and safety in networks

Vojković, Tanja (2015) Complex networks, network descriptors and safety in networks. Doctoral thesis, Faculty of Science > Department of Mathematics.

[img]
Preview
PDF
Language: Croatian

Download (4MB) | Preview

Abstract

In this thesis several areas of theory of complex networks are explored. Generalized versions of network descriptors such as transmission, betweenness centrality, networkness and network surplus, which assume that the ammount of communication in the network is greater between vertices which are at smaller distances than that that are on greater distances, are defined. Minimal and maximal values of these descriptors are studied and lower and upper bounds are obtained. Further, a modified version of Girvan-Newman algorithm for community detection is proposed, which reduces the number of operations compared to the original and leads to faster community detection. In the last part, networks with distributed keys are analyzed and their safety under the attack of enemy agents is studied. Under two different assumptions on the behavior of agents in the network, minimal number of vertices in the network and minimal number of distributed keys needed to secure the network, are determined.

Item Type: Thesis (Doctoral thesis)
Supervisor: Vukičević, Damir
Date: 2015
Number of Pages: 162
Subjects: NATURAL SCIENCES > Mathematics
NATURAL SCIENCES > Mathematics > Discrete end Combinatorial Mathematics
NATURAL SCIENCES > Mathematics > Mathematical Logic and Accounting
NATURAL SCIENCES > Mathematics > Other Mathematical Disciplines
Divisions: Faculty of Science > Department of Mathematics
Depositing User: Iva Prah
Date Deposited: 10 Jun 2015 09:15
Last Modified: 10 Jun 2015 09:15
URI: http://digre.pmf.unizg.hr/id/eprint/4029

Actions (login required)

View Item View Item