Fully personalized PageRank and algebraic methods to distribute a random walker
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911118228717568 |
|---|---|
| author | Contreras-Aso, Gonzalo Criado, Regino Romance, Miguel |
| author_facet | Contreras-Aso, Gonzalo Criado, Regino Romance, Miguel |
| contents | We present a comprehensive analysis of algebraic methods for controlling the stationary distribution of PageRank-like random walkers. Building upon existing literature, we compile and extend results regarding both structural control (through network modifications) and parametric control (through measure parameters) of these centralities. We characterize the conditions for complete control of centrality scores and the weaker notion of ranking control, establishing bounds for the required parameters. Our analysis includes classical PageRank alongside two generalizations: node-dependent dampings and node-dependent personalization vector, with the latter being a novel idea in the literature. We examine how their underlying random walk structures affect their controllability, and we also investigate the concepts of competitors and leaders in centrality rankings, providing insights into how parameter variations can influence node importance hierarchies. These results advance our understanding of the interplay between algebraic control and stochastic dynamics in network centrality measures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_19927 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fully personalized PageRank and algebraic methods to distribute a random walker Contreras-Aso, Gonzalo Criado, Regino Romance, Miguel Social and Information Networks Spectral Theory Physics and Society We present a comprehensive analysis of algebraic methods for controlling the stationary distribution of PageRank-like random walkers. Building upon existing literature, we compile and extend results regarding both structural control (through network modifications) and parametric control (through measure parameters) of these centralities. We characterize the conditions for complete control of centrality scores and the weaker notion of ranking control, establishing bounds for the required parameters. Our analysis includes classical PageRank alongside two generalizations: node-dependent dampings and node-dependent personalization vector, with the latter being a novel idea in the literature. We examine how their underlying random walk structures affect their controllability, and we also investigate the concepts of competitors and leaders in centrality rankings, providing insights into how parameter variations can influence node importance hierarchies. These results advance our understanding of the interplay between algebraic control and stochastic dynamics in network centrality measures. |
| title | Fully personalized PageRank and algebraic methods to distribute a random walker |
| topic | Social and Information Networks Spectral Theory Physics and Society |
| url | https://arxiv.org/abs/2503.19927 |