activity
20222026
most citedEfficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges

7 citations · 8 across the 6 of their papers we have counts for

collaborators

7 papers

cs.SI2026

ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks

Dehong Zheng, Zhongzhi Zhang

The biharmonic distance is a fundamental metric on graphs that measures the dissimilarity between two nodes, capturing both local and global structures. It has found applications a…

cs.SI2025

Opinion Maximization in Social Networks by Modifying Internal Opinions

Gengyu Wang, Runze Zhang, Zhongzhi Zhang

Public opinion governance in social networks is critical for public health campaigns, political elections, and commercial marketing. In this paper, we addresse the problem of maxim…

cs.DM2025★ 7 cited

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…

cs.SI2024

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…

cs.SI2023★ 1 cited

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…

cs.MA2023

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…