10 citations · 16 across the 10 of their papers we have counts for
Showing cs.SIShow all
3 papers · 1 filter
cs.SI2020
Counterexample: scale-free networked graphs with invariable diameter and density feature
Fei Ma, Xiaomin Wang, Ping Wang
Here, we propose a class of scale-free networks with some intriguing properties, which can not be simultaneously held by all the theoretical models with power-law degree d…
cs.SI2019
Dense networks with scale-free feature
Fei Ma, Xiaomin Wang, Ping Wang +1
While previous works have shown that an overwhelming number of scale-free networks are sparse, there still exist some real-world networks including social networks, urban networks,…
cs.SI2019★ 2 cited
Handshake between Fibonacci series and pure preferential attachment mechanism on a graph-model
Fei Ma, Ding Wang, Ping Wang +1
In order to better understand dynamical functions on amounts of natural and man-made complex systems, lots of researchers from a wide range of disciplines, covering statistic physi…