International Journal of Modern Physics C

Correction of observed multiplicity distributions by a method based on the maximum entropy principle reduces to a combinatorial optimization problem, where one has to determine a combination of parameters which would minimize a given (cost) function. We use a stochastic algorithm, i.e. an annealed version of the microcanonical algorithm to minimize this function. This algorithm yields results which are compatible with those from simulated annealing method.

In the Vicsek Model (VM), self-driven individuals try to adopt the direction of movement of their neighbors under the influence of noise, thus leading to a noise-driven order–disorder phase transition. By implementing the so-called Vectorial Noise (VN) variant of the VM (i.e. the VM-VN model), this phase transition has been shown to be discontinuous (first-order). In this paper, we perform an extensive complex network study of VM-VN flocks and show that their topology can be described as highly clustered, assortative, and nonhierarchical. We also study the behavior of the VM-VN model in the case of "frozen flocks" in which, after the flocks are formed using the full dynamics, particle displacements are suppressed (i.e. only rotations are allowed). Under this kind of restricted dynamics, we show that VM-VN flocks are unable to support the ordered phase. Therefore, we conclude that the particle displacements at every time-step in the VM-VN dynamics are a key element needed to sustain long-range ordering throughout.

Some tiny party of influential nodes may highly affect spread of information in complex networks. For the case of very high time complexity in the shortest path computation of global centralities, making use of local community centrality to identify influential nodes is an open and possible problem. Compared to degree and local centralities, a five-heartbeat forward community centrality is proposed in this paper, in which a five-step induced sub-graph of certain node in the network will be achieved. Next, we induce the minimal spanning tree (MMT) of the sub-graph. Finally, we take the sum of all weights of the MMT as community centrality measurement that needs to be the influential ranking of the node. We use the susceptible, infected and recovered (SIR) model to evaluate the performance of this method on several public test network data and explore the forward steps of community centrality by experiments. Simulative results show that our method with five steps can identify the influential ranking of nodes in complex network as well.

In this paper, we obtain exact scalings of mean first-passage time (MFPT) of random walks on a family of small-world treelike networks formed by two parameters, which includes three kinds. First, we determine the MFPT for a trapping problem with an immobile trap located at the initial node, which is defined as the average of the first-passage times (FPTs) to the trap node over all possible starting nodes, and it scales linearly with network size N in large networks. We then analytically obtain the partial MFPT (PMFPT) which is the mean of FPTs from the trap node to all other nodes and show that it increases with N as N ln N. Finally we establish the global MFPT (GMFPT), which is the average of FPTs over all pairs of nodes. It also grows with N as N ln N in the large limit of N. For these three kinds of random walks, we all obtain the analytical expressions of the MFPT and they all increase with network parameters. In addition, our method for calculating the MFPT is based on the self-similar structure of the considered networks and avoids the calculations of the Laplacian spectra.

An elementary cellular automaton (ECA) is a one-dimensional, synchronous, binary automaton, where each cell update depends on its own state and states of its two closest neighbors. We attempt to uncover correlations between the following measures of ECA behavior: compressibility, sensitivity and diversity. The compressibility of ECA configurations is calculated using the Lempel–Ziv (LZ) compression algorithm LZ78. The sensitivity of ECA rules to initial conditions and perturbations is evaluated using Derrida coefficients. The generative morphological diversity shows how many different neighborhood states are produced from a single nonquiescent cell. We found no significant correlation between sensitivity and compressibility. There is a substantial correlation between generative diversity and compressibility. Using sensitivity, compressibility and diversity, we uncover and characterize novel groupings of rules.

In this paper, we present a cellular automaton (CA) simulation of a signalized intersection. When there is no exclusive lane for left-turn vehicles, through vehicles and left-turn vehicles have to share one lane. Under such situation usually two-phase signalization is adopted, and the conflicts between the two traffic streams need to be analyzed. We use a refined configuration for the intersection simulation: the geometry of the intersection has been considered and vehicles are assumed to move along 1/4 circle arcs. We focus on the averaged travel times on left lanes and their distributions. The diagrams of intersection approach capacities (IACs) and the corresponding phase diagrams are also presented, which depend on the approach flow rates and the percentage of left-turn vehicles. Besides, we find that the minimum green time could be determined by finding out the critical value for the travel times.

The methodology of open-plus-close-loop (OPCL), which is up till now mainly used for the case of ordinary dynamical systems is extended for the first time to the case of delay dynamical process, to achieve complete, lag synchronization. Both the one and two way couplings are examined in detail, with the help of delay logistics, Ikeda and Mackey–Glass system. Robustness of the process is exhibited when the same analysis is done in presence of Gaussian noise. Influence of the strength of such a noise is shown. Our procedure opens up a potentially new approach for the synchronization study of delay dynamical systems.

In this paper, the 2D fluid flow pass a heated/cooled square cylinder exposed to a constant free-stream upward velocity is simulated via a multiple relaxation time (MRT) lattice-Boltzmann (LB) method. The buoyancy effect on the drag and lift coefficients as well as Nusselt number related is compared with the results in the existing literatures to validate the code used. The effect of temperature-viscosity dependence is then investigated to test whether the effect can be neglected or not for the mixed convection case. It is shown that the effect cannot be ignored when |Ri| > 0.15. Fortunately, the effect can be captured by using an effective temperature formula [J. M. Shi, D. Ferlach, M. Breuer, G. Biswas and F. Durst, Phys. Fluids16, 4331 (2004)] in a rather large range of Ri. All the numerical results, from another angle, also demonstrate that the MRT method is an efficient tool in simulating the problems such as the present one.

Considering the time lag produced by the transmission in chaos-communication, we present self-time-delay synchronization (STDS) of complex chaotic systems. STDS implies that the synchronization between the time-delay system (the receiver) and the original system (the transmitter) while maintaining the structure and parameters of systems unchanged, thus these various problems produced by time-delay in practice are avoided. It is more suitable to simulate real communication situation. Aimed to time-delay coupled complex chaotic systems, the control law is derived by active control technique. Based on STDS, a novel communication scheme is further designed according to chaotic masking. In simulation, we take time-delay coupled complex Lorenz system transmitting actual speech signal (analog signal) and binary signal as examples. The speech signal contains two components, which are transmitted by the real part and imaginary part of one complex state variable. Two sequences of binary bits are converted into analog signals by 2^M-ary and zero-order holder, then added into the real part and imaginary part of one complex state variable. Therefore, the STDS controller is realized by one critical state variable. It is simple in principle and easy to implement in engineering. Moreover, the communication system is robust to noise. It is possible to adopt cheap circuits with time-delay, which is economical and practical for communication.