Among alignment-free methods for sequence comparison, the model of k-word frequencies is a well-developed one. However, most existing word-based methods neglect relationships among k-word frequencies, while a few others focus on the correlation of k-words but ignore the word frequency itself. In...

This paper introduces a new concept of least community that is as homogeneous as a random graph, and develops a new community detection algorithm from the perspective of homogeneity or heterogeneity. Based on this concept, we adopt head/tail breaks–a newly developed classification scheme for...

This paper aims to measure the efficiency of urban street networks (a kind of complex networks) from the perspective of the multidimensional chain of connectivity (or flow). More specifically, we define two quantities: flow dimension and flow capacity, to characterize structures of urban street...

In this paper, we derive a topological pattern of urban street networks using a large sample (the largest so far to the best of our knowledge) of 40 US cities and a few more from elsewhere of different sizes. It is found that all the topologies of urban street networks based on street–street...

From a complex network perspective, this study sets out two aims around the US airport network (USAN) which is built from en-route location information of domestic flights in the US. First, we analyze the structural properties of the USAN with respect to its binary and weighted graphs, and...