SingleDiscount is a degree-discount heuristic for identifying influential nodes in a network [2]. The method proceeds iteratively as follows:


  1. Identify the node with the highest degree in the current network.

  2. Select this node as an influential node and remove it from the network.

  3. Update the degrees of all remaining nodes to account for the removal.

  4. Repeat the process until the desired number of influential nodes is selected.


Hence, SingleDiscount considers the diminishing influence of neighboring nodes once a high-degree node has been selected.

References

[1] Shvydun, S. (2025). Zoo of Centralities: Encyclopedia of Node Metrics in Complex Networks. arXiv: 2511.05122 https://doi.org/10.48550/arXiv.2511.05122
[2] Chen, W., Wang, Y., & Yang, S. (2009). Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 199-208). doi: 10.1145/1557019.1557047.