The specific Gibbs free energy has been calculated for the infinite range Ising model with fixed and finite interaction strength. The model shows a temperature driven first-order phase transition that differs from the infinite ranged Ising model with weak coupling. In the temperature-field phase...

In this paper, we study two models of network evolution and give more realistic descriptions of the local processes than Barabási–Albert model, incorporating the addition of new nodes, the addition of new links, the rewiring and deleting of links. To random networks model with single (or...

The study of random graphs has become very popular for real-life network modeling, such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice Zd, d Ï 1, is a particular attractive example of a random graph model because it...

The study of random graphs has become very popular for real-life network modeling, such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice Zd, d ≥ 1, is a particular attractive example of a random graph model because it...

Futures trading is the core of futures business, and it is considered as one of the typical complex systems. To investigate the complexity of futures trading, we employ the analytical method of complex networks. First, we use real trading records from the Shanghai Futures Exchange to construct...

In this paper, a model of ultimatum game is discussed from the coevolutionary perspective, where strategy dynamics and structure dynamics coexist. The interplay between structure dynamics and strategy dynamics leads to overwhelmingly interesting evolved topology and fairness behaviors. It is...

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...

The study of random graphs has become very popular for real-life network modeling, such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice Z^d, d ≥ 1, is a particular attractive example of a random graph model because it...

We show that the structure of a growing tree preserves an information on the shape of an initial graph. For the exponential trees, evidence of this kind of memory is provided by means of the iterative equations, derived for the moments of the node–node distance distribution. Numerical...