Please use this identifier to cite or link to this item:
Title: Sufficient control of complex network
Authors: Geraldo, Nicholas Eric
Keywords: Engineering::Electrical and electronic engineering::Control and instrumentation::Control engineering
Issue Date: 2022
Publisher: Nanyang Technological University
Source: Geraldo, N. E. (2022). Sufficient control of complex network. Final Year Project (FYP), Nanyang Technological University, Singapore.
Project: A3286-211
Abstract: This paper serves to further analyze the performance of the suggested algorithm which uses the minimum cost flow problem to control a sufficiently large portion of the network, where only the quantity of controllable nodes matters. Previously, the algorithm has been simulated on complex networks such as the scale-free Barabási–Albert (BA) network, the random Erdos-Renyi (ER) network, and various real-life networks which resulted in varying performance of the proposed algorithm. This shows that different types of networks with differing structures and growths may affect the performance of the algorithm. Thus, this paper addresses the performance of the minimum cost flow algorithm in networks with different growth to evaluate the effectiveness of the algorithm. Furthermore, we analyzed the algorithm under specific conditioning of the network links to test the robustness of the algorithm when the network links are modified.
Schools: School of Electrical and Electronic Engineering 
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
Sufficient Control of Complex Network.pdf
  Restricted Access
965.82 kBAdobe PDFView/Open

Page view(s)

Updated on Sep 26, 2023


Updated on Sep 26, 2023

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.