:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Masuyama, Hiroyuki
Format:	Preprint
Published:	2024
Subjects:	Social and Information Networks
Online Access:	https://arxiv.org/abs/2501.00417
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

Broadcasting in random recursive dags
by: Briend, Simon, et al.
Published: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Dynamical importance and network perturbations
by: Young, Ethan, et al.
Published: (2024)

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

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

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

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

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

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

Fairness-Sensitive PageRank Approximation
by: Kumar, Mukesh, et al.
Published: (2026)

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

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

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

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

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

Stationary distribution of node2vec random walks on household models
by: Schroeder, Lars, et al.
Published: (2025)