The Braess Paradox is a rare phenomenon that only occurs under specific scenarios. This project aims to study the probability of the Braess Paradox occurring in a Directed Weighted Graph while the number of edges increases. The graphs in the experiment are focused on studying the occurrence of the Braess Paradox in a directed weighted scale-free network while transforming it into a directed weighted complete graph. A simulation model is used to simulate the bots traveling through a network to detect the occurrence of the Braess Paradox, considering the increase of directed weighted edges. A Graph Neural Network (GNN) is later used to train on the data produced by the simulation model.
| Identifer | oai:union.ndltd.org:MSSTATE/oai:scholarsjunction.msstate.edu:td-7169 |
| Date | 10 May 2024 |
| Creators | Prabhakar, Samuel Giftson |
| Publisher | Scholars Junction |
| Source Sets | Mississippi State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses and Dissertations |
Page generated in 0.0021 seconds