Betweenness Central Nodes Under Uncertainty: An Absorbing Markov Chain Approach
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917501938434048 |
|---|---|
| author | Bao, Wencheng Kontou, Eleftheria Vogiatzis, Chrysafis |
| author_facet | Bao, Wencheng Kontou, Eleftheria Vogiatzis, Chrysafis |
| contents | We propose a betweenness centrality measure and algorithms for stochastic networks, where edges can fail and weights vary across realizations, making the most central node random. Our approach models the sequence of reported central nodes as an absorbing Markov chain and measures node importance by the share of pre-absorption time spent at each node. This produces a way to study centrality under uncertainty, which can then be estimated with Monte Carlo simulation. We also analyze robustness when the transition kernel is only approximately known, using row-wise perturbations to assess sensitivity and potential ranking changes. The framework further admits extensions to weighted rewards and restricted candidate sets without altering the Markov chain formulation. Experiments on Erdős-Rényi, Watts-Strogatz, and Les Misérables networks with stochastic edges show that the method identifies a small set of dominant nodes, reveals stable versus sensitive rankings under perturbations, and supports reward-based and structure-constrained variants. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_14743 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Betweenness Central Nodes Under Uncertainty: An Absorbing Markov Chain Approach Bao, Wencheng Kontou, Eleftheria Vogiatzis, Chrysafis Social and Information Networks Optimization and Control We propose a betweenness centrality measure and algorithms for stochastic networks, where edges can fail and weights vary across realizations, making the most central node random. Our approach models the sequence of reported central nodes as an absorbing Markov chain and measures node importance by the share of pre-absorption time spent at each node. This produces a way to study centrality under uncertainty, which can then be estimated with Monte Carlo simulation. We also analyze robustness when the transition kernel is only approximately known, using row-wise perturbations to assess sensitivity and potential ranking changes. The framework further admits extensions to weighted rewards and restricted candidate sets without altering the Markov chain formulation. Experiments on Erdős-Rényi, Watts-Strogatz, and Les Misérables networks with stochastic edges show that the method identifies a small set of dominant nodes, reveals stable versus sensitive rankings under perturbations, and supports reward-based and structure-constrained variants. |
| title | Betweenness Central Nodes Under Uncertainty: An Absorbing Markov Chain Approach |
| topic | Social and Information Networks Optimization and Control |
| url | https://arxiv.org/abs/2605.14743 |