Dan Chen

Dan Chen

Auto-generated profile, based on publicly available information

Dan Chen

School of Mathematics and Statistics, Research Center of Nonlinear Science, Wuhan Textile University, Wuhan, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 June 2023 in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
Verified
Journal Article
Closed access
DCDan Chen
Dan Chen
HSHousheng Su
Housheng Su
Identifying influential nodes in complex networks is vital for understanding their structure and dynamic behavior. Although methods based on a single characteristic of nodes have been demonstrated to be effective in specific scenarios, the information they provide in dealing with the global aspect of the network is often limited or incomplete. In this paper, we present a measure that combines the degree and the average neighbor degree to evaluate the influence of nodes. As a supplement, we also propose the corresponding gravity index. Experiments on synthetic and real-world networks show that the method proposed in this paper is superior to previous methods based on the single characteristic of nodes in most scenarios. Our gravity strategy is also highly competitive compared with the current famous gravity method.

31 July 2018 in Physical Review E
Verified
Journal Article
Closed access
PDF file
DCDan Chen
Dan Chen
DSDan-Dan Shi
Dan-Dan Shi
MQMi Qin
Mi Qin
SXSi-Meng Xu
Si-Meng Xu
GPGui-Jun Pan
Gui-Jun Pan
Identification and quantification of the structural dissimilarities between complex networks is a very important and challenging problem in network science. A simple and efficient way to quantify network differences remains unexplored. Although the methods for network comparison based on the probability distribution of a network descriptor have been shown to be effective for specific purposes, the information they provide is often limited or incomplete. In order to overcome the defect of the methods, here we use the communicability between two nodes to define the communicability sequence entropy of networks, and on the basis of this entropy measure, we propose a Jensen-Shannon divergence of two networks which can be used as natural distance measure between complex networks. By the extensive experiments, we find that the measure can accurately quantify the structural dissimilarities between synthetic networks. Most importantly, the measure can be able to identify the critical percolation probability of the random network in the evolution process, and it can also effectively guide us to choose a more suitable model to simulate real systems.

5 May 2022 in Journal of Drug Delivery Science and Technology
Verified
Journal Article
Closed access
LTLiwei Tian
Liwei Tian
DLDan Luo
Dan Luo
DCDan Chen
Dan Chen
Hong ZhouHong Zhou
Hong Zhou
XZXin-Chao Zhang
Xin-Chao Zhang
WLWei Liu
Wei Liu

10 September 2021 in Physical Review E
Verified
Journal Article
Closed access
PDF file
DCDan Chen
Dan Chen
HSHousheng Su
Housheng Su
XWXiaofan Wang
Xiaofan Wang
GPGui-Jun Pan
Gui-Jun Pan
GCGuanrong Chen
Guanrong Chen
Some characteristics of complex networks need to be derived from global knowledge of the network topologies, which challenges the practice for studying many large-scale real-world networks. Recently, the geometric renormalization technique has provided a good approximation framework to significantly reduce the size and complexity of a network while retaining its “slow” degrees of freedom. However, due to the finite-size effect of real networks, excessive renormalization iterations will eventually cause these important “slow” degrees of freedom to be filtered out. In this paper, we systematically investigate the finite-size scaling of structural and dynamical observables in geometric renormalization flows of both synthetic and real evolutionary networks. Our results show that these observables can be well characterized by a certain scaling function. Specifically, we show that the critical exponent implied by the scaling function is independent of these observables but depends only on the structural properties of the network. To a certain extent, the results of this paper are of great significance for predicting the observable quantities of large-scale real systems and further suggest that the potential scale invariance of many real-world networks is often masked by finite-size effects.

1 July 2020 in Information Sciences
Verified
Journal Article
Closed access
DCDan Chen
Dan Chen
HSHousheng Su
Housheng Su
GPGui-Jun Pan
Gui-Jun Pan

23 April 2020 in Physical Review E
Verified
Journal Article
Closed access
PDF file
DSDan-Dan Shi
Dan-Dan Shi
DCDan Chen
Dan Chen
GPGui-Jun Pan
Gui-Jun Pan
Characterizing the structural complexity of networks is a major challenging work in network science. However, a valid measure to quantify network complexity remains unexplored. Although the entropy of various network descriptors and algorithmic complexity have been selected in the previous studies to do it, most of these methods only contain local information of the network, so they cannot accurately reflect the global structural complexity of the network. In this paper, we propose a statistical measure to characterize network complexity from a global perspective, which is composed of the communicability sequence entropy of the network and the associated Jensen-Shannon divergence. We study the influences of the topology of the synthetic networks on the complexity measure. The results show that networks with strong heterogeneity, strong degree-degree correlation, and a certain number of communities have a relatively large complexity. Moreover, by studying some real networks and their corresponding randomized network models, we find that the complexity measure is a monotone increasing function of the order of the randomized network, and the ones of real networks are larger complexity-values compared to all corresponding randomized networks. These results indicate that the complexity measure is sensitive to the changes of the basic topology of the network and increases with the increase of the external constraints of the network, which further proves that the complexity measure presented in this paper can effectively represent the topological complexity of the network.