Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Masuyama, Hiroyuki
Formato:	Preprint
Publicado:	2024
Materias:	Social and Information Networks
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

Broadcasting in random recursive dags
por: Briend, Simon, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Dynamical importance and network perturbations
por: Young, Ethan, et al.
Publicado: (2024)

Fairness-Sensitive PageRank Approximation
por: Kumar, Mukesh, et al.
Publicado: (2026)

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

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

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

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

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

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

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

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

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