activity
20022025
most citedLink Prediction in Complex Networks: A Survey

2.9k citations · 7.8k across the 99 of their papers we have counts for

collaborators

102 papers

eess.SY2025

Perturbation-Based Pinning Control Strategy for Enhanced Synchronization in Complex Networks

Ziang Mao, Tianlong Fan, Linyuan Lü

Synchronization is essential for the stability and coordinated operation of complex networked systems. Pinning control, which selectively controls a subset of nodes, provides a sca…

cs.SI2024

Modeling Emotional Dynamics in Social Networks: Uncovering the Positive Role of Information Cocoons in Group Emotional Stabilization

Jinhu Ren, Xifei Fu, Tianlong Fan +1

Information cocooning-amplified by algorithmic filtering-poses complex challenges for emotional dynamics in online social networks. This study explores how algorithmically reinforc…

cs.SI2023★ 1 cited

Identifying vital nodes through augmented random walks on higher-order networks

Yujie Zeng, Yiming Huang, Xiao-Long Ren +1

Empirical networks possess considerable heterogeneity of node connections, resulting in a small portion of nodes playing crucial roles in network structure and function. Yet, how t…

math.OC2023

Optimal Ricci curvature Markov chain Monte Carlo methods on finite states

Wuchen Li, Linyuan Lu

We construct a new Markov chain Monte Carlo method on finite states with optimal choices of acceptance-rejection ratio functions. We prove that the constructed continuous time Mark…

math.CO2022★ 1 cited

Maximum spread of -minor-free graphs

William Linz, Linyuan Lu, Zhiyu Wang

The spread of a graph is the difference between the largest and smallest eigenvalues of the adjacency matrix of . In this paper, we consider the family of graphs which conta…

math.CO2022

On the maximum spread of planar and outerplanar graphs

Zelong Li, William Linz, Linyuan Lu +1

The spread of a graph is the difference between the largest and smallest eigenvalue of the adjacency matrix of . Gotshall, O'Brien and Tait conjectured that for sufficiently…