activity
20042021
most citedTotally Homogeneous Networks

53 citations · 83 across the 12 of their papers we have counts for

collaborators

12 papers

cs.NE2021★ 2 cited

Computing Cliques and Cavities in Networks

Dinghua Shi, Zhifeng Chen, Xiang Sun +4

Complex networks contain complete subgraphs such as nodes, edges, triangles, etc., referred to as simplices and cliques of different orders. Notably, cavities consisting of higher-…

physics.soc-ph2020★ 6 cited

Characterizing cycle structure in complex networks

Tianlong Fan, Linyuan Lü, Dinghua Shi +1

Cycle is the simplest structure that brings redundant paths in network connectivity and feedback effects in network dynamics. Focusing on cycle structure, this paper defines a new…

physics.soc-ph2019★ 6 cited

Towards the cycle structures in complex network: A new perspective

Tianlong Fan, Linyuan Lü, Dinghua Shi

Stars and cycles are basic structures in network construction. The former has been well studied in network analysis, while the latter attracted rare attention. A node together with…

cs.SI2019★ 53 cited

Totally Homogeneous Networks

Dinghua Shi, Linyuan Lü, Guanrong Chen

In network science, the non-homogeneity of node degrees has been a concerned issue for study. Yet, with the modern web technologies today, the traditional social communication topo…

math-ph2009

Degree-distribution Stability of Evolving Networks

Zhenting Hou, Xiangxing Kong, Dinghua Shi +2

In this paper, we study a class of stochastic processes, called evolving network Markov chains, in evolving networks. Our approach is to transform the degree distribution problem o…

math-ph2008★ 3 cited

Degree-distribution Stability of Growing Networks

Zhenting Hou, Xiangxing Kong, Dinghua Shi +2

In this paper, we abstract a kind of stochastic processes from evolving processes of growing networks, this process is called growing network Markov chains. Thus the existence and…