Means of Hitting Times for Random Walks on Graphs: Connections, Computation, and Optimization
Fuente:
arXiv
Saved in:
| Main Authors: | Xia, Haisong, Xu, Wanyue, Zhang, Zuobai, Zhang, Zhongzhi |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Fast Computation of Kemeny's Constant for Directed Graphs
by: Xia, Haisong, et al.
Published: (2024)
by: Xia, Haisong, et al.
Published: (2024)
Opinion Dynamics Incorporating Higher-Order Interactions
by: Zhang, Zuobai, et al.
Published: (2021)
by: Zhang, Zuobai, et al.
Published: (2021)
Fast Maximization of Current Flow Group Closeness Centrality
by: Xia, Haisong, et al.
Published: (2025)
by: Xia, Haisong, et al.
Published: (2025)
Behavior and Sublinear Algorithm for Opinion Disagreement on Noisy Social Networks
by: Xu, Wanyue, et al.
Published: (2026)
by: Xu, Wanyue, et al.
Published: (2026)
ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
by: Zheng, Dehong, et al.
Published: (2025)
by: Zheng, Dehong, et al.
Published: (2025)
Friedkin-Johnsen Model for Opinion Dynamics on Signed Graphs
by: Zhou, Xiaotian, et al.
Published: (2024)
by: Zhou, Xiaotian, et al.
Published: (2024)
Fast Computation for the Forest Matrix of an Evolving Graph
by: Sun, Haoxin, et al.
Published: (2024)
by: Sun, Haoxin, et al.
Published: (2024)
Dynamic Graph Embedding Through Hub-aware Random Walks
by: Tomčić, Aleksandar, et al.
Published: (2025)
by: Tomčić, Aleksandar, et al.
Published: (2025)
Estimation of Graph Features Based on Random Walks Using Neighbors' Properties
by: Hasegawa, Tsuyoshi, et al.
Published: (2024)
by: Hasegawa, Tsuyoshi, et al.
Published: (2024)
Fast Query of Biharmonic Distance in Networks
by: Liu, Changan, et al.
Published: (2024)
by: Liu, Changan, et al.
Published: (2024)
Efficient Algorithms for Relevant Quantities of Friedkin-Johnsen Opinion Dynamics Model
by: Wang, Gengyu, et al.
Published: (2025)
by: Wang, Gengyu, et al.
Published: (2025)
Random Walk Diffusion for Efficient Large-Scale Graph Generation
by: Bernecker, Tobias, et al.
Published: (2024)
by: Bernecker, Tobias, et al.
Published: (2024)
Hub-aware Random Walk Graph Embedding Methods for Classification
by: Tomčić, Aleksandar, et al.
Published: (2022)
by: Tomčić, Aleksandar, et al.
Published: (2022)
Opinion Maximization in Social Networks by Modifying Internal Opinions
by: Wang, Gengyu, et al.
Published: (2025)
by: Wang, Gengyu, et al.
Published: (2025)
Role Similarity Metric Based on Spanning Rooted Forest
by: Bao, Qi, et al.
Published: (2021)
by: Bao, Qi, et al.
Published: (2021)
dyGRASS: Dynamic Spectral Graph Sparsification via Localized Random Walks on GPUs
by: Yuan, Yihang, et al.
Published: (2025)
by: Yuan, Yihang, et al.
Published: (2025)
Examining Platformization in Cultural Production: A Comparative Computational Analysis of Hit Songs on TikTok and Spotify
by: Ta, Na, et al.
Published: (2024)
by: Ta, Na, et al.
Published: (2024)
Community Search in Attributed Networks using Dominance Relationships and Random Walks
by: Georgiadis, Nikolaos, et al.
Published: (2025)
by: Georgiadis, Nikolaos, et al.
Published: (2025)
IRWE: Inductive Random Walk for Joint Inference of Identity and Position Network Embedding
by: Qin, Meng, et al.
Published: (2024)
by: Qin, Meng, et al.
Published: (2024)
Frustrated Random Walks: A Fast Method to Compute Node Distances on Hypergraphs
by: Li, Enzhi, et al.
Published: (2024)
by: Li, Enzhi, et al.
Published: (2024)
Hierarchical Cutting of Complex Networks Performed by Random Walks
by: Benatti, Alexandre, et al.
Published: (2024)
by: Benatti, Alexandre, et al.
Published: (2024)
Efficient Edge Rewiring Strategies for Enhancing PageRank Fairness
by: Liu, Changan, et al.
Published: (2026)
by: Liu, Changan, et al.
Published: (2026)
Promoting Fairness in Information Access within Social Networks
by: Liu, Changan, et al.
Published: (2025)
by: Liu, Changan, et al.
Published: (2025)
On Balancing Sparsity with Reliable Connectivity in Distributed Network Design with Random K-out Graphs
by: Sood, Mansi, et al.
Published: (2025)
by: Sood, Mansi, et al.
Published: (2025)
Random Walk with Memory on Complex Networks
by: Basnarkov, Lasko, et al.
Published: (2019)
by: Basnarkov, Lasko, et al.
Published: (2019)
Less is More: Simple yet Effective Heuristic Community Detection with Graph Convolution Network
by: Wang, Hong, et al.
Published: (2025)
by: Wang, Hong, et al.
Published: (2025)
Two Layer Walk: A Community-Aware Graph Embedding
by: Yu, He, et al.
Published: (2024)
by: Yu, He, et al.
Published: (2024)
Random Graph Modeling: A survey of the concepts
by: Drobyshevskiy, Mikhail, et al.
Published: (2024)
by: Drobyshevskiy, Mikhail, et al.
Published: (2024)
Leveraging Non-linear Dimension Reduction and Random Walk Co-occurrence for Node Embedding
by: DeWolfe, Ryan
Published: (2026)
by: DeWolfe, Ryan
Published: (2026)
Powers of Magnetic Graph Matrix: Fourier Spectrum, Walk Compression, and Applications
by: Huang, Yinan, et al.
Published: (2025)
by: Huang, Yinan, et al.
Published: (2025)
Connected Theorems: A Graph-Based Approach to Evaluating Mathematical Results
by: Bérczi, Gergely, et al.
Published: (2025)
by: Bérczi, Gergely, et al.
Published: (2025)
Sampling Random Graphs from the Colored Configuration Model
by: Pellegrina, Leonardo
Published: (2026)
by: Pellegrina, Leonardo
Published: (2026)
Line Graph Neural Networks for Link Weight Prediction
by: Liang, Jinbi, et al.
Published: (2023)
by: Liang, Jinbi, et al.
Published: (2023)
Beyond Connectivity: Higher-Order Network Framework for Capturing Memory-Driven Mobility Dynamics
by: Zhang, Chen, et al.
Published: (2025)
by: Zhang, Chen, et al.
Published: (2025)
Strong and Weak Random Walks on Signed Networks
by: Babul, Shazia'Ayn, et al.
Published: (2024)
by: Babul, Shazia'Ayn, et al.
Published: (2024)
Recurrent Attention Walk for Semi-supervised Classification
by: Akujuobi, Uchenna, et al.
Published: (2019)
by: Akujuobi, Uchenna, et al.
Published: (2019)
Exact Label Recovery in Euclidean Random Graphs
by: Gaudio, Julia, et al.
Published: (2024)
by: Gaudio, Julia, et al.
Published: (2024)
The Diameter of (Threshold) Geometric Inhomogeneous Random Graphs
by: Benjert, Zylan, et al.
Published: (2025)
by: Benjert, Zylan, et al.
Published: (2025)
Bures-Wasserstein Means of Graphs
by: Haasler, Isabel, et al.
Published: (2023)
by: Haasler, Isabel, et al.
Published: (2023)
On the Graph Theory of Majority Illusions: Theoretical Results and Computational Experiments
by: Los, Maaike, et al.
Published: (2023)
by: Los, Maaike, et al.
Published: (2023)
Similar Items
-
Fast Computation of Kemeny's Constant for Directed Graphs
by: Xia, Haisong, et al.
Published: (2024) -
Opinion Dynamics Incorporating Higher-Order Interactions
by: Zhang, Zuobai, et al.
Published: (2021) -
Fast Maximization of Current Flow Group Closeness Centrality
by: Xia, Haisong, et al.
Published: (2025) -
Behavior and Sublinear Algorithm for Opinion Disagreement on Noisy Social Networks
by: Xu, Wanyue, et al.
Published: (2026) -
ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
by: Zheng, Dehong, et al.
Published: (2025)