Identifying Robust Network Structure By Switching and Rewiring

Simple item page
dc.contributor.advisorXu, Shouhuai
dc.contributor.authorAlshehri, Asma
dc.contributor.committeeMemberMaynard, Hugh
dc.contributor.committeeMemberSandhu, Ravi
dc.date.accessioned2024-01-26T16:48:26Z
dc.date.available2024-01-26T16:48:26Z
dc.date.issued2013
dc.descriptionThis item is available only to currently enrolled UTSA students, faculty or staff. To download, navigate to Log In in the top right-hand corner of this screen, then select Log in with my UTSA ID.
dc.description.abstractNetwork robustness captures the resilience of networks under disruptions such as the deletion of nodes and/or edges in the networks. Therefore, understanding and identifying robust networks is an important problem. This thesis studies how to enhance the robustness of networks by presenting two new algorithms/strategies. The first algorithm is called "neighborhood switching". The second algorithm is called "neighborhood rewiring". The robustness gain of these algorithms is evaluated in terms of four measures: percolation threshold, network diameter, average path length, and node robustness. The thesis also discusses the new findings and insights.
dc.description.departmentComputer Science
dc.format.extent80 pages
dc.format.mimetypeapplication/pdf
dc.identifier.urihttps://hdl.handle.net/20.500.12588/2542
dc.languageen
dc.subjectcomplex network
dc.subjectrobustness
dc.subjectsecurity
dc.subject.classificationComputer science
dc.titleIdentifying Robust Network Structure By Switching and Rewiring
dc.typeThesis
dc.type.dcmiText
dcterms.accessRightspq_closed
thesis.degree.departmentComputer Science
thesis.degree.grantorUniversity of Texas at San Antonio
thesis.degree.levelMasters
thesis.degree.nameMaster of Science

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Alshehri_utsa_1283M_11240.pdf
Size:
5.61 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations - UTSA Access Only