Dynamics of asynchronous random Boolean networks with asynchrony generated by stochastic processes

An asynchronous Boolean network with N nodes whose states at each time point are determined by certain parent nodes is considered. We make use of the models developed by Matache and Heidel [Matache, M.T., Heidel, J., 2005. Asynchronous random Boolean network model based on elementary cellular automata rule 126. Phys. Rev. E 71, 026232] for a constant number of parents, and Matache [Matache, M.T., 2006. Asynchronous random Boolean network model with variable number of parents based on elementary cellular automata rule 126. IJMPB 20 (8), 897–923] for a varying number of parents. In both these papers the authors consider an asynchronous updating of all nodes, with asynchrony generated by various random distributions. We supplement those results by using various stochastic processes as generators for the number of nodes to be updated at each time point. In this paper we use the following stochastic processes: Poisson process, random walk, birth and death process, Brownian motion, and fractional Brownian motion. We study the dynamics of the model through sensitivity of the orbits to initial values, bifurcation diagrams, and fixed-point analysis. The dynamics of the system show that the number of nodes to be updated at each time point is of great importance, especially for the random walk, the birth and death, and the Brownian motion processes. Small or moderate values for the number of updated nodes generate order, while large values may generate chaos depending on the underlying parameters. The Poisson process generates order. With fractional Brownian motion, as the values of the Hurst parameter increase, the system exhibits order for a wider range of combinations of the underlying parameters

Transformers of markov chains

We investigate the possibility of synthesizing stable probability distribution generators on the basis of a complete system of deterministic elements and generators of random signals described by nonhomogeneous Markov chains. It is shown that such generators can be obtained by constructing some finite Moore automata with special transition functions. Preliminary speed estimates of the generators with given accuracy of realization of the distribution are found. The results are based on multiplicative properties of regular stochastic matrices

A linear bound on the k-rendezvous time for primitive sets of NZ matrices

A set of nonnegative matrices is called primitive if there exists a product of these matrices that is entrywise positive. Motivated by recent results relating synchronizing automata and primitive sets, we study the length of the shortest product of a primitive set having a column or a row with k positive entries, called its k-rendezvous time (k-RT}), in the case of sets of matrices having no zero rows and no zero columns. We prove that the k-RT is at most linear w.r.t. the matrix size n for small k, while the problem is still open for synchronizing automata. We provide two upper bounds on the k-RT: the second is an improvement of the first one, although the latter can be written in closed form. We then report numerical results comparing our upper bounds on the k-RT with heuristic approximation methods.Comment: 27 pages, 10 figur

Long-lived states in synchronized traffic flow. Empirical prompt and dynamical trap model

The present paper proposes a novel interpretation of the widely scattered states (called synchronized traffic) stimulated by Kerner's hypotheses about the existence of a multitude of metastable states in the fundamental diagram. Using single vehicle data collected at the German highway A1, temporal velocity patterns have been analyzed to show a collection of certain fragments with approximately constant velocities and sharp jumps between them. The particular velocity values in these fragments vary in a wide range. In contrast, the flow rate is more or less constant because its fluctuations are mainly due to the discreteness of traffic flow. Subsequently, we develop a model for synchronized traffic that can explain these characteristics. Following previous work (I.A.Lubashevsky, R.Mahnke, Phys. Rev. E v. 62, p. 6082, 2000) the vehicle flow is specified by car density, mean velocity, and additional order parameters $h$ and $a$ that are due to the many-particle effects of the vehicle interaction. The parameter $h$ describes the multilane correlations in the vehicle motion. Together with the car density it determines directly the mean velocity. The parameter $a$, in contrast, controls the evolution of $h$ only. The model assumes that $a$ fluctuates randomly around the value corresponding to the car configuration optimal for lane changing. When it deviates from this value the lane change is depressed for all cars forming a local cluster. Since exactly the overtaking manoeuvres of these cars cause the order parameter $a$ to vary, the evolution of the car arrangement becomes frozen for a certain time. In other words, the evolution equations form certain dynamical traps responsible for the long-time correlations in the synchronized mode.Comment: 16 pages, 10 figures, RevTeX

Delays, Inaccuracies and Anticipation in Microscopic Traffic Models

We generalize a wide class of time-continuous microscopic traffic models to include essential aspects of driver behaviour not captured by these models. Specifically, we consider (i) finite reaction times, (ii) estimation errors, (iii) looking several vehicles ahead (spatial anticipation), and (iv) temporal anticipation. The estimation errors are modelled as stochastic Wiener processes and lead to time-correlated fluctuations of the acceleration. We show that the destabilizing effects of reaction times and estimation errors can essentially be compensated for by spatial and temporal anticipation, that is, the combination of stabilizing and destabilizing effects results in the same qualitative macroscopic dynamics as that of the respectively underlying simple car-following model. In many cases, this justifies the use of simplified, physics-oriented models with a few parameters only. Although the qualitative dynamics is unchanged, multi-anticipation increase both spatial and temporal scales of stop-and-go waves and other complex patterns of congested traffic in agreement with real traffic data. Remarkably, the anticipation allows accident-free smooth driving in complex traffic situations even if reaction times exceed typical time headways.Comment: Major revision of the model and the simulations. Particularly, the number of model parameters has been reduce

On random primitive sets, directable NDFAs and the generation of slowly synchronizing DFAs

We tackle the problem of the randomized generation of slowly synchronizing deterministic automata (DFAs) by generating random primitive sets of matrices. We show that when the randomized procedure is too simple the exponent of the generated sets is O(n log n) with high probability, thus the procedure fails to return DFAs with large reset threshold. We extend this result to random nondeterministic automata (NDFAs) by showing, in particular, that a uniformly sampled NDFA has both a 2-directing word and a 3-directing word of length O(n log n) with high probability. We then present a more involved randomized algorithm that manages to generate DFAs with large reset threshold and we finally leverage this finding for exhibiting new families of DFAs with reset threshold of order $\Omega(n^2/4)$.Comment: 31 pages, 9 figures. arXiv admin note: text overlap with arXiv:1805.0672