20 citations · 70 across the 17 of their papers we have counts for
7 papers · 1 filter
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,…
An extremal problem: How small scale-free graph can be
Fei Ma, Ping Wang, Bing Yao
The bloom of complex network study, in particular, with respect to scale-free ones, is considerably triggering the research of scale-free graph itself. Therefore, a great number of…
Determining Geodesic Distance on Arbitrary-order Subdivision of Tree with Applications
Fei Ma, Xiaomin Wang, Ping Wang
The problem of how to estimate diffusion on a graph effectively is of importance both theoretically and practically. In this paper, we make use of two widely studied indices, geode…
A Method for Geodesic Distance on Subdivision of Trees with Arbitrary Orders and Their Applications
Fei Ma, Ping Wang, Xudong Luo
Geodesic distance, sometimes called shortest path length, has proven useful in a great variety of applications, such as information retrieval on networks including treelike network…
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…
An ensemble of random graphs with identical degree distribution
Fei Ma, Xiaoming Wang, Ping Wang
Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with whic…