activity
20212024
most citedCombinatorial Properties for a Class of Simplicial Complexes Extended from Pseudo-fractal Scale-free Web

2 citations · 4 across the 5 of their papers we have counts for

collaborators

5 papers

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.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…

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…

math.CO2023★ 2 cited

Combinatorial Properties for a Class of Simplicial Complexes Extended from Pseudo-fractal Scale-free Web

Zixuan Xie, Yucheng Wang, Wanyue Xu +3

Simplicial complexes are a popular tool used to model higher-order interactions between elements of complex social and biological systems. In this paper, we study some combinatoria…

cs.IT2021★ 2 cited

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…