ProfitLeader (PL) centrality evaluates node importance based on the capacity to provide resources to neighbors [2]. For each neighbor \(j \in \mathcal{N}(i)\), the available resource from \(i\) to \(j\) is denoted \(AR(i,j)\), and the sharing probability based on similarity is \(SP(i,j)\). The centrality of \(i\) is defined as
\[
c_{PL}(i) = \sum_{j \in \mathcal{N}(i)} AR(i,j) \cdot SP(i,j)
= \sum_{j \in \mathcal{N}(i)} \left( |\mathcal{N}(i)| {+} \sum_{k \in \mathcal{N}(i) \setminus \mathcal{N}(j)} |\mathcal{N}(k)| \right) \cdot \frac{|\mathcal{N}(i) {\cap} \mathcal{N}(j)|}{|\mathcal{N}(i) {\cup} \mathcal{N}(j)|},
\]
where \(\mathcal{N}(i)\) denotes the set of neighbors of \(i\). Nodes achieve high centrality scores if they provide substantial resources to many similar neighbors, reflecting both connectivity and neighborhood overlap.

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] Yu, Z., Shao, J., Yang, Q., & Sun, Z. (2019). Profitleader: Identifying leaders in networks with profit capacity. World Wide Web, 22(2), 533-553. doi: 10.1007/s11280-018-0537-6.