20 citations · 70 across the 17 of their papers we have counts for
5 papers · 1 filter
Mean Hitting Time on Recursive Growth Tree Network
Fei Ma, Ping Wang
In this paper, we are concerned with mean hitting time for random walks on recursive growth tree networks that are built based on an arbitrary tree as t…
Scale-free tree network with an ultra-large diameter
Fei Ma, Ping Wang
Scale-free networks are prevalently observed in a great variety of complex systems, which triggers various researches relevant to networked models of such type. In this work, we pr…
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…