Proportional Selection in Networks

Georgios Papasotiropoulos, Oskar Skibski, Piotr Skowron, Tomasz Was

Abstract: 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.