activity
20052023
most citedExact solution for mean first-passage time on a pseudofractal scale-free web

120 citations · 3.6k across the 135 of their papers we have counts for

collaborators

135 papers

cs.SI2023

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…

cs.CY2023★ 2 cited

Minimizing Polarization in Noisy Leader-Follower Opinion Dynamics

Wanyue Xu, Zhongzhi Zhang

The operation of creating edges has been widely applied to optimize relevant quantities of opinion dynamics. In this paper, we consider a problem of polarization optimization for t…

cs.SI2023

Opinion Optimization in Directed Social Networks

Haoxin Sun, Zhongzhi Zhang

Shifting social opinions has far-reaching implications in various aspects, such as public health campaigns, product marketing, and political candidates. In this paper, we study a p…

cs.SI2023★ 8 cited

Measures and Optimization for Robustness and Vulnerability in Disconnected Networks

Liwang Zhu, Qi Bao, Zhongzhi Zhang

The function or performance of a network is strongly dependent on its robustness, quantifying the ability of the network to continue functioning under perturbations. While a wide v…

cs.SI2023★ 8 cited

Optimal Scale-Free Small-World Graphs with Minimum Scaling of Cover Time

Wanyue Xu, Zhongzhi Zhang

The cover time of random walks on a graph has found wide practical applications in different fields of computer science, such as crawling and searching on the World Wide Web and qu…

cs.NI2023

Resistance Distances in Directed Graphs: Definitions, Properties, and Applications

Mingzhe Zhu, Liwang Zhu, Huan Li +2

Resistance distance has been studied extensively in the past years, with the majority of previous studies devoted to undirected networks, in spite of the fact that various realisti…