The clustering coefficient, path length and average vertex degree of two urban train line networks have been calculated. The results are compared with theoretical predictions for appropriate random bipartite graphs. They have also been compared with one another to investigate the effect of...

This paper proposes how to build a syntactic network based on syntactic theory and presents some statistical properties of Chinese syntactic dependency networks based on two Chinese treebanks with different genres. The results show that the two syntactic networks are small-world networks, and...

In this paper, we studied the research areas of Chinese natural science basic research from a point view of complex network. Two research areas are considered to be connected if they appear in one fund proposal. The explicit network of such connections using data from 1999 to 2004 is...

Many real-world networks display natural bipartite structure, where the basic cycle is a square. In this paper, with the similar consideration of standard clustering coefficient in binary networks, a definition of the clustering coefficient for bipartite networks based on the fraction of squares...

We study the effects of spatial structures other than the degree distribution on the extent of the emergence of cooperation in an evolutionary snowdrift game. By swapping the links in three different types of regular lattices with a fixed degree k, we study how the frequency of cooperator fC...

Discoveries of the scale-free and small-world features are reported on the network constructed from the seismic data. It is shown that the connectivity distribution decays as a power law, and the value of the degrees of separation, i.e., the characteristic path length, between two earthquakes...

In present paper, we propose a highly clustered weighted network model that incorporates the addition of a new node with some links, new links between existing nodes and the edge's weight dynamical evolution based on weight-dependent walks at each time step. The analytical approach and numerical...

In this work, we analyze gossip spreading on weighted networks. We try to define a new metric to classify weighted complex networks using our model. The model proposed here is based on the gossip spreading model introduced by Lind et al. on unweighted networks. The new metric is based on gossip...

Agents involved in the formation of a social or economic network typically face uncertainty about the benefits of creating a link. However, the interplay of such uncertainty and risk attitudes has been neglected in the network formation literature. We propose a dynamic network formation model...

Social networks generally display a positively skewed degree distribution and higher values for clustering coefficient and degree assortativity than would be expected from the degree sequence. For some types of simulation studies, these properties need to be varied in the artificial networks...