3 papers
cs.SI2025
Fast Maximization of Current Flow Group Closeness Centrality
Haisong Xia, Zhongzhi Zhang
Derived from effective resistances, the current flow closeness centrality (CFCC) for a group of nodes measures the importance of node groups in an undirected graph with nodes.…
cs.SI2024
Means of Hitting Times for Random Walks on Graphs: Connections, Computation, and Optimization
Haisong Xia, Wanyue Xu, Zuobai Zhang +1
For random walks on graph with vertices and edges, the mean hitting time from a vertex chosen from the stationary distribution to vertex measures th…
cs.SI2024
Fast Computation of Kemeny's Constant for Directed Graphs
Haisong Xia, Zhongzhi Zhang
Kemeny's constant for random walks on a graph is defined as the mean hitting time from one node to another selected randomly according to the stationary distribution. It has found…