This study considers a simple Boolean network with N nodes, each node’s state at time t being determined by a certain number of parent nodes. The network is analyzed when the connectivity k is fixed or variable. Making use of a Boolean rule that is a generalization of Rule 22 of elementary...

We present the stochastic model for queueing at two tollgates with line changing of vehicles to take into account fluctuating inflow and outflow. We study the jam formation and its transition in front of two tollgates on a highway. The line changing between two queues of vehicles has an...

We study the traffic states and queuing occurring in traffic flow on a toll highway with multi-lane tollgates. The traffic states change with increasing density and varying number of tollgates. When the manual-collection vehicles sort themselves into the tollgates, the queues occur just in front...

We study the traffic states and jams occurring in traffic flow on a two-lane toll highway with electronic and manual (traditional) tollgates. The electronic and manual collection vehicles sort themselves into their respective lanes at low density, while they mix at each tollgate at high density....

In this paper we review some recent results obtained in [F. den Hollander et al., Metastability and nucleation for conservative dynamics, EURANDOM report 99-025, J. Math. Phys. (2000), to appear] on metastability and nucleation for the two-dimensional lattice gas with Kawasaki dynamics at low...

We study the steady-state structure and dynamics of a 2-d Ising interface placed in an inhomogeneous external field with a sigmoidal profile which moves with velocity ve. In the strong coupling limit, the problem maps onto an asymmetric exclusion process involving motion of particles in 1-d with...

We introduce a reversible Markovian coagulation–fragmentation process on the set of partitions of {1,…,L} into disjoint intervals. Each interval can either split or merge with one of its two neighbors. The invariant measure can be seen as the Gibbs measure for a homogeneous pinning model...

We propose a dynamic packet routing strategy by using neural networks on scale-free networks. In this strategy, in order to determine the nodes to which the packets should be transmitted, we use path lengths to the destinations of the packets, and adjust the connection weights of the neural...

Occurrence of congestion of packet flow in computer networks is one of the unfavorable problems in packet communication and hence its avoidance should be investigated. We use a neural network model for packet routing control in a computer network proposed in a previous paper by Horiguchi and...

In a computer network where nodes can fail, multipath transmission can be used to increase the probability of successful transmission. However, even multipath transmission has a probability of failure, which depends on the selected paths. Hence, estimating this probability of failure is of great...