Copertina

PureRank: A parameter-free recursive importance measure for network nodes

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Masuyama, Hiroyuki
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Social and Information Networks
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Identification of important nodes in the information propagation network based on the artificial intelligence method
di: Yuan, Bin, et al.
Pubblicazione: (2024)

Homologous nodes in annotated complex networks
di: Moon, Sung Soo, et al.
Pubblicazione: (2025)

The effect of distant connections on node anonymity in complex networks
di: de Jong, Rachel G., et al.
Pubblicazione: (2023)

Weighted cycle-based identification of influential node groups in complex networks
di: Zheng, Wenxin, et al.
Pubblicazione: (2025)

A graph neural network based on feature network for identifying influential nodes
di: Hu, Yanmei, et al.
Pubblicazione: (2025)

Important node identification for complex networks based on improved Electre Multi-Attribute fusion
di: Cao, Qi, et al.
Pubblicazione: (2024)

Improving link prediction accuracy of network embedding algorithms via rich node attribute information
di: Gu, Weiwei, et al.
Pubblicazione: (2024)

The impact of nodes of information dissemination on epidemic spreading in dynamic multiplex networks
di: Feng, Minyu, et al.
Pubblicazione: (2024)

Impact of seed node position on network robustness under localized attacks
di: Chujyo, Masaki, et al.
Pubblicazione: (2026)

Broadcasting in random recursive dags
di: Briend, Simon, et al.
Pubblicazione: (2023)

Nested stochastic block model for simultaneously clustering networks and nodes
di: Josephs, Nathaniel, et al.
Pubblicazione: (2023)

Belief propagation for finite networks using a symmetry-breaking source node
di: Kim, Seongmin, et al.
Pubblicazione: (2025)

Contrastive clustering based on regular equivalence for influential node identification in complex networks
di: Hu, Yanmei, et al.
Pubblicazione: (2025)

A Graph-Neural-Network-Entropy model of vital node identification on network attack and propagation
di: Liao, Huaizhi, et al.
Pubblicazione: (2025)

How does node centrality in a financial network affect asset price prediction?
di: Xu, Yuhong, et al.
Pubblicazione: (2023)

Assortativity in geometric and scale-free networks
di: Kaufmann, Marc, et al.
Pubblicazione: (2025)

Time-dependent Personalized PageRank for temporal networks: discrete and continuous scales
di: Aleja, David, et al.
Pubblicazione: (2024)

Unsupervised node clustering via contrastive hard sampling
di: Cui, Hang, et al.
Pubblicazione: (2024)

Estimating the history of a random recursive tree
di: Briend, Simon, et al.
Pubblicazione: (2024)

RankDCG: Rank-Ordering Evaluation Measure
di: Katerenchuk, Denys, et al.
Pubblicazione: (2018)

Measuring the importance of individual units in producing the collective behavior of a complex network
di: Liang, X. San
Pubblicazione: (2021)

A two-steps tensor eigenvector centrality for nodes and hyperedges in hypergraphs
di: Xu, Qing, et al.
Pubblicazione: (2026)

From low resource information extraction to identifying influential nodes in knowledge graphs
di: Cai, Erica, et al.
Pubblicazione: (2024)

Modularity maximization and community detection in complex networks through recursive and hierarchical annealing in the D-Wave Advantage quantum processing units
di: Falcó-Roget, Joan, et al.
Pubblicazione: (2024)

Fairness Rising from the Ranks: HITS and PageRank on Homophilic Networks
di: Stoica, Ana-Andreea, et al.
Pubblicazione: (2024)

Overlap-aware meta-learning attention to enhance hypergraph neural networks for node classification
di: Yang, Murong, et al.
Pubblicazione: (2025)

Efficient computation of Katz centrality for very dense networks via negative parameter Katz
di: Noferini, Vanni, et al.
Pubblicazione: (2024)

Sampling nodes and hyperedges via random walks on large hypergraphs
di: Nakajima, Kazuki, et al.
Pubblicazione: (2025)

RankMerging: A supervised learning-to-rank framework to predict links in large social network
di: Tabourier, Lionel, et al.
Pubblicazione: (2014)

Dynamical importance and network perturbations
di: Young, Ethan, et al.
Pubblicazione: (2024)

Fairness-Sensitive PageRank Approximation
di: Kumar, Mukesh, et al.
Pubblicazione: (2026)

Statistical Properties of Rankings in Sports and Games
di: Morales, José Antonio, et al.
Pubblicazione: (2021)

Pure Message Passing Can Estimate Common Neighbor for Link Prediction
di: Dong, Kaiwen, et al.
Pubblicazione: (2023)

Finding coherent node groups in directed graphs
di: Kumpulainen, Iiro, et al.
Pubblicazione: (2023)

Analysis and predictability of centrality measures in competition networks
di: Bonato, Anthony, et al.
Pubblicazione: (2025)

Misinformation Resilient Search Rankings with Webgraph-based Interventions
di: Carragher, Peter, et al.
Pubblicazione: (2024)

A systematic comparison of measures for publishing k-anonymous social network data
di: de Jong, Rachel G., et al.
Pubblicazione: (2024)

Exploring Graph Learning Tasks with Pure LLMs: A Comprehensive Benchmark and Investigation
di: Wang, Yuxiang, et al.
Pubblicazione: (2025)

Community detection in bipartite signed networks is highly dependent on parameter choice
di: Candellone, Elena, et al.
Pubblicazione: (2024)

QuickCent: a fast and frugal heuristic for harmonic centrality estimation on scale-free networks
di: Plana, Francisco, et al.
Pubblicazione: (2023)