Proportional Selection in Networks

We address the problem of selecting $k$ representative nodes from a network, aiming to achieve two objectives: identifying the most influential nodes and ensuring the selection proportionally reflects the network's diversity. We propose two approaches to accomplish this, analyze them theoretically, and demonstrate their effectiveness through a series of experiments.

@article{papasotiropoulos2025_2502.03545,
  title={ Proportional Selection in Networks },
  author={ Georgios Papasotiropoulos and Oskar Skibski and Piotr Skowron and Tomasz Wąs },
  journal={arXiv preprint arXiv:2502.03545},
  year={ 2025 }
}