We investigate Threshold Random Boolean Networks with K=2 inputs per node, which are equivalent to Kauffman networks, with only part of the canalyzing functions as update functions. According to the simplest consideration these networks should be critical but it turns out that they show a rich...

Urban traffic is modeled using a dual graph representation of the urban transport network, where roads are mapped to nodes and intersections are mapped to links. The proposed model considers both the navigation of the vehicles in the network and the motion of the vehicles along roads. The...