10 citations · 11 across the 3 of their papers we have counts for
3 papers
cond-mat.stat-mech2022★ 10 cited
Universal cover-time distribution of heterogeneous random walks
Jia-Qi Dong, Wen-Hui Han, Yisen Wang +2
The cover-time problem, i.e., time to visit every site in a system, is one of the key issues of random walks with wide applications in natural, social, and engineered systems. Addr…
physics.soc-ph2017
Statistical properties of random clique networks
Yi-Min Ding, Jun Meng, Jing-Fang Fan +2
In this paper, a random clique network model to mimic the large clustering coefficient and the modular structure that exist in many real complex networks, such as social networks,…
cs.SI2014★ 1 cited
Hybrid evolving clique-networks and their communicability
Yimin Ding, Bin Zhou, Xiaosong Chen
Aiming to understand real-world hierarchical networks whose degree distributions are neither power law nor exponential, we construct a hybrid clique network that includes both homo…