17 citations · 27 across the 11 of their papers we have counts for
12 papers
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…
Promoting Fairness in Information Access within Social Networks
Changan Liu, Xiaotian Zhou, Ahad N. Zehmakan +1
The advent of online social networks has facilitated fast and wide spread of information. However, some users, especially members of minority groups, may be less likely to receive…
Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges
Xiaotian Zhou, Ahad N. Zehmakan, Zhongzhi Zhang
The Kirchhoff index, which is the sum of the resistance distance between every pair of nodes in a network, is a key metric for gauging network performance, where lower values signi…
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…
Friedkin-Johnsen Model for Opinion Dynamics on Signed Graphs
Xiaotian Zhou, Haoxin Sun, Wanyue Xu +2
A signed graph offers richer information than an unsigned graph, since it describes both collaborative and competitive relationships in social networks. In this paper, we study opi…
Viral Marketing in Social Networks with Competing Products
Ahad N. Zehmakan, Xiaotian Zhou, Zhongzhi Zhang
Consider a directed network where each node is either red (using the red product), blue (using the blue product), or uncolored (undecided). Then in each round, an uncolored node ch…
Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition
Xiaotian Zhou, Haoxin Sun, Wei Li +1
The grounded Laplacian matrix $\LL_{-S}$ of a graph $\calG=(V,E)$ with nodes and edges is a submatrix of its Laplacian matrix $\LL$, obtained fr…
A Fast Algorithm for Moderating Critical Nodes via Edge Removal
Changan Liu, Xiaotian Zhou, Ahad N. Zehmakan +1
Critical nodes in networks are extremely vulnerable to malicious attacks to trigger negative cascading events such as the spread of misinformation and diseases. Therefore, effectiv…
Maximizing the Smallest Eigenvalue of Grounded Laplacian Matrix
Run Wang, Xiaotian Zhou, Wei Li +1
For a connected graph with nodes, edges, and Laplacian matrix , a grounded Laplacian matrix of $\m…
Maximizing Influence of Leaders in Social Networks
Xiaotian Zhou, Zhongzhi Zhang
The operation of adding edges has been frequently used to the study of opinion dynamics in social networks for various purposes. In this paper, we consider the edge addition proble…
Edge Domination Number and the Number of Minimum Edge Dominating Sets in Pseudofractal Scale-Free Web and Sierpiński Gasket
Xiaotian Zhou, Zhongzhi Zhang
As a fundamental research object, the minimum edge dominating set (MEDS) problem is of both theoretical and practical interest. However, determining the size of a MEDS and the numb…
Some Combinatorial Problems in Power-law Graphs
Jiang Che, Xu Wanyue, Zhou Xiaotian +2
The power-law behavior is ubiquitous in a majority of real-world networks, and it was shown to have a strong effect on various combinatorial, structural, and dynamical properties o…