The critical node problem in stochastic networks with discrete-time Markov chain
AbstractThe length of the stochastic shortest path is defined as the arrival probability from a source node to a destination node. The uncertainty of the network topology causes unstable connections between nodes. A discrete-time Markov chain is devised according to the uniform distribution of existing arcs where the arrival probability is computed as a finite transition probability from the initial state to the absorbing state.Two situations are assumed, departing from the current state to a new state, or waiting in the current state while expecting better conditions. Our goal is to contribute to determining the critical node in a stochastic network, where its absence results in the greatest decrease of the arrival probability. The proposed method is a simply application for analyzing the resistance of networks against congestion and provides some crucial information of the individual nodes. Finally, this is illustrated using networks of various topologies.
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).