8 citations · 11 across the 11 of their papers we have counts for
10 papers · 1 filter
Fast Estimation for Forest Matrix of Signed Graphs
Haoxin Sun, Zhongzhi Zhang
The forest matrix of a signed graph plays an important role in network science and social opinion dynamics, yet existing algorithms are mainly designed for unsigned graphs and are…
Fast Computation and Optimization for Opinion-Based Quantities of Friedkin-Johnsen Model
Haoxin Sun, Yubo Sun, Xiaotian Zhou +1
In this paper, we address the problem of fast computation and optimization of opinion-based quantities in the Friedkin-Johnsen (FJ) model. We first introduce the concept of partial…
Efficient Computation for Diagonal of Forest Matrix via Variance-Reduced Forest Sampling
Haoxin Sun, Zhongzhi Zhang
The forest matrix of a graph, particularly its diagonal elements, has far-reaching implications in network science and machine learning. The state-of-the-art algorithms for the dia…
Minimizing Total Biharmonic Distance in Large Graphs via Link Recommendation
Xinna Zhou, Zhongzhi Zhang
The total biharmonic distance, which is the sum of the biharmonic distance between every pair of nodes in a network, is a key metric for evaluating network connectivity and robustn…
Efficient Edge Rewiring Strategies for Enhancing PageRank Fairness
Changan Liu, Haoxin Sun, Ahad N. Zehmakan +1
We study the notion of unfairness in social networks, where a group such as females in a male-dominated industry are disadvantaged in access to important information, e.g. job post…
Efficient Algorithms for Relevant Quantities of Friedkin-Johnsen Opinion Dynamics Model
Gengyu Wang, Runze Zhang, Zhongzhi Zhang
Online social networks have become an integral part of modern society, profoundly influencing how individuals form and exchange opinions across diverse domains ranging from politic…
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.…
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…
Fast Computation for the Forest Matrix of an Evolving Graph
Haoxin Sun, Xiaotian Zhou, Zhongzhi Zhang
The forest matrix plays a crucial role in network science, opinion dynamics, and machine learning, offering deep insights into the structure of and dynamics on networks. In this pa…
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…