activity
20152019
most citedCurrent Flow Group Closeness Centrality for Complex Networks

46 citations · 163 across the 13 of their papers we have counts for

collaborators

14 papers

cs.LG2019★ 13 cited

Hermitian matrices for clustering directed graphs: insights and applications

Mihai Cucuringu, Huan Li, He Sun +1

Graph clustering is a basic technique in machine learning, and has widespread applications in different domains. While spectral techniques have been successfully applied for cluste…

cs.DS2018

Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem

Huan Li, He Sun, Luca Zanetti

We study spectral approaches for the MAX-2-LIN(k) problem, in which we are given a system of linear equations of the form , and required to find…

cs.DS2018

Spectral Subspace Sparsification

Huan Li, Aaron Schild

We introduce a new approach to spectral sparsification that approximates the quadratic form of the pseudoinverse of a graph Laplacian restricted to a subspace. We show that sparsif…

cs.DS2018★ 2 cited

Maximizing the Number of Spanning Trees in a Connected Graph

Huan Li, Stacy Patterson, Yuhao Yi +1

We study the problem of maximizing the number of spanning trees in a connected graph by adding at most edges from a given candidate edge set. We give both algorithmic and hardn…

cs.DS2018

Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket

Liren Shan, Huan Li, Zhongzhi Zhang

As a fundamental subject of theoretical computer science, the maximum independent set (MIS) problem not only is of purely theoretical interest, but also has found wide applications…

cs.DS2018★ 46 cited

Current Flow Group Closeness Centrality for Complex Networks

Huan Li, Richard Peng, Liren Shan +2

Current flow closeness centrality (CFCC) has a better discriminating ability than the ordinary closeness centrality based on shortest paths. In this paper, we extend this notion to…

eess.SY2017

Consensus in Self-similar Hierarchical Graphs and Sierpiński Graphs: Convergence Speed, Delay Robustness, and Coherence

Yi Qi, Zhongzhi Zhang, Yuhao Yi +1

The hierarchical graphs and Sierpiński graphs are constructed iteratively, which have the same number of vertices and edges at any iteration, but exhibit quite different structural…

cs.SI2017★ 1 cited

Extended corona product as an exactly tractable model for weighted heterogeneous networks

Yi Qi, Huan Li, Zhongzhi Zhang

Various graph products and operations have been widely used to construct complex networks with common properties of real-life systems. However, current works mainly focus on design…

cs.DM2017★ 17 cited

Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs

Yujia Jin, Huan Li, Zhongzhi Zhang

The Apollonian networks display the remarkable power-law and small-world properties as observed in most realistic networked systems. Their dual graphs are extended Tower of Hanoi g…

cs.DS2017★ 31 cited

Kirchhoff Index As a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms

Huan Li, Zhongzhi Zhang

Most previous work of centralities focuses on metrics of vertex importance and methods for identifying powerful vertices, while related work for edges is much lesser, especially fo…

cs.SI2017★ 14 cited

Effects of reciprocity on random walks in weighted networks

Zhongzhi Zhang, Huan Li, Yibin Sheng

It has been recently reported that the reciprocity of real-life weighted networks is very pronounced, however its impact on dynamical processes is poorly understood. In this paper,…

cs.SI2017★ 10 cited

Maximum matchings in scale-free networks with identical degree distribution

Huan Li, Zhongzhi Zhang

The size and number of maximum matchings in a network have found a large variety of applications in many fields. As a ubiquitous property of diverse real systems, power-law degree…

cs.SI2017★ 22 cited

Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph

Liren Shan, Huan Li, Zhongzhi Zhang

The minimum dominating set (MDS) problem is a fundamental subject of theoretical computer science, and has found vast applications in different areas, including sensor networks, pr…

cond-mat.soft2015★ 7 cited

Anomalous behavior of trapping in extended dendrimers with a perfect trap

Zhongzhi Zhang, Huan Li, Yuhao Yi

Compact and extended dendrimers are two important classes of dendritic polymers. The impact of the underlying structure of compact dendrimers on dynamical processes has been much s…