Copertina

Efficient Algorithms for Computing Random Walk Centrality

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Liu, Changan, Xie, Zixuan, Zehmakan, Ahad N., Zhang, Zhongzhi
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Artificial Intelligence
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Efficient Edge Rewiring Strategies for Enhancing PageRank Fairness
di: Liu, Changan, et al.
Pubblicazione: (2026)

Promoting Fairness in Information Access within Social Networks
di: Liu, Changan, et al.
Pubblicazione: (2025)

Fast Query of Biharmonic Distance in Networks
di: Liu, Changan, et al.
Pubblicazione: (2024)

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges
di: Zhou, Xiaotian, et al.
Pubblicazione: (2025)

A Generalisation of Voter Model: Influential Nodes and Convergence Properties
di: Manohara, Abhiram, et al.
Pubblicazione: (2024)

Graph Neural Diffusion via Generalized Opinion Dynamics
di: Hevapathige, Asela, et al.
Pubblicazione: (2025)

Beyond Fixed Depth: Adaptive Graph Neural Networks for Node Classification Under Varying Homophily
di: Hevapathige, Asela, et al.
Pubblicazione: (2025)

Depth-Adaptive Graph Neural Networks via Learnable Bakry-'Emery Curvature
di: Hevapathige, Asela, et al.
Pubblicazione: (2025)

DeepSN: A Sheaf Neural Framework for Influence Maximization
di: Hevapathige, Asela, et al.
Pubblicazione: (2024)

Graph-based Fake Account Detection: A Survey
di: Dehkordi, Ali Safarpoor, et al.
Pubblicazione: (2025)

More Efficient Sybil Detection Mechanisms Leveraging Resistance of Users to Attack Requests
di: Dehkordi, Ali Safarpoor, et al.
Pubblicazione: (2025)

Random Walk in Random Permutation Set Theory
di: Zhou, Jiefeng, et al.
Pubblicazione: (2024)

Do Stubborn Users Always Cause More Polarization and Disagreement? A Mathematical Study
di: Shirzadi, Mohammad, et al.
Pubblicazione: (2024)

Revisiting Random Walks for Learning on Graphs
di: Kim, Jinwoo, et al.
Pubblicazione: (2024)

ScaleRTL: Scaling LLMs with Reasoning Data and Test-Time Compute for Accurate RTL Code Generation
di: Deng, Chenhui, et al.
Pubblicazione: (2025)

Linear $Q$-Learning Does Not Diverge in $L^2$: Convergence Rates to a Bounded Set
di: Liu, Xinyu, et al.
Pubblicazione: (2025)

Role Similarity Metric Based on Spanning Rooted Forest
di: Bao, Qi, et al.
Pubblicazione: (2021)

Dual-Phase Playtime-guided Recommendation: Interest Intensity Exploration and Multimodal Random Walks
di: Zhang, Jingmao, et al.
Pubblicazione: (2025)

ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
di: Zheng, Dehong, et al.
Pubblicazione: (2025)

Efficient Representations for High-Cardinality Categorical Variables in Machine Learning
di: Liang, Zixuan
Pubblicazione: (2025)

Graph Neural Networks with Feature and Structure Aware Random Walk
di: Zhuo, Wei, et al.
Pubblicazione: (2021)

Breadth-First Search vs. Restarting Random Walks for Escaping Uninformed Heuristic Regions
di: Platnick, Daniel, et al.
Pubblicazione: (2025)

Minimax Optimal and Computationally Efficient Algorithms for Distributionally Robust Offline Reinforcement Learning
di: Liu, Zhishuai, et al.
Pubblicazione: (2024)

Means of Hitting Times for Random Walks on Graphs: Connections, Computation, and Optimization
di: Xia, Haisong, et al.
Pubblicazione: (2024)

Finite Sample Analysis of Linear Temporal Difference Learning with Arbitrary Features
di: Xie, Zixuan, et al.
Pubblicazione: (2025)

Stochastic Streets: A Walk Through Random LLM Address Generation in four European Cities
di: Fu, Tairan, et al.
Pubblicazione: (2025)

Expected Runtime Comparisons Between Breadth-First Search and Constant-Depth Restarting Random Walks
di: Platnick, Daniel, et al.
Pubblicazione: (2024)

MathlibPR: Pull Request Merge-Readiness Benchmark for Formal Mathematical Libraries
di: Xie, Zixuan, et al.
Pubblicazione: (2026)

GeoEval: Benchmark for Evaluating LLMs and Multi-Modal Models on Geometry Problem-Solving
di: Zhang, Jiaxin, et al.
Pubblicazione: (2024)

On the Convergence of Monte Carlo UCB for Random-Length Episodic MDPs
di: Dong, Zixuan, et al.
Pubblicazione: (2022)

Optimal Foraging in Memory Retrieval: Evaluating Random Walks and Metropolis-Hastings Sampling in Modern Semantic Spaces
di: Moore, James
Pubblicazione: (2025)

DeepRWCap: Neural-Guided Random-Walk Capacitance Solver for IC Design
di: Rodriguez, Hector R., et al.
Pubblicazione: (2025)

Toward a Graph Foundation Model: Pre-Training Transformers With Random Walks
di: Tang, Ziyuan, et al.
Pubblicazione: (2025)

POEM: Explore Unexplored Reliable Samples to Enhance Test-Time Adaptation
di: Yi, Chang'an, et al.
Pubblicazione: (2025)

Evaluating Frontier LLMs on PhD-Level Mathematical Reasoning: A Benchmark on a Textbook in Theoretical Computer Science about Randomized Algorithms
di: Cao, Yang, et al.
Pubblicazione: (2025)

From Federated Learning to X-Learning: Breaking the Barriers of Decentrality Through Random Walks
di: Salihovic, Allan, et al.
Pubblicazione: (2025)

Opinion Dynamics: A Comprehensive Overview
di: Shirzadi, Mohammad, et al.
Pubblicazione: (2025)

A First Principles Approach to Trust-Based Recommendation Systems in Social Networks
di: Stefanopoulos, Paras, et al.
Pubblicazione: (2024)

OpenEgo: A Large-Scale Multimodal Egocentric Dataset for Dexterous Manipulation
di: Jawaid, Ahad, et al.
Pubblicazione: (2025)

AmoebaLLM: Constructing Any-Shape Large Language Models for Efficient and Instant Deployment
di: Fu, Yonggan, et al.
Pubblicazione: (2024)